pub struct WaitMap<K, V, S = RandomState> { /* private fields */ }Implementations§
Source§impl<K: Hash + Eq, V, S: BuildHasher + Clone> WaitMap<K, V, S>
impl<K: Hash + Eq, V, S: BuildHasher + Clone> WaitMap<K, V, S>
pub fn with_hasher(hasher: S) -> WaitMap<K, V, S>
pub fn insert(&self, key: K, value: V) -> Option<V>
pub fn get<Q: ?Sized + Hash + Eq>(&self, key: &Q) -> Option<Ref<'_, K, V, S>>where
K: Borrow<Q>,
pub fn get_mut<Q: ?Sized + Hash + Eq>(
&self,
key: &Q,
) -> Option<RefMut<'_, K, V, S>>where
K: Borrow<Q>,
pub fn wait<'a: 'f, 'b: 'f, 'f, Q: ?Sized + Hash + Eq>( &'a self, qey: &'b Q, ) -> impl Future<Output = Option<Ref<'a, K, V, S>>> + 'f
pub fn wait_mut<'a: 'f, 'b: 'f, 'f, Q: ?Sized + Hash + Eq>( &'a self, qey: &'b Q, ) -> impl Future<Output = Option<RefMut<'a, K, V, S>>> + 'f
pub fn cancel<Q: ?Sized + Hash + Eq>(&self, key: &Q) -> boolwhere
K: Borrow<Q>,
pub fn cancel_all(&self)
Auto Trait Implementations§
impl<K, V, S> Freeze for WaitMap<K, V, S>where
S: Freeze,
impl<K, V, S = RandomState> !RefUnwindSafe for WaitMap<K, V, S>
impl<K, V, S> Send for WaitMap<K, V, S>
impl<K, V, S> Sync for WaitMap<K, V, S>
impl<K, V, S> Unpin for WaitMap<K, V, S>where
S: Unpin,
impl<K, V, S> UnwindSafe for WaitMap<K, V, S>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more