#[repr(u8)]pub enum Tier {
Start = 0,
Control = 1,
Notification = 2,
Value = 3,
Settle = 4,
Terminal = 5,
Teardown = 6,
}Expand description
The 7-tier const table (D34, amends R-tier numbering).
Ordering encodes priority + batch timing: immediate (< Value) flows
during the current wave; batch-deferred (>= Value) is held to the batch
commit / wave boundary. PAUSE/RESUME sit below DIRTY (control before
notification); PULL joins that existing control/demand tier (D269). START
is the handshake type.
Variants§
Start = 0
0 — subscribe handshake (START).
Control = 1
1 — control/demand (PAUSE / RESUME / PULL).
Notification = 2
2 — notification (DIRTY).
Value = 3
3 — value (DATA / RESOLVED).
Settle = 4
4 — settle (INVALIDATE).
Terminal = 5
5 — terminal (COMPLETE / ERROR).
Teardown = 6
6 — teardown (TEARDOWN).
Implementations§
Source§impl Tier
impl Tier
Sourcepub fn is_immediate(self) -> bool
pub fn is_immediate(self) -> bool
Immediate tiers (< Value) propagate during the current wave (D34).
Sourcepub fn is_batch_deferred(self) -> bool
pub fn is_batch_deferred(self) -> bool
Batch-deferred tiers (>= Value) are held to the wave/batch boundary (D34).
Sourcepub fn is_pause_buffered(self) -> bool
pub fn is_pause_buffered(self) -> bool
Pause buffering holds the settle slice: value-tier DATA/RESOLVED plus INVALIDATE.
Trait Implementations§
Source§impl Ord for Tier
impl Ord for Tier
Source§impl PartialOrd for Tier
impl PartialOrd for Tier
impl Copy for Tier
impl Eq for Tier
impl StructuralPartialEq for Tier
Auto Trait Implementations§
impl Freeze for Tier
impl RefUnwindSafe for Tier
impl Send for Tier
impl Sync for Tier
impl Unpin for Tier
impl UnsafeUnpin for Tier
impl UnwindSafe for Tier
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§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
§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
key and return true if they are equal.