We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 99320b9 commit b01c74bCopy full SHA for b01c74b
compiler/rustc_data_structures/src/graph/vec_graph/mod.rs
@@ -29,7 +29,7 @@ impl<N: Idx> VecGraph<N> {
29
30
// Create the *edge starts* array. We are iterating over over
31
// the (sorted) edge pairs. We maintain the invariant that the
32
- // length of the `node_starts` arary is enough to store the
+ // length of the `node_starts` array is enough to store the
33
// current source node -- so when we see that the source node
34
// for an edge is greater than the current length, we grow the
35
// edge-starts array by just enough.
0 commit comments