Struct RangeBounds 

pub struct RangeBounds { /* private fields */ }

The half-open [lower, upper) partition a range owns.

Half-open bounds tile the keyspace without gaps or double-cover: adjacent ranges share a boundary key that belongs to exactly one of them. lower must be strictly below upper, so an empty or inverted range cannot be constructed.

Implementations

impl RangeBounds

pub fn new( lower: RangeBound, upper: RangeBound, ) -> Result<RangeBounds, RangeBoundsError>

Bounds from an explicit [lower, upper) pair. Errors if the range would be empty or inverted (lower >= upper).

pub fn full() -> RangeBounds

The whole keyspace, [Min, Max) — a single range covering a collection.

pub fn lower(&self) -> &RangeBound

pub fn upper(&self) -> &RangeBound

pub fn contains(&self, key: &[u8]) -> bool

Does key fall inside this half-open range? Lower bound inclusive, upper bound exclusive — the routing predicate.

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

Do these two ranges share any key? Used to keep a collection’s ranges non-overlapping so routing resolves to exactly one owner.

Trait Implementations

impl Clone for RangeBounds

fn clone(&self) -> RangeBounds

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RangeBounds

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

Formats the value using the given formatter.

impl Eq for RangeBounds

impl PartialEq for RangeBounds

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