diff options
| author | Rageking8 <tomleetyt@gmail.com> | 2022-10-14 00:25:34 +0800 |
|---|---|---|
| committer | Rageking8 <tomleetyt@gmail.com> | 2022-10-14 12:57:56 +0800 |
| commit | 7122abaddf2cf10ce26f86305ff540ae5b38c097 (patch) | |
| tree | 0b15091f50495c8af2c553c1efee8cd286506a4f /compiler/rustc_data_structures/src/graph | |
| parent | 4891d57f7aab37b5d6a84f2901c0bb8903111d53 (diff) | |
| download | rust-7122abaddf2cf10ce26f86305ff540ae5b38c097.tar.gz rust-7122abaddf2cf10ce26f86305ff540ae5b38c097.zip | |
more dupe word typos
Diffstat (limited to 'compiler/rustc_data_structures/src/graph')
| -rw-r--r-- | compiler/rustc_data_structures/src/graph/vec_graph/mod.rs | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/compiler/rustc_data_structures/src/graph/vec_graph/mod.rs b/compiler/rustc_data_structures/src/graph/vec_graph/mod.rs index 3d91bcade59..e8efbd09a2c 100644 --- a/compiler/rustc_data_structures/src/graph/vec_graph/mod.rs +++ b/compiler/rustc_data_structures/src/graph/vec_graph/mod.rs @@ -29,8 +29,8 @@ impl<N: Idx + Ord> VecGraph<N> { // Store the *target* of each edge into `edge_targets`. let edge_targets: Vec<N> = edge_pairs.iter().map(|&(_, target)| target).collect(); - // Create the *edge starts* array. We are iterating over over - // the (sorted) edge pairs. We maintain the invariant that the + // Create the *edge starts* array. We are iterating over the + // (sorted) edge pairs. We maintain the invariant that the // length of the `node_starts` array is enough to store the // current source node -- so when we see that the source node // for an edge is greater than the current length, we grow the |