We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 7290e2e commit 6bfa8c7Copy full SHA for 6bfa8c7
src/cargo/ops/tree/graph.rs
@@ -205,9 +205,9 @@ impl<'a> Graph<'a> {
205
pub fn invert(&mut self) {
206
let mut new_edges = vec![Edges::new(); self.edges.len()];
207
for (from_idx, node_edges) in self.edges.iter().enumerate() {
208
- for (kind, edges) in &node_edges.0 {
209
- for edge_idx in edges {
210
- new_edges[*edge_idx].add_edge(*kind, from_idx);
+ for (edge_kind, edge_indexes) in &node_edges.0 {
+ for edge_index in edge_indexes {
+ new_edges[*edge_index].add_edge(*edge_kind, from_idx);
211
}
212
213
0 commit comments