Struct 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>>

Implementations

impl<K, V> Node<K, V>

where K: Copy + PartialEq + PartialOrd, V: Clone,

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

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

where F: Fn(&usize, &K, &Vec<K>) -> usize,

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

where F: Fn(&usize, &K, &Vec<K>) -> usize,

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: Clone, V: Clone> Clone for Node<K, V>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

fn eq(&self, other: &Node<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, V, P: Vectorable<K>> Radix<K, V, P> for Node<K, V>

where K: Copy + PartialEq + PartialOrd, V: Clone,

fn remove(&mut self, path: P)

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

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

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

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

impl<K, V> StructuralPartialEq for Node<K, V>