pub enum Staleness {
Linearized,
BestEffort {
max_lag: Duration,
},
}Expand description
How stale an evaluator’s view of the world may be before it is unhealthy.
Variants§
Linearized
Blocks rather than answer from a stale view. Its lag bound is its latency bound, and it is a throughput ceiling — the right choice for a deterministic, in-process evaluator whose answer is exact and cheap.
BestEffort
Answers from what it has seen. Exceeding max_lag is a health
failure, routed the same way a crashed evaluator is: the writes the
tree scopes to it are refused until it catches up.
Trait Implementations§
impl Copy for Staleness
impl Eq for Staleness
impl StructuralPartialEq for Staleness
Auto Trait Implementations§
impl Freeze for Staleness
impl RefUnwindSafe for Staleness
impl Send for Staleness
impl Sync for Staleness
impl Unpin for Staleness
impl UnsafeUnpin for Staleness
impl UnwindSafe for Staleness
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.