nordic-dev.net/rust
nordic-dev.net/rust
2
0
Fork 0
mirror of https://github.com/rust-lang/rust.git synced 2025-02-12 06:53:05 +00:00
Code Issues Packages Projects Releases Wiki Activity

Bugfix .each_edge in middle/graph.rs

Browse Source 
Edge iterator used the length of the nodes vector, must be a mistake.
This commit is contained in:
blake2-ppc 2013-08-07 19:29:19 +02:00 committed by Corey Richardson
parent 40bdbf0f5d
commit e7d4a9c7f2
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/librustc/middle/graph.rs
View File

@ -187,12 +187,12 @@ impl<N,E> Graph<N,E> {
pub fn each_node(&self, f: &fn(NodeIndex, &Node<N>) -> bool) -> bool {
//! Iterates over all edges defined in the graph.
range(0u, self.nodes.len()).advance(|i| f(NodeIndex(i), &self.nodes[i]))
self.nodes.iter().enumerate().advance(|(i, node)| f(NodeIndex(i), node))
}
pub fn each_edge(&self, f: &fn(EdgeIndex, &Edge<E>) -> bool) -> bool {
//! Iterates over all edges defined in the graph.
range(0u, self.nodes.len()).advance(|i| f(EdgeIndex(i), &self.edges[i]))
//! Iterates over all edges defined in the graph
self.edges.iter().enumerate().advance(|(i, edge)| f(EdgeIndex(i), edge))
}
pub fn each_outgoing_edge(&self,