Struct LeafSplit 

pub struct LeafSplit {
    pub left_bytes: Vec<u8>,
    pub right_bytes: Vec<u8>,
    pub split_out_hash: u32,
}

Result of a leaf-split planning call. The caller still needs to:

1. Allocate a new logical block for new_leaf (extent + inode size).
2. Apply both WriteDirBlock mutations.
3. Call plan_insert_dx_entry_root / _node on the parent with split_out_hash and the new leaf’s logical block number.

Fields

left_bytes: Vec<u8>

Updated bytes of the original (left) leaf block. Contains entries with hash < split_out_hash.

right_bytes: Vec<u8>

Bytes of the new (right) leaf block. Contains entries with hash >= split_out_hash. Caller writes to the freshly-allocated block.

split_out_hash: u32

Hash bound for the new right-leaf — this is the dx_entry.hash the caller must install in the parent when routing the new leaf into the tree.

Trait Implementations

impl Clone for LeafSplit

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 LeafSplit

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

Formats the value using the given formatter.

impl Eq for LeafSplit

impl PartialEq for LeafSplit

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for LeafSplit