Struct RelId 

pub struct RelId(pub u32);

A resolved relationship slot — the index of a relationship in its parent table’s Schema::relationships. Relationship names are resolved to a RelId once, at build time (Schema::rel_slot); the hot path (Change::Child``.rel, Relationship``.slot) carries the index, never a string (foundations §3.4, “never a string map”). A distinct newtype from ColId so the two index spaces can’t be confused.

Ord is derived so a slot can key an ordered map (the testkit’s CaughtNode.relationships is a BTreeMap<RelId, _> for slot-stable diffs); the order is the declared-relationship order, which is meaningful.

Serde (gated, like crate::ast::Ast) lets a RelId slot cross the wire in a flat change (FLAT-CHANGES-DESIGN.md); the newtype serializes transparently as its inner u32.

Tuple Fields

0: u32

Implementations

impl RelId

pub fn ix(self) -> usize

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 Debug for RelId

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for RelId

fn deserialize<__D>( __deserializer: __D, ) -> Result<RelId, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for RelId

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

where __H: Hasher,

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

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 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 Serialize for RelId

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for RelId

impl Eq for RelId

impl StructuralPartialEq for RelId