Skip to main content

StorageRangeConstraint

Struct StorageRangeConstraint 

Source
pub struct StorageRangeConstraint { /* private fields */ }
Expand description

Mandatory storage bounds and immutable fence for one physical range.

The primary-key interval is always represented as concrete half-open KV bounds. Even a full logical table uses the canonical table-prefix end, never scan_prefix.

Implementations§

Source§

impl StorageRangeConstraint

Source

pub fn new( range_id: impl Into<String>, generation: u64, row_key_range: RowKeyRange, snapshot: RangeReadSnapshot, ) -> Result<Self, StorageRangeConstraintError>

Constructs a validated, range-bound worker constraint.

Source

pub fn range_id(&self) -> &str

Returns the physical range identity selected by the route planner.

Source

pub const fn generation(&self) -> u64

Returns the immutable range-generation fence.

Source

pub const fn table_id(&self) -> u32

Returns the sole table whose rows may be emitted.

Source

pub const fn row_key_range(&self) -> RowKeyRange

Returns the canonical primary-key interval.

Source

pub fn encoded_bounds(&self) -> (&[u8], &[u8])

Returns concrete KV scan bounds [lower_inclusive, upper_exclusive).

Source

pub fn snapshot(&self) -> &RangeReadSnapshot

Returns the immutable catalog/schema/index snapshot fence.

Source

pub fn validate_table(&self, table_meta: &TableMetadata) -> Result<()>

Validates that a supplied SQL table matches the planned physical range.

Source

pub fn validate_read_at(&self, actual: Option<ReadAtPoint>) -> Result<()>

Validates that the storage transaction is pinned at this exact fence.

Source

pub fn contains_primary_key(&self, encoded_primary_key: &[u8]) -> Result<bool>

Rechecks a canonical primary key after a secondary-index lookup.

Source

pub fn recheck_secondary_index_hits<I>(&self, row_ids: I) -> Result<Vec<u64>>
where I: IntoIterator<Item = u64>,

Rechecks every secondary-index candidate against the primary-key range.

Index sort order is not a substitute for physical row bounds. A candidate outside the range is omitted before its row can be fetched or emitted.

Trait Implementations§

Source§

impl Clone for StorageRangeConstraint

Source§

fn clone(&self) -> StorageRangeConstraint

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for StorageRangeConstraint

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Eq for StorageRangeConstraint

Source§

impl PartialEq for StorageRangeConstraint

Source§

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

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

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

Inequality operator !=. Read more
Source§

impl StructuralPartialEq for StorageRangeConstraint

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Allocation for T
where T: RefUnwindSafe + Send + Sync,

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> MaybeSend for T
where T: Send,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more