diff options
| author | Maybe Waffle <waffle.lapkin@gmail.com> | 2022-11-16 20:34:16 +0000 |
|---|---|---|
| committer | Maybe Waffle <waffle.lapkin@gmail.com> | 2023-01-17 08:09:33 +0000 |
| commit | 6a28fb42a8b8f1f67fe854c2206148171e434d73 (patch) | |
| tree | eeab4f46bee891a43cc8aa71db6692a55a8dde73 /compiler/rustc_data_structures/src/graph | |
| parent | 279f1c9d8c26a8d227ae8ab806d262bb784b251b (diff) | |
| download | rust-6a28fb42a8b8f1f67fe854c2206148171e434d73.tar.gz rust-6a28fb42a8b8f1f67fe854c2206148171e434d73.zip | |
Remove double spaces after dots in comments
Diffstat (limited to 'compiler/rustc_data_structures/src/graph')
| -rw-r--r-- | compiler/rustc_data_structures/src/graph/scc/tests.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/rustc_data_structures/src/graph/scc/tests.rs b/compiler/rustc_data_structures/src/graph/scc/tests.rs index 9940fee60d7..820a70fc8e4 100644 --- a/compiler/rustc_data_structures/src/graph/scc/tests.rs +++ b/compiler/rustc_data_structures/src/graph/scc/tests.rs @@ -84,7 +84,7 @@ fn test_find_state_2() { // 0 -> 1 -> 2 -> 1 // // and at this point detect a cycle. The state of 2 will thus be - // `InCycleWith { 1 }`. We will then visit the 1 -> 3 edge, which + // `InCycleWith { 1 }`. We will then visit the 1 -> 3 edge, which // will attempt to visit 0 as well, thus going to the state // `InCycleWith { 0 }`. Finally, node 1 will complete; the lowest // depth of any successor was 3 which had depth 0, and thus it |
