Struct Tree

pub struct Tree<T> { /* private fields */ }

Slotmap-backed ID-tree.

Always contains at least a root node.

Implementations

impl<T> Tree<T>

pub fn try_into_iter(self: Rc<Self>) -> Result<IntoIter<T>, Rc<Self>>

pub fn nodes(&self) -> Nodes<'_, T>

impl<T> Tree<T>

pub fn new(root: T) -> Rc<Self>

Creates a tree with a root node.

pub fn with_capacity(root: T, capacity: usize) -> Rc<Self>

Creates a tree with a root node and the specified capacity.

pub fn get(self: &Rc<Self>, id: NodeId) -> Option<NodeRef<T>>

Returns a reference to the specified node.

pub fn root(self: &Rc<Self>) -> NodeRef<T>

Returns a reference to the root node.

pub fn orphan(self: &Rc<Self>, value: T) -> NodeId

Creates an orphan node.

Trait Implementations

impl<T: Debug> Debug for Tree<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> IntoIterator for Tree<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> PartialEq for Tree<T>

where T: PartialEq,

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.