Struct tdf_utils::tree::TreeNode

pub struct TreeNode<K, Item> where
    K: Eq,
    Item: TreeNodeLike<K> + Ord,  { /* fields omitted */ }

Actual TreeNode

Implementations

impl<K, Item> TreeNode<K, Item> where
    K: Eq,
    Item: TreeNodeLike<K> + Ord, 

TreeNode methods

pub fn new(val: Item) -> TreeNode<K, Item>

pub fn get(&mut self, key: &K) -> Option<&mut TreeNode<K, Item>>

find by key recursively

pub fn append(&mut self, val: Item) -> bool

Add node to TreeNode

Trait Implementations

impl<K: Clone, Item: Clone> Clone for TreeNode<K, Item> where
    K: Eq,
    Item: TreeNodeLike<K> + Ord, 

fn clone(&self) -> TreeNode<K, Item>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Debug, Item: Debug> Debug for TreeNode<K, Item> where
    K: Eq,
    Item: TreeNodeLike<K> + Ord, 

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

Formats the value using the given formatter.

impl<K: Default, Item: Default> Default for TreeNode<K, Item> where
    K: Eq,
    Item: TreeNodeLike<K> + Ord, 

fn default() -> TreeNode<K, Item>

Returns the "default value" for a type.

impl<'de, K, Item> Deserialize<'de> for TreeNode<K, Item> where
    K: Eq,
    Item: TreeNodeLike<K> + Ord,
    K: Deserialize<'de>,
    Item: Deserialize<'de>,
    K: Default,
    Item: Default, 

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<K: Eq, Item: Eq> Eq for TreeNode<K, Item> where
    K: Eq,
    Item: TreeNodeLike<K> + Ord, 

impl<K, Item> Ord for TreeNode<K, Item> where
    K: Eq + PartialOrd,
    Item: TreeNodeLike<K> + Ord, 

fn cmp(&self, other: &Self) -> Ordering

This method returns an [Ordering] between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl<K, Item> PartialEq<TreeNode<K, Item>> for TreeNode<K, Item> where
    K: Eq,
    Item: TreeNodeLike<K> + Ord, 

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

This method tests for self and other values to be equal, and is used by ==.

#[must_use]fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<K: PartialOrd, Item: PartialOrd> PartialOrd<TreeNode<K, Item>> for TreeNode<K, Item> where
    K: Eq,
    Item: TreeNodeLike<K> + Ord, 

fn partial_cmp(&self, other: &TreeNode<K, Item>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &TreeNode<K, Item>) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &TreeNode<K, Item>) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &TreeNode<K, Item>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &TreeNode<K, Item>) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<K, Item> Serialize for TreeNode<K, Item> where
    K: Eq,
    Item: TreeNodeLike<K> + Ord,
    K: Serialize,
    Item: Serialize, 

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

Serialize this value into the given Serde serializer.

impl<K, Item> StructuralEq for TreeNode<K, Item> where
    K: Eq,
    Item: TreeNodeLike<K> + Ord,