pub fn into_vec_nodes(self) -> SortResults<T> {
        let len = self.node_depends.len();
        let nodes: Vec<_> = self.into_nodes().flatten().collect();
        SortResults::new(nodes, len)
    }
/// Sort and return a vector (with owned/consumed nodes) of the results. If a cycle is detected,
/// partial results will be inside the `Partial` variant, otherwise full results will be in the
/// `Full` variant.
Sort and return a vector (with owned/consumed nodes) of the results. If a cycle is detected,
partial results will be inside the `Partial` variant, otherwise full results will be in the
`Full` variant.
Sort and return a vector ( with owned / consumed nodes ) of the results . If a cycle is detected partial results will be inside the ` Partial ` variant otherwise full results will be in the ` Full ` variant .
pub fn into_vec_nodes(self) -> SortResults<T> {
        let len = self.node_depends.len();
        let nodes: Vec<_> = self.into_nodes().flatten().collect();
        SortResults::new(nodes, len)
    }
pub fn into_vec_nodes ( self ) -> SortResults < T > { let len = self . node_depends . len ( ) ; let nodes : Vec < _ > = self . into_nodes ( ) . flatten ( ) . collect ( ) ; SortResults :: new ( nodes , len ) }
Sort and return a vector (with owned/consumed nodes) of the results.
Sort and return a vector ( with owned / consumed nodes ) of the results .
self
self