Struct LockFreePool 

#[repr(align(64))]
pub struct LockFreePool<T> { /* private fields */ }

Lock-free memory pool implementation using Michael & Scott algorithm.

Implementations

impl<T> LockFreePool<T>

pub fn new() -> Self

Create a new lock-free pool.

pub fn allocate(&self) -> Option<T>

Allocate an object from the pool (lock-free).

pub fn deallocate(&self, item: T) -> Result<(), T>

Return an object to the pool (lock-free).

pub fn available(&self) -> usize

Get number of available items in pool.

pub fn total_allocations(&self) -> u64

Get total number of allocations.

pub fn total_deallocations(&self) -> u64

Get total number of deallocations.

pub fn contention_events(&self) -> u64

Get contention events count.