Struct PromotionPlan 

pub struct PromotionPlan {
    pub leaf_bytes: Vec<u8>,
    pub new_root_bytes: Vec<u8>,
}

Layout for a promote-leaf-to-depth-1 operation: the new leaf block that holds the five entries (four old + the new one), and the rewritten inline root that indexes it.

Fields

leaf_bytes: Vec<u8>

Full-block bytes for the freshly-allocated leaf node. Header at the start, sorted leaf entries, zeros to end. If reserved_tail_csum was true the last 4 bytes are reserved for the caller to patch with checksum.patch_extent_tail.

new_root_bytes: Vec<u8>

60 bytes of the new inline root: depth=1, entries=1, single index entry whose logical_block = 0 and leaf_block = the physical block the caller allocated for leaf_bytes.

Trait Implementations

impl Clone for PromotionPlan

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PromotionPlan

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

Formats the value using the given formatter.

impl Eq for PromotionPlan

impl PartialEq for PromotionPlan

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for PromotionPlan