Struct KeyedQueues 

pub struct KeyedQueues<K, V> { /* private fields */ }

HashMap<K, Arc<ConcurrentQueue<V>>> behind a single RwLock.

• Writers only contend when creating a new key.
• push is almost always non-blocking (unbounded queue).

Implementations

impl<K, V> KeyedQueues<K, V>

where K: Eq + Hash + Clone, V: Send + 'static,

pub const fn new() -> Self

pub fn get_or_create(&self, key: &K) -> Arc<ConcurrentQueue<V>>

pub fn try_send(&self, key: &K, val: V) -> Result<(), PushError<V>>

Potentially-blocking send but almost never blocking (unbounded queue => push never fails). ( Only blocks when the K has never been used before )

pub fn inner(&self) -> &RwLock<HashMap<K, Arc<ConcurrentQueue<V>>>>

Trait Implementations

impl<K: Default, V: Default> Default for KeyedQueues<K, V>

fn default() -> KeyedQueues<K, V>

Returns the “default value” for a type.