crate fn new(set: &'s ConstraintSet, constraint_graph: &'s ConstraintGraph) -> Self {
        Self {
            set,
            constraint_graph,
        }
    }
/// Create a "dependency graph" where each region constraint `R1:
/// R2` is treated as an edge `R1 -> R2`. We use this graph to
/// construct SCCs for region inference but also for error
/// reporting.
Create a "dependency graph" where each region constraint `R1:
R2` is treated as an edge `R1 -> R2`. We use this graph to
construct SCCs for region inference but also for error
reporting.
Create a " dependency graph " where each region constraint ` R1 : R2 ` is treated as an edge ` R1 - > R2 ` . We use this graph to construct SCCs for region inference but also for error reporting .
crate fn new(set: &'s ConstraintSet, constraint_graph: &'s ConstraintGraph) -> Self {
        Self {
            set,
            constraint_graph,
        }
    }
crate fn new ( set : & ' s ConstraintSet , constraint_graph : & ' s ConstraintGraph ) -> Self { Self { set , constraint_graph , } }
Create a "dependency graph" where each region constraint `R1:
R2` is treated as an edge `R1 -> R2`.
Create a " dependency graph " where each region constraint ` R1 : R2 ` is treated as an edge ` R1 - > R2 ` .
set
&'s ConstraintSet
constraint_graph
&'s ConstraintGraph