Struct Tree

pub struct Tree<K: Ord, V> { /* private fields */ }

Implementations

impl<K: Ord, V> Tree<K, V>

pub fn new(value: V) -> Tree<K, V>

pub fn value(&self) -> &V

pub fn value_mut(&mut self) -> &mut V

pub fn set_value(&mut self, value: V) -> V

pub fn children_keys(&self) -> Keys<'_, K, Self>

pub fn children(&self) -> Values<'_, K, Self>

pub fn children_mut(&mut self) -> ValuesMut<'_, K, Self>

pub fn iter_single(&self) -> Iter<'_, K, Self>

An iterator visiting the children without nesting

pub fn iter_single_mut(&mut self) -> IterMut<'_, K, Self>

An iterator visiting the children without nesting and returning mutable references

pub fn iter_depth_first(&self) -> DepthFirstIter<'_, K, V>

pub fn iter_depth_first_mut(&mut self) -> DepthFirstIterMut<'_, K, V>

pub fn iter_breadth_first(&self) -> BreadthFirstIter<'_, K, V>

pub fn iter_breadth_first_mut(&mut self) -> BreadthFirstIterMut<'_, K, V>

pub fn child_count(&mut self) -> usize

pub fn is_childless(&self) -> bool

pub fn clear(&mut self)

pub fn entry(&mut self, key: K) -> Entry<'_, K, V>

pub fn get_child<Q>(&self, key: &Q) -> Option<&Self>

where K: Borrow<Q>, Q: Ord + ?Sized,

pub fn get_key_value<Q>(&self, key: &Q) -> Option<(&K, &Self)>

where K: Borrow<Q>, Q: Ord + ?Sized,

pub fn contains_key<Q>(&self, key: &Q) -> bool

where K: Borrow<Q>, Q: Ord + ?Sized,

pub fn get_child_mut<Q>(&mut self, key: &Q) -> Option<&mut Self>

where K: Borrow<Q>, Q: Ord + ?Sized,

pub fn add_child(&mut self, key: K, value: V) -> (Option<V>, &mut Self)

pub fn remove<Q>(&mut self, key: &Q) -> Option<Self>

where K: Borrow<Q>, Q: Ord + ?Sized,

pub fn remove_entry<Q>(&mut self, key: &Q) -> Option<(K, Self)>

where K: Borrow<Q>, Q: Ord + ?Sized,

pub fn retain<F>(&mut self, f: F)

where F: FnMut(&K, &mut Self) -> bool,

pub fn into_keys(self) -> IntoKeys<K, Self>

pub fn into_values(self) -> IntoValues<K, Self>

Trait Implementations

impl<K: Clone + Ord, V: Clone> Clone for Tree<K, V>

fn clone(&self) -> Tree<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Ord, V: Debug> Debug for Tree<K, V>

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

Formats the value using the given formatter.

impl<K: Default + Ord, V: Default> Default for Tree<K, V>

fn default() -> Tree<K, V>

Returns the “default value” for a type.

impl<K: Hash + Ord, V: Hash> Hash for Tree<K, V>

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<K, Q, V> Index<&Q> for Tree<K, V>

where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

type Output = Tree<K, V>

The returned type after indexing.

fn index(&self, index: &Q) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<K: Ord, V> IntoIterator for Tree<K, V>

type Item = (K, Tree<K, V>)

The type of the elements being iterated over.

type IntoIter = IntoIter<K, Tree<K, V>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K: Ord + Ord, V: Ord> Ord for Tree<K, V>

fn cmp(&self, other: &Tree<K, V>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<K: PartialEq + Ord, V: PartialEq> PartialEq for Tree<K, V>

fn eq(&self, other: &Tree<K, V>) -> 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<K: PartialOrd + Ord, V: PartialOrd> PartialOrd for Tree<K, V>

fn partial_cmp(&self, other: &Tree<K, V>) -> Option<Ordering>

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

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

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

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

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

impl<K: Eq + Ord, V: Eq> Eq for Tree<K, V>

impl<K: Ord, V> StructuralPartialEq for Tree<K, V>