fn rev_constraint_graph(
        &mut self,
    ) -> Rc<VecGraph<ConstraintSccIndex>> {
        if let Some(g) = &self.rev_constraint_graph {
            return g.clone();
        }

        let rev_graph = Rc::new(self.constraint_sccs.reverse());
        self.rev_constraint_graph = Some(rev_graph.clone());
        rev_graph
    }
/// Compute and return the reverse SCC-based constraint graph (lazilly).
Compute and return the reverse SCC-based constraint graph (lazilly).
Compute and return the reverse SCC - based constraint graph ( lazilly ) .
fn rev_constraint_graph(
        &mut self,
    ) -> Rc<VecGraph<ConstraintSccIndex>> {
        if let Some(g) = &self.rev_constraint_graph {
            return g.clone();
        }
        let rev_graph = Rc::new(self.constraint_sccs.reverse());
        self.rev_constraint_graph = Some(rev_graph.clone());
        rev_graph
    }
fn rev_constraint_graph ( & mut self , ) -> Rc < VecGraph < ConstraintSccIndex > > { if let Some ( g ) = & self . rev_constraint_graph { return g . clone ( ) ; } let rev_graph = Rc :: new ( self . constraint_sccs . reverse ( ) ) ; self . rev_constraint_graph = Some ( rev_graph . clone ( ) ) ; rev_graph }
Compute and return the reverse SCC-based constraint graph (lazilly).
Compute and return the reverse SCC - based constraint graph ( lazilly ) .
&mut self