Struct Tree 

pub struct Tree<T> {
    pub value: T,
    pub children: Vec<Tree<T>>,
}

Very simple general purpose tree structure.

Fields

value: T

The value of this node.

children: Vec<Tree<T>>

The children of this node.

Implementations

impl<T> Tree<T>

pub fn new(value: T) -> Self

pub fn new_with_children(value: T, children: Vec<Tree<T>>) -> Self

pub fn with_children(self, children: Vec<Tree<T>>) -> Self

pub fn find_or_insert<'a>( &'a mut self, func: impl Fn(&T) -> bool, ) -> &'a mut Tree<T>

where T: Default,

Iterates over the children of this node and applies the function to each child, returning the first child that matches the predicate. If no child matches, it creates a new child with the default value of T and returns it.

pub fn sort_recursive(&mut self)

where T: Ord,

pub fn to_string_indented(&self) -> String

where T: Display,

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> Default for Tree<T>

fn default() -> Tree<T>

Returns the “default value” for a type.

impl<'de, T> Deserialize<'de> for Tree<T>

where T: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: Display> Display for Tree<T>

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

Formats the value using the given formatter.

impl<T> From<T> for Tree<T>

fn from(value: T) -> Self

Converts to this type from the input type.

impl<T: Hash> Hash for Tree<T>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

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> Serialize for Tree<T>

where T: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Eq> Eq for Tree<T>

impl<T> StructuralPartialEq for Tree<T>