Struct RangeSplit 

pub struct RangeSplit { /* private fields */ }

The two entries a split_range produces: the child the owner keeps and the child the move will hand off.

Applying a split is order-sensitive — the retained child must be narrowed first, then the moved child created — or the create would transiently overlap the still-full original and the catalog would reject it. apply does this in the right order.

Implementations

impl RangeSplit

pub fn retained(&self) -> &RangeOwnership

The child the owner keeps writing — the original range id, narrowed to the non-moved keys, version advanced but epoch unchanged (no authority moved).

pub fn moved(&self) -> &RangeOwnership

The carved-off child the move hands off — a fresh range id, still owned by the original owner (which keeps serving its keys until cutover) with the move target enlisted as a replica.

pub fn apply( &self, catalog: &mut ShardOwnershipCatalog, ) -> Result<(), CatalogError>

Install the split into the catalog: narrow the retained child first, then create the moved child. After this the two children tile the original keyspace and the move can proceed on moved’s range id.

Trait Implementations

impl Clone for RangeSplit

fn clone(&self) -> RangeSplit

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RangeSplit

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

Formats the value using the given formatter.

impl Eq for RangeSplit

impl PartialEq for RangeSplit

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for RangeSplit