Struct radix_tree::Node

pub struct Node<K, V> {
    pub path: Vec<K>,
    pub data: Option<V>,
    pub indices: Vec<K>,
    pub nodes: Vec<Node<K, V>>,
}

Fields

path: Vec<K>

data: Option<V>

indices: Vec<K>

nodes: Vec<Node<K, V>>

Methods

impl<K, V> Node<K, V> where
    K: Clone + Copy + PartialEq, 

pub fn new<P>(path: P, data: V) -> Self where
    P: Vectorable<K>, 

pub fn insert_with(
    &mut self,
    path: &mut Vec<K>,
    data: Option<V>,
    force_update: bool
) -> &mut Self

pub fn add_node_with(
    &mut self,
    path: &mut Vec<K>,
    data: Option<V>,
    i: usize,
    force_update: bool
) -> &mut Self

pub fn find_with(&self, path: &mut Vec<K>) -> Option<&Self>

pub fn find_node_with(&self, path: &mut Vec<K>, i: usize) -> Option<&Self>

Trait Implementations

impl<K, V> Radix<K, V> for Node<K, V> where
    K: Clone + Copy + PartialEq, 

fn remove<P>(&mut self, path: P) where
    P: Vectorable<K>, 

fn insert<P>(&mut self, path: P, data: V) -> &mut Self where
    P: Vectorable<K>, 

fn find<P>(&self, path: P) -> Option<&Self> where
    P: Vectorable<K>, 

fn add_node<P>(&mut self, path: P, data: V) -> &mut Self where
    P: Vectorable<K>, 

fn find_node<P>(&self, path: P) -> Option<&Self> where
    P: Vectorable<K>, 

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

fn eq(&self, other: &Node<K, V>) -> bool

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

fn ne(&self, other: &Node<K, V>) -> bool

This method tests for !=.

impl<K: Debug, V: Debug> Debug for Node<K, V>

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

Formats the value using the given formatter.