#[repr(C)]pub struct AVLTree<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> {
pub root: u64,
/* private fields */
}
Fields§
§root: u64
Implementations§
source§impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> AVLTree<K, V, MAX_SIZE>
impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> AVLTree<K, V, MAX_SIZE>
pub fn new() -> Self
pub fn initialize(&mut self)
pub fn get_node(&self, node: u32) -> &AVLNode<K, V>
pub fn get_node_mut(&mut self, node: u32) -> &mut AVLNode<K, V>
pub fn get_addr(&self, key: &K) -> u32
pub fn find_min_index(&self) -> u32
pub fn find_max_index(&self) -> u32
pub fn find_min(&self) -> Option<&V>
pub fn find_max(&self) -> Option<&V>
Trait Implementations§
source§impl<K: Clone + PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Clone + Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> Clone for AVLTree<K, V, MAX_SIZE>
impl<K: Clone + PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Clone + Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> Clone for AVLTree<K, V, MAX_SIZE>
source§impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> Default for AVLTree<K, V, MAX_SIZE>
impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> Default for AVLTree<K, V, MAX_SIZE>
source§impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> FromSlice for AVLTree<K, V, MAX_SIZE>
impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> FromSlice for AVLTree<K, V, MAX_SIZE>
fn new_from_slice(slice: &mut [u8]) -> &mut Self
source§impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> Index<&K> for AVLTree<K, V, MAX_SIZE>
impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> Index<&K> for AVLTree<K, V, MAX_SIZE>
source§impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> IndexMut<&K> for AVLTree<K, V, MAX_SIZE>
impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> IndexMut<&K> for AVLTree<K, V, MAX_SIZE>
source§impl<'a, K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> IntoIterator for &'a AVLTree<K, V, MAX_SIZE>
impl<'a, K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> IntoIterator for &'a AVLTree<K, V, MAX_SIZE>
source§impl<'a, K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> IntoIterator for &'a mut AVLTree<K, V, MAX_SIZE>
impl<'a, K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> IntoIterator for &'a mut AVLTree<K, V, MAX_SIZE>
source§impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> NodeAllocatorMap<K, V> for AVLTree<K, V, MAX_SIZE>
impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> NodeAllocatorMap<K, V> for AVLTree<K, V, MAX_SIZE>
fn insert(&mut self, key: K, value: V) -> Option<u32>
fn remove(&mut self, key: &K) -> Option<V>
fn contains(&self, key: &K) -> bool
fn get(&self, key: &K) -> Option<&V>
fn get_mut(&mut self, key: &K) -> Option<&mut V>
fn len(&self) -> usize
fn capacity(&self) -> usize
fn iter(&self) -> Box<dyn DoubleEndedIterator<Item = (&K, &V)> + '_>
fn iter_mut(&mut self) -> Box<dyn DoubleEndedIterator<Item = (&K, &mut V)> + '_>
fn is_empty(&self) -> bool
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>
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: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> ZeroCopy for AVLTree<K, V, MAX_SIZE>
impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> ZeroCopy for AVLTree<K, V, MAX_SIZE>
source§impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> Zeroable for AVLTree<K, V, MAX_SIZE>
impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> Zeroable for AVLTree<K, V, MAX_SIZE>
impl<K: Copy + PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Copy + Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> Copy for AVLTree<K, V, MAX_SIZE>
impl<K: PartialOrd + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> Pod for AVLTree<K, V, MAX_SIZE>
Auto Trait Implementations§
impl<K, V, const MAX_SIZE: usize> RefUnwindSafe for AVLTree<K, V, MAX_SIZE>where K: RefUnwindSafe, V: RefUnwindSafe,
impl<K, V, const MAX_SIZE: usize> Send for AVLTree<K, V, MAX_SIZE>where K: Send, V: Send,
impl<K, V, const MAX_SIZE: usize> Sync for AVLTree<K, V, MAX_SIZE>where K: Sync, V: Sync,
impl<K, V, const MAX_SIZE: usize> Unpin for AVLTree<K, V, MAX_SIZE>where K: Unpin, V: Unpin,
impl<K, V, const MAX_SIZE: usize> UnwindSafe for AVLTree<K, V, MAX_SIZE>where K: UnwindSafe, V: UnwindSafe,
Blanket Implementations§
source§impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
impl<T> CheckedBitPattern for Twhere T: AnyBitPattern,
§type Bits = T
type Bits = T
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.source§fn is_valid_bit_pattern(_bits: &T) -> bool
fn is_valid_bit_pattern(_bits: &T) -> bool
If this function returns true, then it must be valid to reinterpret
bits
as &Self
.