pub trait OrderedNodeAllocatorMap<K, V>: NodeAllocatorMap<K, V> {
    // Required methods
    fn get_min_index(&mut self) -> u32;
    fn get_max_index(&mut self) -> u32;
    fn get_min(&mut self) -> Option<(K, V)>;
    fn get_max(&mut self) -> Option<(K, V)>;
}
Expand description

This trait adds additional functions for sorted map data structures that use the NodeAllocator

Required Methods§

source

fn get_min_index(&mut self) -> u32

source

fn get_max_index(&mut self) -> u32

source

fn get_min(&mut self) -> Option<(K, V)>

source

fn get_max(&mut self) -> Option<(K, V)>

Implementors§

source§

impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> OrderedNodeAllocatorMap<K, V> for AVLTree<K, V, MAX_SIZE>

source§

impl<K: Debug + PartialOrd + Ord + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> OrderedNodeAllocatorMap<K, V> for RedBlackTree<K, V, MAX_SIZE>

source§

impl<V: Default + Copy + Clone + Pod + Zeroable, const NUM_NODES: usize, const MAX_SIZE: usize> OrderedNodeAllocatorMap<u128, V> for Critbit<V, NUM_NODES, MAX_SIZE>