Struct RleBitmapBase 

pub struct RleBitmapBase<T> { /* private fields */ }

A run-length encoded bitmap.

Implementations

impl<T> RleBitmapBase<T>

pub fn project<'__pin>( self: Pin<&'__pin mut Self>, ) -> RleBitmapBaseProjection<'__pin, T>

Pin-projects all fields of Self.

These fields are structurally pinned:

• elems

These fields are not structurally pinned:

• num_elems
• num_bits

impl<T> RleBitmapBase<T>

pub fn iter(&self) -> Iterator<'_, ElementPtr<T>>

Returns an iterator over the elements of this bitmap.

impl<T> RleBitmapBase<T>

where T: Copy + Eq + Ord + Default + Add<Output = T> + Sub<Output = T> + From<u8>,

pub fn new() -> impl PinInit<Self, Infallible>

Create a new, empty run-length encoded bitmap.

Since the underlying intrusive list must be pinned in memory, this returns an initializer that must be pinned (e.g. using pin_init::pin_init!).

pub fn num_ranges(&self) -> usize

Returns the current number of ranges (runs of set bits) in the bitmap.

pub fn num_bits(&self) -> T

Returns the current total number of set bits in the bitmap.

pub fn set_no_alloc( &mut self, bitoff: T, bitmax: T, free_list: &mut FreeList<T>, ) -> Result<(), Status>

Sets all bits in the range [bitoff, bitmax).

Only fails if bitmax < bitoff or if an allocation is needed and free_list does not contain one.

free_list is a list of usable allocations. If an allocation is needed, it will be drawn from it. This function is guaranteed to need at most one allocation. If any nodes need to be deleted, they will be appended to free_list.

pub fn clear_no_alloc( &mut self, bitoff: T, bitmax: T, free_list: &mut FreeList<T>, ) -> Result<(), Status>

Clears all bits in the range [bitoff, bitmax).

Only fails if bitmax < bitoff or if an allocation is needed and free_list does not contain one.

free_list is a list of usable allocations. If an allocation is needed, it will be drawn from it. This function is guaranteed to need at most one allocation. If any nodes need to be deleted, they will be appended to free_list.

Trait Implementations

impl<T> Bitmap<T> for RleBitmapBase<T>

where T: Copy + Eq + Ord + Default + Add<Output = T> + Sub<Output = T> + From<u8>,

fn find( &self, is_set: bool, bitoff: T, bitmax: T, run_len: T, ) -> Result<T, Status>

Finds a run of run_len is_set bits, between bitoff and bitmax.

fn get(&self, bitoff: T, bitmax: T) -> GetResult<T>

Returns true if all the bits in [bitoff, bitmax) are set.

fn set(&mut self, bitoff: T, bitmax: T) -> Result<(), Status>

Sets all bits in the range [bitoff, bitmax).

fn clear(&mut self, bitoff: T, bitmax: T) -> Result<(), Status>

Clears all bits in the range [bitoff, bitmax).

fn clear_all(&mut self)

Clear all bits in the bitmap.

fn get_one(&self, bitoff: T) -> bool

Returns true if the bit at bitoff is set.

fn set_one(&mut self, bitoff: T) -> Result<(), Status>

Sets the bit at bitoff.

fn clear_one(&mut self, bitoff: T) -> Result<(), Status>

Clears the bit at bitoff.

impl<T: Debug> Debug for RleBitmapBase<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> HasPinData for RleBitmapBase<T>

type PinData = __ThePinData<T>

unsafe fn __pin_data() -> Self::PinData

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

type Item = &'a Element<T>

The type of the elements being iterated over.

type IntoIter = Iterator<'a, UniquePtr<Element<T>>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.