Struct bitmap_allocator::BitAllocCascade16

pub struct BitAllocCascade16<T: BitAlloc> { /* private fields */ }

Implement the bit allocator by segment tree algorithm.

Trait Implementations

impl<T: BitAlloc> BitAlloc for BitAllocCascade16<T>

const CAP: usize = _

The bitmap has a total of CAP bits, numbered from 0 to CAP-1 inclusively.

const DEFAULT: Self = _

The default value. Workaround for const fn new() -> Self.

fn alloc(&mut self) -> Option<usize>

Allocate a free bit.

fn alloc_contiguous(&mut self, size: usize, align_log2: usize) -> Option<usize>

Allocate a free block with a given size, and return the first bit position.

fn dealloc(&mut self, key: usize)

Free an allocated bit.

fn insert(&mut self, range: Range<usize>)

Mark bits in the range as unallocated (available)

fn remove(&mut self, range: Range<usize>)

Reverse of insert

fn any(&self) -> bool

👎Deprecated: use !self.is_empty() instead

Whether there are free bits remaining

fn is_empty(&self) -> bool

Returns true if no bits is available.

fn test(&self, key: usize) -> bool

Whether a specific bit is free

fn next(&self, key: usize) -> Option<usize>

Find a index not less than a given key, where the bit is free.

impl<T: Default + BitAlloc> Default for BitAllocCascade16<T>

fn default() -> BitAllocCascade16<T>

Returns the “default value” for a type.