Struct NodeList 

pub struct NodeList<BackendT, ContextT, ErrorT, IdT, DataT>(pub Vec<Node<BackendT, ContextT, ErrorT, IdT, DataT>>);

Tree node list.

Tuple Fields

0: Vec<Node<BackendT, ContextT, ErrorT, IdT, DataT>>

Implementations

impl<BackendT, ContextT, ErrorT, IdT, DataT> NodeList<BackendT, ContextT, ErrorT, IdT, DataT>

pub fn iter( &self, only_expanded: bool, ) -> NodeIterator<'_, BackendT, ContextT, ErrorT, IdT, DataT>

Iterate nodes in visual order from top to bottom.

When only_expanded is true will skip the children of collapsed branches.

pub fn at_path( &self, path: NodePath, ) -> Option<&Node<BackendT, ContextT, ErrorT, IdT, DataT>>

where BackendT: TreeBackend<ContextT, ErrorT, IdT, DataT>,

Get node at path.

pub fn at_path_mut( &mut self, path: NodePath, ) -> Option<&mut Node<BackendT, ContextT, ErrorT, IdT, DataT>>

where BackendT: TreeBackend<ContextT, ErrorT, IdT, DataT>,

Get node at path.

pub fn fill_path( &self, path: &mut NodePath, node: &Node<BackendT, ContextT, ErrorT, IdT, DataT>, ) -> bool

where BackendT: TreeBackend<ContextT, ErrorT, IdT, DataT>,

Fill path to node.

Returns true if found.

pub fn add( &mut self, depth: usize, kind: NodeKind, id: IdT, representation: Representation, )

where BackendT: TreeBackend<ContextT, ErrorT, IdT, DataT>,

Add a node.

pub fn insert( &mut self, index: usize, depth: usize, kind: NodeKind, id: IdT, representation: Representation, )

where BackendT: TreeBackend<ContextT, ErrorT, IdT, DataT>,

Insert a node.

Trait Implementations

impl<BackendT, ContextT, ErrorT, IdT, DataT> Default for NodeList<BackendT, ContextT, ErrorT, IdT, DataT>

fn default() -> Self

Returns the “default value” for a type.

impl<BackendT, ContextT, ErrorT, IdT, DataT> From<Vec<Node<BackendT, ContextT, ErrorT, IdT, DataT>>> for NodeList<BackendT, ContextT, ErrorT, IdT, DataT>

fn from(vector: Vec<Node<BackendT, ContextT, ErrorT, IdT, DataT>>) -> Self

Converts to this type from the input type.

impl<BackendT, ContextT, ErrorT, IdT, DataT> FromIterator<Node<BackendT, ContextT, ErrorT, IdT, DataT>> for NodeList<BackendT, ContextT, ErrorT, IdT, DataT>

fn from_iter<IteratorT>(iterator: IteratorT) -> Self

where IteratorT: IntoIterator<Item = Node<BackendT, ContextT, ErrorT, IdT, DataT>>,

Creates a value from an iterator.

impl<'this, BackendT, ContextT, ErrorT, IdT, DataT> IntoIterator for &'this NodeList<BackendT, ContextT, ErrorT, IdT, DataT>

type Item = &'this Node<BackendT, ContextT, ErrorT, IdT, DataT>

The type of the elements being iterated over.

type IntoIter = Iter<'this, Node<BackendT, ContextT, ErrorT, IdT, DataT>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'this, BackendT, ContextT, ErrorT, IdT, DataT> IntoIterator for &'this mut NodeList<BackendT, ContextT, ErrorT, IdT, DataT>

type Item = &'this mut Node<BackendT, ContextT, ErrorT, IdT, DataT>

The type of the elements being iterated over.

type IntoIter = IterMut<'this, Node<BackendT, ContextT, ErrorT, IdT, DataT>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.