Struct Tree 

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

Owned tree data independent of presentation policy.

Nodes remain data-only so the model can be reused independently of one component’s presentation policy.

Implementations

impl<T> Tree<T>

pub fn new() -> Self

Creates an empty, rootless tree.

pub fn root(self, root: T) -> Self

Sets the optional typed root value.

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

Appends one top-level node.

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

where I: IntoIterator<Item = N>, N: Into<TreeNode<T>>,

Appends top-level nodes in iteration order.

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

Includes or excludes the complete tree.

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

Omits start top-level nodes from the front and end from the back.

pub const fn root_value(&self) -> Option<&T>

Returns the optional root value.

pub fn child_nodes(&self) -> &[TreeNode<T>]

Returns all owned top-level nodes before visibility and offset are applied.

Trait Implementations

impl<T: Clone> Clone for Tree<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

impl<T> Default for Tree<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: PartialEq> PartialEq for Tree<T>

fn eq(&self, other: &Tree<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 Tree<T>

impl<T> StructuralPartialEq for Tree<T>