pub fn iterate_until_fixed_point<'a, F>(&'a self, mut op: F)
        where F: FnMut(usize, EdgeIndex, &'a Edge<E>) -> bool
    {
        let mut iteration = 0;
        let mut changed = true;
        while changed {
            changed = false;
            iteration += 1;
            for (edge_index, edge) in self.enumerated_edges() {
                changed |= op(iteration, edge_index, edge);
            }
        }
    }
/// A common use for graphs in our compiler is to perform
/// fixed-point iteration. In this case, each edge represents a
/// constraint, and the nodes themselves are associated with
/// variables or other bitsets. This method facilitates such a
/// computation.
A common use for graphs in our compiler is to perform
fixed-point iteration. In this case, each edge represents a
constraint, and the nodes themselves are associated with
variables or other bitsets. This method facilitates such a
computation.
A common use for graphs in our compiler is to perform fixed - point iteration . In this case each edge represents a constraint and the nodes themselves are associated with variables or other bitsets . This method facilitates such a computation .
pub fn iterate_until_fixed_point<'a, F>(&'a self, mut op: F)
        where F: FnMut(usize, EdgeIndex, &'a Edge<E>) -> bool
    {
        let mut iteration = 0;
        let mut changed = true;
        while changed {
            changed = false;
            iteration += 1;
            for (edge_index, edge) in self.enumerated_edges() {
                changed |= op(iteration, edge_index, edge);
            }
        }
    }
pub fn iterate_until_fixed_point < ' a , F > ( & ' a self , mut op : F ) where F : FnMut ( usize , EdgeIndex , & ' a Edge < E > ) -> bool { let mut iteration = 0 ; let mut changed = true ; while changed { changed = false ; iteration += 1 ; for ( edge_index , edge ) in self . enumerated_edges ( ) { changed |= op ( iteration , edge_index , edge ) ; } } }
A common use for graphs in our compiler is to perform
fixed-point iteration.
A common use for graphs in our compiler is to perform fixed - point iteration .
&'a self
op
F
&'a self
op
F