Struct TreeNode 

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

One owned value and its recursive child nodes.

Implementations

impl<T> TreeNode<T>

pub fn new(value: T) -> Self

Creates a visible leaf node from a typed value.

pub fn child(self, child: impl Into<Self>) -> Self

Appends one child node.

pub fn children<I, N>(self, children: I) -> Self

where I: IntoIterator<Item = N>, N: Into<Self>,

Appends child nodes in iteration order.

pub const fn hidden(self, hidden: bool) -> Self

Includes or excludes this node and all of its descendants.

pub const fn child_offset(self, start: usize, end: usize) -> Self

Omits start children from the front and end from the back.

pub const fn value(&self) -> &T

Returns this node’s value.

pub fn child_nodes(&self) -> &[Self]

Returns all owned children before visibility and offset are applied.

pub const fn is_hidden(&self) -> bool

Returns whether this node and its descendants are excluded.

Trait Implementations

impl<T: Clone> Clone for TreeNode<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for TreeNode<T>

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

Formats the value using the given formatter.

impl<T> From<T> for TreeNode<T>

fn from(value: T) -> Self

Converts to this type from the input type.

impl<T: PartialEq> PartialEq for TreeNode<T>

fn eq(&self, other: &TreeNode<T>) -> 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<T: Eq> Eq for TreeNode<T>

impl<T> StructuralPartialEq for TreeNode<T>