Struct HiSlab 

pub struct HiSlab<T: 'static> { /* private fields */ }

A slab allocator with O(1) insert and remove using hierarchical bitmaps.

HiSlab stores elements in a contiguous Vec and tracks free slots using a 4-level bitmap hierarchy. This allows finding a free slot in constant time regardless of fragmentation.

For tagging support, see TaggedHiSlab.

Implementations

impl<T> HiSlab<T>

pub fn new(initial_capacity: u32, virtual_capacity: u32) -> Result<Self, Error>

Creates a new empty HiSlab.

virtual_capacity * size_of::<T>() octets sont réservés immédiatement en espace virtuel. Les pages couvrant initial_capacity slots sont pré-faultées via madvise(MADV_POPULATE_WRITE). Les pages au-delà sont committées à la demande.

Panics

• Si initial_capacity > virtual_capacity
• Si virtual_capacity * size_of::<T>() dépasse usize::MAX

Errors

Retourne une erreur si mmap échoue (OOM système).

impl<T> HiSlab<T>

pub fn insert(&mut self, val: T) -> u32

Inserts a value and returns its index.

The returned index is stable and can be used to access the value until it is removed.

pub fn remove(&mut self, idx: u32) -> Option<T>

Removes the element at the given index and returns it, or None if the slot is empty.

The slot becomes available for future insertions.

pub fn is_occupied(&self, idx: u32) -> bool

Returns true if the slot at the given index is occupied.

pub fn get(&self, idx: u32) -> Option<&T>

Returns a reference to the element at the given index, or None if empty.

pub fn get_mut(&mut self, idx: u32) -> Option<&mut T>

Returns a mutable reference to the element at the given index, or None if empty.

impl<T> HiSlab<T>

pub unsafe fn get_unchecked(&self, idx: u32) -> &T

Returns a reference without checking if the slot is occupied.

Safety

The caller must ensure the index is valid and occupied.

pub unsafe fn get_unchecked_mut(&mut self, idx: u32) -> &mut T

Returns a mutable reference without checking if the slot is occupied.

Safety

The caller must ensure the index is valid and occupied.

impl<T> HiSlab<T>

pub fn for_each_occupied<F>(&self, f: F)

where F: FnMut(u32, &T),

Iterates over all occupied slots with maximum performance.

This is faster than using the iterator for simple operations as it avoids iterator overhead.

Trait Implementations

impl<T> Drop for HiSlab<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T> Index<u32> for HiSlab<T>

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<T> IndexMut<u32> for HiSlab<T>

fn index_mut(&mut self, idx: u32) -> &mut Self::Output

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

impl<'a, T> IntoIterator for &'a HiSlab<T>

type Item = (u32, &'a T)

The type of the elements being iterated over.

type IntoIter = SlabIter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a mut HiSlab<T>

type Item = (u32, &'a mut T)

The type of the elements being iterated over.

type IntoIter = SlabIterMut<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for HiSlab<T>

type Item = (u32, T)

The type of the elements being iterated over.

type IntoIter = SlabIntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.