pub struct NullRun {
pub left: u64,
pub height: u32,
}Expand description
One null collapse run of a single algorithm: the algorithm projects to the
null constant across the aligned k-ary block [left, left + k^height).
This is the null subset of the general collapse run-extents — the only per-algorithm-divergent collapse, hence the minimal committed activation information. Non-null equal-value runs are mirrored across every algorithm’s tree and recovered from the shared data, so they are never tracked here.
Fields§
§left: u64First leaf index of the null block.
height: u32Height of the aligned k-ary null block; it spans arity^height leaves.
height == 0 is a single inactive leaf.
Trait Implementations§
impl Copy for NullRun
impl Eq for NullRun
impl StructuralPartialEq for NullRun
Auto Trait Implementations§
impl Freeze for NullRun
impl RefUnwindSafe for NullRun
impl Send for NullRun
impl Sync for NullRun
impl Unpin for NullRun
impl UnsafeUnpin for NullRun
impl UnwindSafe for NullRun
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