Struct sokoban::red_black_tree::RedBlackTree

#[repr(C)]
pub struct RedBlackTree<K: PartialOrd + Ord + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> {
    pub root: u32,
    /* private fields */
}

Fields

root: u32

Implementations

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

pub fn pretty_print(&self)

pub fn is_valid_red_black_tree(&self) -> bool

pub fn new() -> Self

pub fn initialize(&mut self)

pub fn get_node(&self, node: u32) -> &RBNode<K, V>

pub fn get_node_mut(&mut self, node: u32) -> &mut RBNode<K, V>

pub fn is_red(&self, node: u32) -> bool

pub fn is_black(&self, node: u32) -> bool

pub fn get_child(&self, node: u32, dir: u32) -> u32

pub fn is_leaf(&self, node: u32) -> bool

pub fn is_root(&self, node: u32) -> bool

pub fn get_dir(&self, node: u32, dir: u32) -> u32

pub fn get_left(&self, node: u32) -> u32

pub fn get_right(&self, node: u32) -> u32

pub fn get_color(&self, node: u32) -> u32

pub fn get_parent(&self, node: u32) -> u32

pub fn get_addr(&self, key: &K) -> u32

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

fn default() -> Self

Returns the “default value” for a type.

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

fn new_from_slice(slice: &mut [u8]) -> &mut Self

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

type Output = V

The returned type after indexing.

fn index(&self, index: &K) -> &Self::Output

Performs the indexing (container[index]) operation.

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

fn index_mut(&mut self, index: &K) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

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

type Item = (&'a K, &'a V)

The type of the elements being iterated over.

type IntoIter = RedBlackTreeIterator<'a, K, V, MAX_SIZE>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, K: Debug + PartialOrd + Ord + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> IntoIterator for &'a mut RedBlackTree<K, V, MAX_SIZE>

type Item = (&'a K, &'a mut V)

The type of the elements being iterated over.

type IntoIter = RedBlackTreeIteratorMut<'a, K, V, MAX_SIZE>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K: Debug + PartialOrd + Ord + Copy + Clone + Default + Pod + Zeroable, V: Default + Copy + Clone + Pod + Zeroable, const MAX_SIZE: usize> NodeAllocatorMap<K, V> for RedBlackTree<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 size(&self) -> usize

👎Deprecated

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

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>

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

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

fn load_mut_bytes(data: &mut [u8]) -> Option<&mut Self>

fn load_bytes(data: &[u8]) -> Option<&Self>

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

fn zeroed() -> Self

Calls zeroed.

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

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