pub struct RelationView {
pub from: NodeKey,
pub to: NodeKey,
pub kind: RelationKind,
}Expand description
Canonical read-side relation view. One row per (from, to,
RelationKind) — a multi-relation node pair yields multiple
rows. Replaces the EdgeType-flavoured EdgeView removed in
stage 4 of the 2026-05-11 relation-taxonomy plan.
This is the classifier shape — it carries no per-relation
payload (labels, decay, traversal events). Callers needing
payload reach for the typed EdgePayload sidecar via the
kernel’s per-family query methods.
Fields§
§from: NodeKey§to: NodeKey§kind: RelationKindTrait Implementations§
Source§impl Clone for RelationView
impl Clone for RelationView
impl Copy for RelationView
Source§impl Debug for RelationView
impl Debug for RelationView
impl Eq for RelationView
Source§impl Hash for RelationView
impl Hash for RelationView
Source§impl PartialEq for RelationView
impl PartialEq for RelationView
impl StructuralPartialEq for RelationView
Auto Trait Implementations§
impl Freeze for RelationView
impl RefUnwindSafe for RelationView
impl Send for RelationView
impl Sync for RelationView
impl Unpin for RelationView
impl UnsafeUnpin for RelationView
impl UnwindSafe for RelationView
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Returns the layout of the type.
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Returns whether the given value has been niched. Read more
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out indicating that a T is niched.