Struct generic_tree::Node

pub struct Node<K, V> { /* fields omitted */ }

Implementations

impl<K, V> Node<K, V> where
    K: PartialEq, 

pub fn new(key: K, value: V) -> Self

pub fn add_child(&mut self, child: Node<K, V>) -> Option<Box<Node<K, V>>>

pub fn add_child_at_path(
    &mut self,
    path: &[&K],
    child: Node<K, V>
) -> Result<Option<Box<Node<K, V>>>, Error>

pub fn get_child<Q>(&self, path: &[Q]) -> Option<&Node<K, V>> where
    Q: PartialEq<K>, 

Get a child node based on a list of keys.

Examples

use generic_tree::Node;



// Tree structure:
// grandparent -> parent -> child
assert!(grandparent.get_child(&["parent", "child"]).is_some());

pub fn get_mut_child(&mut self, path: &[&K]) -> Option<&mut Node<K, V>>

pub fn take_child(&mut self, path: &[&K]) -> Option<Node<K, V>>

pub fn value(&self) -> &V

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

pub fn key(&self) -> &K

Trait Implementations

impl<K, V> PartialEq<K> for Node<K, V> where
    K: PartialEq, 

fn eq(&self, other: &K) -> 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, V> PartialEq<Node<K, V>> for Node<K, V> where
    K: PartialEq, 

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 !=.