Struct NodeCollection

pub struct NodeCollection<T: Debug + Clone> {
    pub nodes: Vec<Node<T>>,
}

NodeCollection represents a Vec of Nodes. Usually retrived by collecting over a Node linked list using the CollectNode trait implementation. WARNING: this is not a linked list, but simply a collection of unrelated nodes. The contained nodes might come from separated linked lists or from the same one.

Fields

nodes: Vec<Node<T>>

Implementations

impl<T: Debug + Clone> NodeCollection<T>

pub fn from_vec(nodes: Vec<Node<T>>) -> Self

Builds a new collection with the vector provided.

pub fn new() -> Self

pub fn into_nodes(self) -> Vec<Node<T>>

Consume self and retrive its Nodes.

pub fn as_nodes(&self) -> &Vec<Node<T>>

Retrive a reference to the Nodes.

pub fn as_mut_nodes(&mut self) -> &mut Vec<Node<T>>

Retrive a mutable reference to the Nodes.

pub fn push(&mut self, node: Node<T>)

Push a node to the collection.

pub fn free(&self)

Re-set the parent, prev and next pointers in every node of the collection. This function is commonly used when iterating over a linked list detaching the nodes satisfying an identifier using HedelDetach::detach_preserve. refer to HedelDetach::detach_preserve for a code example.

WARNING: don’t use this function to detach a node from a linked list.

Trait Implementations

impl<T: Debug + Clone> IntoIterator for NodeCollection<T>

type Item = Node<T>

The type of the elements being iterated over.

type IntoIter = IntoIter<Node<T>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.