diff options
| author | bors <bors@rust-lang.org> | 2020-10-28 01:40:06 +0000 |
|---|---|---|
| committer | bors <bors@rust-lang.org> | 2020-10-28 01:40:06 +0000 |
| commit | db241bb0c8d257e13c1560f6250e49879477039e (patch) | |
| tree | 492166fee5d39e53e20b60e1779a818691c43b31 /compiler/rustc_data_structures/src | |
| parent | 90e6d0d46bae511aecea04ac5eeb3c387f0c04f4 (diff) | |
| parent | 6967005e6e626f4ff62f53b971c00e6e12d2e618 (diff) | |
| download | rust-db241bb0c8d257e13c1560f6250e49879477039e.tar.gz rust-db241bb0c8d257e13c1560f6250e49879477039e.zip | |
Auto merge of #78458 - Dylan-DPC:rollup-tan044s, r=Dylan-DPC
Rollup of 10 pull requests Successful merges: - #78152 (Separate unsized locals) - #78297 (Suggest calling await on method call and field access) - #78351 (Move "mutable thing in const" check from interning to validity) - #78365 (check object safety of generic constants) - #78379 (Tweak invalid `fn` header and body parsing) - #78391 (Add const_fn in generics test) - #78401 (resolve: private fields in tuple struct ctor diag) - #78408 (Remove tokens from foreign items in `TokenStripper`) - #78447 (Fix typo in comment) - #78453 (Fix typo in comments) Failed merges: r? `@ghost`
Diffstat (limited to 'compiler/rustc_data_structures/src')
| -rw-r--r-- | compiler/rustc_data_structures/src/graph/vec_graph/mod.rs | 2 |
1 files changed, 1 insertions, 1 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 064467174ca..4ed88878418 100644 --- a/compiler/rustc_data_structures/src/graph/vec_graph/mod.rs +++ b/compiler/rustc_data_structures/src/graph/vec_graph/mod.rs @@ -29,7 +29,7 @@ impl<N: Idx> VecGraph<N> { // Create the *edge starts* array. We are iterating over over // the (sorted) edge pairs. We maintain the invariant that the - // length of the `node_starts` arary is enough to store 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 // edge-starts array by just enough. |