pub enum Backpressure {
Unbounded,
Block {
max_pending: usize,
},
KeepLatest {
max_pending: usize,
},
}Expand description
Queue policy between a producer and a spawned node (ReconNode::spawn).
Variants§
Unbounded
Never drop; the queue grows without bound.
Block
send blocks while max_pending states are queued (try_send returns SendError::Full).
KeepLatest
Keep the newest states: when max_pending are queued, the oldest queued ready set is dropped (it then shows up
as a sequence gap). Capture never waits for reconstruction.
Trait Implementations§
Source§impl Clone for Backpressure
impl Clone for Backpressure
impl Copy for Backpressure
Source§impl Debug for Backpressure
impl Debug for Backpressure
Source§impl Default for Backpressure
impl Default for Backpressure
impl Eq for Backpressure
Source§impl PartialEq for Backpressure
impl PartialEq for Backpressure
impl StructuralPartialEq for Backpressure
Auto Trait Implementations§
impl Freeze for Backpressure
impl RefUnwindSafe for Backpressure
impl Send for Backpressure
impl Sync for Backpressure
impl Unpin for Backpressure
impl UnsafeUnpin for Backpressure
impl UnwindSafe for Backpressure
Blanket Implementations§
impl<T> Boilerplate for T
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.