about summary refs log tree commit diff
path: root/compiler/rustc_data_structures/src/graph
diff options
context:
space:
mode:
authorRalf Jung <post@ralfj.de>2023-01-13 11:46:54 +0100
committerRalf Jung <post@ralfj.de>2023-01-13 11:46:54 +0100
commit9475277c235d2297dc446155325b0b3fcfdbf722 (patch)
treebf243b402462c46038a1692d4ab52a7148b75d52 /compiler/rustc_data_structures/src/graph
parent9742679ebed966c62bf457df8353b9a5c6c22d29 (diff)
parent7d59c0ccaa3aeb528a66ae3d2fec6a5ebbe44bc2 (diff)
downloadrust-9475277c235d2297dc446155325b0b3fcfdbf722.tar.gz
rust-9475277c235d2297dc446155325b0b3fcfdbf722.zip
Merge from rustc
Diffstat (limited to 'compiler/rustc_data_structures/src/graph')
-rw-r--r--compiler/rustc_data_structures/src/graph/scc/tests.rs2
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