Struct KeyRange 

pub struct KeyRange {
    pub start: Key,
    pub end: Key,
}

Key range for a shard

Fields

start: Key

Start key (inclusive)

end: Key

End key (exclusive)

Implementations

impl KeyRange

pub fn new(start: Key, end: Key) -> RaftResult<Self>

Create a new key range

pub fn contains(&self, key: &Key) -> bool

Check if a key is within this range

pub fn overlaps(&self, other: &KeyRange) -> bool

Check if this range overlaps with another range

pub fn midpoint(&self) -> Key

Calculate the midpoint key for splitting.

Returns a key M such that self.start <= M < self.end.

Both keys are padded to the same length with trailing zero bytes and treated as big-endian integers, so keys of different lengths are handled correctly (e.g. midpoint(“y”, “yyyyyy”) yields [0x79, 0x3C, …], not “z”).

pub fn full() -> Self

Create a range that covers all possible keys

Trait Implementations

impl Clone for KeyRange

fn clone(&self) -> KeyRange

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for KeyRange

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

Formats the value using the given formatter.

impl Eq for KeyRange

impl PartialEq for KeyRange

fn eq(&self, other: &KeyRange) -> 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 KeyRange