bjoernager/rust
bjoernager/rust
1
Fork 0
Code Activity

more dupe word typos

Browse source
This commit is contained in:
Rageking8 2022-10-14 00:25:34 +08:00
parent 4891d57f7a
commit 7122abaddf
47 changed files with 68 additions and 72 deletions
Download patch file Download diff file Expand all files Collapse all files

4
compiler/rustc_data_structures/src/graph/vec_graph/mod.rs
View file

@ -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