pub fn collect<T>(ssa: &mut T)
where
    T: Clone
        + SSAExtra
        + SSAMod<ActionRef = <T as Graph>::GraphNodeRef, CFEdgeRef = <T as Graph>::GraphEdgeRef>,
{
    mark(ssa);
    sweep(ssa);
}
/// Removes SSA nodes that are not used by any other node.
/// The algorithm will not consider whether the uses keeping a node alive
/// are in code that is actually executed or not. For a better analysis
/// look at `analysis::constant_propagation`.
Removes SSA nodes that are not used by any other node.
The algorithm will not consider whether the uses keeping a node alive
are in code that is actually executed or not. For a better analysis
look at `analysis::constant_propagation`.
Removes SSA nodes that are not used by any other node . The algorithm will not consider whether the uses keeping a node alive are in code that is actually executed or not . For a better analysis look at ` analysis :: constant_propagation ` .
pub fn collect<T>(ssa: &mut T)
where
    T: Clone
        + SSAExtra
        + SSAMod<ActionRef = <T as Graph>::GraphNodeRef, CFEdgeRef = <T as Graph>::GraphEdgeRef>,
{
    mark(ssa);
    sweep(ssa);
}
pub fn collect < T > ( ssa : & mut T ) where T : Clone + SSAExtra + SSAMod < ActionRef = < T as Graph > :: GraphNodeRef , CFEdgeRef = < T as Graph > :: GraphEdgeRef > , { mark ( ssa ) ; sweep ( ssa ) ; }
Removes SSA nodes that are not used by any other node.
Removes SSA nodes that are not used by any other node .
ssa
&mut T
ssa
&mut T