Struct JavaBlockPosSet 

pub(crate) struct JavaBlockPosSet {
    buckets: Vec<Bucket>,
    entries: Vec<Entry>,
    trees: FxHashMap<u32, Links>,
    len: usize,
    equal_hash_order: EqualHashOrder,
}

Java bucket ordering with a deterministic policy for equal-hash tree entries.

Fields

buckets: Vec<Bucket>

entries: Vec<Entry>

trees: FxHashMap<u32, Links>

len: usize

equal_hash_order: EqualHashOrder

Implementations

impl JavaBlockPosSet

pub(super) fn remove_from_tree(&mut self, node: u32)

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

fn child(&self, node: u32, left: bool) -> u32

fn balance_deletion(&mut self, root: u32, node: u32)

impl JavaBlockPosSet

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

pub(super) fn links(&self, node: u32) -> &Links

pub(super) fn links_mut(&mut self, node: u32) -> &mut Links

fn reset_links(&mut self, node: u32)

pub(super) fn find_in_tree(&self, node: u32, hash: i32, pos: BlockPos) -> bool

fn goes_left(&self, node: u32, parent: u32) -> bool

fn attach(&mut self, root: u32, node: u32) -> u32

pub(super) fn split_tree(&mut self, index: usize, head: u32, bit: usize)

pub(super) fn treeify(&mut self, bucket: usize)

pub(super) fn insert_tree(&mut self, bucket: usize, node: u32)

fn move_root_to_front(&mut self, bucket: usize, root: u32)

pub(super) fn rotate(&mut self, root: u32, node: u32, left: bool) -> u32

fn balance_insertion(&mut self, root: u32, node: u32) -> u32

impl JavaBlockPosSet

pub(crate) fn new(equal_hash_order: EqualHashOrder) -> Self

pub(crate) fn insert(&mut self, pos: BlockPos) -> bool

pub(crate) fn contains(&self, pos: BlockPos) -> bool

pub(crate) const fn is_empty(&self) -> bool

pub(crate) fn java_order(&self) -> impl Iterator<Item = &BlockPos>

pub(crate) fn java_ordered_positions(&self) -> Vec<BlockPos>

pub(crate) fn pop_java_ordered_position(&mut self) -> Option<BlockPos>

fn append(&mut self, bucket_index: usize, entry_index: u32)

fn resize(&mut self)

Trait Implementations

impl Default for JavaBlockPosSet

fn default() -> Self

Returns the “default value” for a type.

impl IntoIterator for JavaBlockPosSet

type Item = BlockPos

The type of the elements being iterated over.

type IntoIter = IntoIter<BlockPos>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.