Struct TimeoutFutureMap 

pub struct TimeoutFutureMap<K, F> { /* private fields */ }

Implementations

impl<K, F> TimeoutFutureMap<K, F>

where K: Clone + PartialEq + Send + Unpin + 'static, F: Future + Send + Unpin + 'static,

pub fn new(duration: Duration) -> Self

Create an empty TimeoutFutureMap

pub fn insert(&mut self, key: K, future: F) -> bool

Insert a future into the map with a unique key. The function will return true if the map does not have the key present, otherwise it will return false

Methods from Deref<Target = FutureMap<K, Timed<F>>>

pub fn insert(&mut self, key: K, fut: T) -> bool

Insert a future into the map with a unique key. The function will return true if the map does not have the key present, otherwise it will return false

pub fn set_wake_on_success(&mut self, key: &K, wake_on_success: bool) -> bool

Mark future with assigned key to wake up on successful yield. Will return false if future does not exist or if value is the same as previously set.

pub fn iter(&self) -> impl Iterator<Item = (&K, &T)>

An iterator visiting all key-value pairs in arbitrary order.

pub fn iter_mut(&mut self) -> impl Iterator<Item = (&K, &mut T)>

An iterator visiting all key-value pairs mutably in arbitrary order.

pub fn iter_pin(&mut self) -> impl Iterator<Item = (&K, Pin<&mut T>)>

An iterator visiting all key-value pairs with a pinned valued in arbitrary order

pub fn keys(&self) -> impl Iterator<Item = &K>

Returns an iterator visiting all keys in arbitrary order.

pub fn values(&self) -> impl Iterator<Item = &T>

An iterator visiting all values in arbitrary order.

pub fn values_mut(&mut self) -> impl Iterator<Item = &mut T>

An iterator visiting all values mutably in arbitrary order.

pub fn contains_key(&self, key: &K) -> bool

Returns true if the map contains a future for the specified key.

pub fn clear(&mut self)

Clears the map.

pub fn get(&self, key: &K) -> Option<&T>

Returns a reference to the future corresponding to the key.

pub fn get_mut(&mut self, key: &K) -> Option<&mut T>

Returns a mutable future to the value corresponding to the key.

pub fn get_mut_or_default(&mut self, key: &K) -> &mut T

where T: Default,

Returns a muable future or default value if it does not exist.

pub fn get_pinned(&mut self, key: &K) -> Option<Pin<&mut T>>

Returns a pinned future corresponding to the key.

pub fn remove(&mut self, key: &K) -> Option<T>

Removes a key from the map, returning the future.

pub fn len(&self) -> usize

Returns the number of futures in the map.

pub fn is_empty(&self) -> bool

Return true map contains no elements.

Trait Implementations

impl<K, F> Deref for TimeoutFutureMap<K, F>

type Target = FutureMap<K, Timed<F>>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<K, F> DerefMut for TimeoutFutureMap<K, F>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<K, F> FusedStream for TimeoutFutureMap<K, F>

where K: Clone + PartialEq + Send + Unpin + 'static, F: Future + Send + Unpin + 'static,

fn is_terminated(&self) -> bool

Returns true if the stream should no longer be polled.

impl<K, F> Stream for TimeoutFutureMap<K, F>

where K: Clone + PartialEq + Send + Unpin + 'static, F: Future + Send + Unpin + 'static,

type Item = (K, Result<<F as Future>::Output, Error>)

Values yielded by the stream.

fn poll_next( self: Pin<&mut Self>, cx: &mut Context<'_>, ) -> Poll<Option<Self::Item>>

Attempt to pull out the next value of this stream, registering the current task for wakeup if the value is not yet available, and returning None if the stream is exhausted.

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the stream.