Struct RelId 

#[repr(transparent)]
pub struct RelId(pub u64);

v7.37.15 (Phase C.1) — stable per-catalog relation identity.

Why a stable id, separate from the table’s Vec position

A Catalog stores tables in a Vec<Table>; a DROP TABLE removes one, shifting every later table’s position down. So the physical tables[i] index cannot key:

1. the row-lock table — Phase C.4 keys locks by (RelId, RowId); a lock held across a concurrent DROP TABLE of an unrelated table must keep naming the same relation,
2. the RelationStore shard map — Phase C.5 splits the single catalog latch into a DashMap<RelId, _> of per-relation locks; the key must survive catalog mutation,
3. a replication relation mapping — Epic R maps a change to its relation by a stable id, not a shifting slot.

RelId is per-catalog, monotonic, and never reused even after the table is dropped, so a stale lock / redo reference is detectable rather than silently aliasing a table that reused the slot. It pairs with RowId to form the (RelId, RowId) tuple identity Phase C.4’s lock table needs.

Introduced additively in Phase C.1: assigned at CREATE TABLE and stored on the table, but nothing consumes it yet. u64, never wraps; 0 is the RelId::UNASSIGNED sentinel, real ids start at 1.

Tuple Fields

0: u64

Implementations

impl RelId

pub const UNASSIGNED: RelId

The “unassigned” sentinel. A table created through Catalog::create_table always gets a real id ≥ 1; a bare Table::new (test helpers, interim construction) starts unassigned until the catalog stamps it.

Trait Implementations

impl Clone for RelId

fn clone(&self) -> RelId

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RelId

impl Debug for RelId

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

Formats the value using the given formatter.

impl Eq for RelId

impl Hash for RelId

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for RelId

fn cmp(&self, other: &RelId) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for RelId

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for RelId

fn partial_cmp(&self, other: &RelId) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralPartialEq for RelId