Struct indextreemap::stc::Node

pub struct Node<K, V> {
    pub items: [Option<Box<Item<K, V>>>; 6],
    pub children: [Option<Box<Node<K, V>>>; 2],
    pub children_size: [usize; 2],
    pub child_difference: u8,
    pub height: u8,
}

Fields

items: [Option<Box<Item<K, V>>>; 6]

children: [Option<Box<Node<K, V>>>; 2]

children_size: [usize; 2]

child_difference: u8

height: u8

Implementations

impl<K: Key, V: Value> Node<K, V>

The balancing funcitons of the tree

pub fn is_balanced(&mut self) -> bool

pub fn balance(&mut self)

pub fn diff_balance(&mut self)

pub fn has_full_child(&self, index: (usize, usize)) -> (bool, bool)

pub fn single_rotation(&mut self, side: Side)

pub fn child_to_parent(&mut self, index: (usize, usize))

pub fn subchild_to_parent(&mut self, index: (usize, usize))

pub fn update_child_difference(&mut self)

pub fn height_balance(&mut self)

pub fn is_height_balanced(&mut self) -> bool

pub fn update_height(&mut self)

pub fn update_height_difference(&mut self) -> (u8, Ordering)

pub fn double_rotation(&mut self, side: Side)

impl<K: Key, V: Value> Node<K, V>

pub fn get_item(&self, key: &K) -> Option<&Item<K, V>>

pub fn get_item_from_index(&self, id: usize) -> Option<&Item<K, V>>

impl<K: Key, V: Value> Node<K, V>

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

pub fn insert_with_overflow( &mut self, index: usize, key: K, value: Option<V> ) -> bool

pub fn insert_item(&mut self, index: usize, key: K, value: Option<V>)

impl<K: Key, V: Value> Node<K, V>

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

pub fn remove_index(&mut self, id: usize) -> Option<Item<K, V>>

pub fn replace_item(&mut self)

pub fn take_largest_item(&mut self) -> Option<Box<Item<K, V>>>

pub fn take_smallest_item(&mut self) -> Option<Box<Item<K, V>>>

pub fn is_empty(&self) -> bool

pub fn bias_right(&mut self)

pub fn bias_left(&mut self)

impl<K: Key, V: Value> Node<K, V>

pub fn take_items(&mut self) -> [Option<Box<Item<K, V>>>; 6]

pub fn take_child(&mut self, index: usize) -> Option<Box<Node<K, V>>>

pub fn take_child_size(&mut self, index: usize) -> usize

impl<K: Key, V: Value> Node<K, V>

pub fn new() -> Box<Node<K, V>>

pub fn is_full(&self) -> bool

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

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

Returns the “default value” for a type.