pub fn to_owned_vec_nodes(&self) -> SortResults<T>
    where
        T: Clone,
    {
        SortResults::new(
            self.nodes().flatten().map(|node| node.clone()).collect(),
            self.node_depends.len(),
        )
    }
/// Sort and return a vector (with owned/cloned 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/cloned 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 / cloned 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 to_owned_vec_nodes(&self) -> SortResults<T>
    where
        T: Clone,
    {
        SortResults::new(
            self.nodes().flatten().map(|node| node.clone()).collect(),
            self.node_depends.len(),
        )
    }
pub fn to_owned_vec_nodes ( & self ) -> SortResults < T > where T : Clone , { SortResults :: new ( self . nodes ( ) . flatten ( ) . map ( | node | node . clone ( ) ) . collect ( ) , self . node_depends . len ( ) , ) }
Sort and return a vector (with owned/cloned nodes) of the results.
Sort and return a vector ( with owned / cloned nodes ) of the results .
&self
&self