diff options
| author | Niko Matsakis <niko@alum.mit.edu> | 2019-06-24 15:34:37 -0400 |
|---|---|---|
| committer | Niko Matsakis <niko@alum.mit.edu> | 2019-07-02 12:25:23 -0400 |
| commit | 0dd074e8548ce386d38e647a47d41ec75c93f307 (patch) | |
| tree | ca6f87a2350abe7c8dcf15fbace9b27b430d47e1 /src/librustc_data_structures/graph/vec_graph | |
| parent | d9f4d2ad1a6af13390f99a8e8bf153e77f40bc12 (diff) | |
| download | rust-0dd074e8548ce386d38e647a47d41ec75c93f307.tar.gz rust-0dd074e8548ce386d38e647a47d41ec75c93f307.zip | |
more centril nits
Diffstat (limited to 'src/librustc_data_structures/graph/vec_graph')
| -rw-r--r-- | src/librustc_data_structures/graph/vec_graph/mod.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/librustc_data_structures/graph/vec_graph/mod.rs b/src/librustc_data_structures/graph/vec_graph/mod.rs index c425502f219..6fb1bb42d2c 100644 --- a/src/librustc_data_structures/graph/vec_graph/mod.rs +++ b/src/librustc_data_structures/graph/vec_graph/mod.rs @@ -27,7 +27,7 @@ impl<N: Idx> VecGraph<N> { let num_edges = edge_pairs.len(); - // Store the *target* of each edge into `edge_targets` + // 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 |
