Struct TreeNode

pub struct TreeNode<N: Node> {
    pub depth: usize,
    pub elements: IndexSet<N>,
    pub counter: usize,
}

A node in a tree.

Fields

depth: usize

The current depth.

elements: IndexSet<N>

The current node.

counter: usize

A counter.

Implementations

impl<N: Node> TreeNode<N>

pub fn new(elements: IndexSet<N>) -> Self

Initializes a new TreeNode from a vector of starting elements.

pub fn create_child(&mut self) -> TreeNode<N>

Adds a child to the current node.

pub fn remove_element(&mut self, element: &N) -> bool

Removes an element from the current node. If the element does not exist, increment an internal counter which later used to generate an error that the user attempted to await a future twice. Returns true if the element was removed but not the first one in the node.

Trait Implementations

impl<N: Clone + Node> Clone for TreeNode<N>

fn clone(&self) -> TreeNode<N>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<N: Debug + Node> Debug for TreeNode<N>

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

Formats the value using the given formatter.

impl<N: PartialEq + Node> PartialEq for TreeNode<N>

fn eq(&self, other: &TreeNode<N>) -> 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.

impl<N: Eq + Node> Eq for TreeNode<N>

impl<N: Node> StructuralPartialEq for TreeNode<N>