Struct Latest 

pub struct Latest<T>(/* private fields */);

Keeps only the newest item: each item the source pushes replaces the one waiting to be polled. This is onBackpressureLatest of other ReactiveX stacks.

The memory cost is one item whatever the pace of the source, at the price of skipping the items the consumer was too slow to see — right for a stream of states, where only the current one matters, and wrong for a stream of events.

Implementations

impl<T> Latest<T>

pub fn new() -> Self

Trait Implementations

impl<T> Debug for Latest<T>

where Option<T>: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> Default for Latest<T>

where Option<T>: Default,

fn default() -> Self

Returns the “default value” for a type.

impl<T> StreamBuffer<T> for Latest<T>

type Item = T

What the stream yields.

fn push(&mut self, item: T) -> Option<T>

Stores an item the source pushed.

fn pop(&mut self) -> Option<T>

Takes the next item to yield, or None when the stream has to wait for the source.