Struct PoolNode 

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

A pool of exchangeable items

Implementations

impl<T> PoolNode<T>

pub fn new() -> Self

Create a new PoolNode

pub fn get_any(&self) -> Option<(i32, T)>

Get any item from the pool

pub fn insert(&self, id: i32, conn: T)

Insert an item with the given unique ID into the pool

pub fn is_empty(&self) -> bool

Returns true if the pool node contains no connections in either the hot queue or the overflow hash map.

Concurrency note

This check is not atomic across the two internal stores (hot_queue and connections). Between checking one and the other, a concurrent insert or get_any could change the state. This is acceptable because callers use is_empty only as a hint to attempt cleanup, and always re-verify under an exclusive (write) lock before actually removing the node from the parent pool HashMap. A false-negative simply defers cleanup to the next opportunity; a false-positive is largely mitigated by the re-check (see ConnectionPool::try_remove_empty_node for residual race-window analysis).

pub fn remove(&self, id: i32) -> Option<T>

Remove the item associated with the id from the pool. The item is returned if it is found and removed.