Struct ShardedResourcePool 

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

A sharded, binned resource pool designed for high-concurrency reuse of transient allocations.

Resources are partitioned by thread affinity across 4 shards to minimize lock contention, and internally binned into 64 power-of-two size classes. Pop operations use a non-blocking stealing fallback across shards.

Implementations

impl<T: SizeBounded> ShardedResourcePool<T>

pub fn new(max_buffers: usize, max_bytes: u64) -> Self

Construct a new pool with the given capacity limits.

pub fn take_at_least(&self, size: u64) -> Option<T>

Retrieve a resource of size >= size from the pool, or return None.

pub fn recycle(&self, item: T)

Recycle a resource back into the pool.

pub fn clear(&self)

Clear all pooled resources.

All bin guards remain held until the bins are drained and the counters are reset. This makes the reset a linearization point: a concurrent recycle or take_at_least either completes before the reset or starts after it, and cannot publish a resource behind zero counters.

Trait Implementations

impl<T> Debug for ShardedResourcePool<T>

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

Formats the value using the given formatter.