Struct KeyedRosterRows 

pub struct KeyedRosterRows<'rosters, Left, LeftKey, Right, RightKey, Payload, const LEFT: usize, const RIGHT: usize, const ROWS: usize> { /* private fields */ }

Foreign-free rows referencing one left and one right caller-keyed roster.

Rows retain authored order and may be empty or repeated until a caller-selected posture informs those questions.

Implementations

impl<'rosters, Left, LeftKey, Right, RightKey, Payload, const LEFT: usize, const RIGHT: usize, const ROWS: usize> KeyedRosterRows<'rosters, Left, LeftKey, Right, RightKey, Payload, LEFT, RIGHT, ROWS>

pub const fn left(&self) -> &'rosters KeyedRoster<Left, LeftKey, LEFT>

The left roster every row was resolved against.

pub const fn right(&self) -> &'rosters KeyedRoster<Right, RightKey, RIGHT>

The right roster every row was resolved against.

pub fn count(&self) -> usize

How many foreign-free rows are held.

pub fn is_empty(&self) -> bool

Whether no relation row was declared.

pub fn indexed( &self, ) -> impl Iterator<Item = (usize, &LeftKey, &Left, &RightKey, &Right, &Payload)>

Reads every authored row with both resolved roster members and its caller-owned payload.

pub fn at( &self, index: usize, ) -> Option<(&LeftKey, &Left, &RightKey, &Right, &Payload)>

Reads one authored row at a checked position.

pub fn canonical_indices(&self) -> &[usize]

The authored row indices in canonical left-position then right-position order.

Equal endpoint pairs retain authored order until duplicate posture is settled.

pub fn canonical_at( &self, index: usize, ) -> Option<(&LeftKey, &Left, &RightKey, &Right, &Payload)>

Reads one row by its canonical-order position.

pub fn payloads_for<'reading, LeftQuery, RightQuery>( &'reading self, left: &LeftQuery, right: &RightQuery, ) -> impl Iterator<Item = &'reading Payload>

where LeftKey: Borrow<LeftQuery>, LeftQuery: Eq + ?Sized, RightKey: Borrow<RightQuery>, RightQuery: Eq + ?Sized,

Reads every payload under one pair of borrowed roster keys.

pub fn distinct( self, ) -> Result<KeyedRosterRelation<'rosters, Left, LeftKey, Right, RightKey, Payload, LEFT, RIGHT, ROWS>, RepeatedRelationPairs<ROWS>>

Promote these foreign-free rows into a relation where every endpoint pair occurs once.

Errors

Returns every distinct repeated endpoint pair with its first and later authored positions.

impl<'rosters, Left, LeftKey: Eq, Right, RightKey: Eq, Payload, const LEFT: usize, const RIGHT: usize, const ROWS: usize> KeyedRosterRows<'rosters, Left, LeftKey, Right, RightKey, Payload, LEFT, RIGHT, ROWS>

pub fn referenced( left: &'rosters KeyedRoster<Left, LeftKey, LEFT>, right: &'rosters KeyedRoster<Right, RightKey, RIGHT>, payloads: Vec<Payload>, left_key_of: impl FnMut(&Payload) -> LeftKey, right_key_of: impl FnMut(&Payload) -> RightKey, ) -> Result<Self, KeyedRosterRowsError<LeftKey, RightKey, ROWS>>

Resolve one complete row offering against two existing keyed rosters.

Row magnitude is settled before either endpoint projection runs. Every left reference is settled before the right projection begins.

Errors

Returns row overflow, every foreign left reference, or every foreign right reference under that precedence.

impl<Left, LeftKey, Right, RightKey, Payload, const LEFT: usize, const RIGHT: usize, const ROWS: usize> KeyedRosterRows<'_, Left, LeftKey, Right, RightKey, Payload, LEFT, RIGHT, ROWS>

pub fn at_in( &self, order: RowOrder, index: usize, ) -> Option<(&LeftKey, &Left, &RightKey, &Right, &Payload)>

Reads one row under the caller-selected stable order.

pub fn occupancy_standing(&self) -> OccupancyStanding

Whether this relation holds no row or at least one.

pub fn repetition_standing(&self) -> RepetitionStanding

Whether every endpoint pair occurs once or at least one pair repeats.

pub fn left_completeness(&self) -> CompletenessStanding

Whether every left-roster member occurs in at least one row.

pub fn right_completeness(&self) -> CompletenessStanding

Whether every right-roster member occurs in at least one row.

pub fn density_standing(&self) -> DensityStanding

Whether every pair in the left-by-right roster product occurs in at least one row.

impl<Member, Key, Payload, const MEMBERS: usize, const ROWS: usize> KeyedRosterRows<'_, Member, Key, Member, Key, Payload, MEMBERS, MEMBERS, ROWS>

pub fn roster_relation_standing(&self) -> RosterRelationStanding

Whether both relation sides borrow the same roster instance.

pub fn self_relation_standing( &self, ) -> Result<SelfRelationStanding, SameRosterRequired>

Whether at least one row relates a member to itself.

Errors

Returns a typed refusal when the relation sides borrow different roster instances.

pub fn cycle_standing(&self) -> Result<CycleStanding, SameRosterRequired>

Whether this same-roster directed relation contains a cycle.

Errors

Returns a typed refusal when the relation sides borrow different roster instances.

impl<Member, Key: Eq, Payload, const MEMBERS: usize, const ROWS: usize> KeyedRosterRows<'_, Member, Key, Member, Key, Payload, MEMBERS, MEMBERS, ROWS>

pub fn reachability_from( &self, root: Key, ) -> Result<Reachability<MEMBERS>, ReachabilityError<Key>>

Partitions one shared roster into members reachable and unreachable from a declared root.

Both partitions follow roster order rather than traversal order.

Errors

Returns a typed refusal when the relation sides borrow different roster instances or when the root is outside that roster.

Trait Implementations

impl<'rosters, Left: Clone, LeftKey: Clone, Right: Clone, RightKey: Clone, Payload: Clone, const LEFT: usize, const RIGHT: usize, const ROWS: usize> Clone for KeyedRosterRows<'rosters, Left, LeftKey, Right, RightKey, Payload, LEFT, RIGHT, ROWS>

fn clone( &self, ) -> KeyedRosterRows<'rosters, Left, LeftKey, Right, RightKey, Payload, LEFT, RIGHT, ROWS>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'rosters, Left: Debug, LeftKey: Debug, Right: Debug, RightKey: Debug, Payload: Debug, const LEFT: usize, const RIGHT: usize, const ROWS: usize> Debug for KeyedRosterRows<'rosters, Left, LeftKey, Right, RightKey, Payload, LEFT, RIGHT, ROWS>

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

Formats the value using the given formatter.

impl<'rosters, Left: Eq, LeftKey: Eq, Right: Eq, RightKey: Eq, Payload: Eq, const LEFT: usize, const RIGHT: usize, const ROWS: usize> Eq for KeyedRosterRows<'rosters, Left, LeftKey, Right, RightKey, Payload, LEFT, RIGHT, ROWS>

impl<'rosters, Left: Hash, LeftKey: Hash, Right: Hash, RightKey: Hash, Payload: Hash, const LEFT: usize, const RIGHT: usize, const ROWS: usize> Hash for KeyedRosterRows<'rosters, Left, LeftKey, Right, RightKey, Payload, LEFT, RIGHT, ROWS>

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<'rosters, Left: PartialEq, LeftKey: PartialEq, Right: PartialEq, RightKey: PartialEq, Payload: PartialEq, const LEFT: usize, const RIGHT: usize, const ROWS: usize> PartialEq for KeyedRosterRows<'rosters, Left, LeftKey, Right, RightKey, Payload, LEFT, RIGHT, ROWS>

fn eq( &self, other: &KeyedRosterRows<'rosters, Left, LeftKey, Right, RightKey, Payload, LEFT, RIGHT, ROWS>, ) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<'rosters, Left: PartialEq, LeftKey: PartialEq, Right: PartialEq, RightKey: PartialEq, Payload: PartialEq, const LEFT: usize, const RIGHT: usize, const ROWS: usize> StructuralPartialEq for KeyedRosterRows<'rosters, Left, LeftKey, Right, RightKey, Payload, LEFT, RIGHT, ROWS>