Struct BufferPool 

pub struct BufferPool { /* private fields */ }

A lock-free pool of pre-allocated receive buffers.

BufferPool avoids heap allocation in the hot path by recycling bytes::BytesMut buffers via a bounded, lock-free queue.

When the pool is exhausted, BufferPool::get falls back to allocating a new zeroed buffer — the pool never blocks.

Example

use binger_udp::BufferPool;

let pool = BufferPool::new(16, 2048);
let mut buf = pool.get();
buf.extend_from_slice(b"hello");
pool.put(buf);
assert_eq!(pool.available(), 1);

Implementations

impl BufferPool

pub fn new(capacity: usize, buf_size: usize) -> Self

Creates a new buffer pool with capacity buffers, each of buf_size bytes.

Buffers are lazily allocated — the constructor itself does not allocate.

pub fn get(&self) -> BytesMut

Retrieves a buffer from the pool, or allocates a new zeroed one if the pool is empty.

Returned buffers are cleared before being handed out.

pub fn put(&self, buf: BytesMut)

Returns a buffer to the pool for reuse.

If the pool is full the buffer is silently dropped (the pool never grows).

pub fn available(&self) -> usize

Number of buffers currently available in the pool.

pub fn capacity(&self) -> usize

Maximum number of buffers the pool can hold.

Trait Implementations

impl Clone for BufferPool

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.