pub enum RelationKind {
Semantic(SemanticSubKind),
OpenPredicate,
Traversal,
Containment(ContainmentSubKind),
Arrangement(ArrangementSubKind),
Imported(ImportedSubKind),
Provenance(ProvenanceSubKind),
}Expand description
Canonical read-side classifier for an edge’s relation. Combines
family + sub-kind into one enum that callers reaching for “what
kind of relation is this?” can match on without touching the
write-side EdgeAssertion payload.
Per the 2026-05-11 relation-taxonomy plan §3: RelationKind
is the discriminant shape (RelationKind ≈ discriminant(EdgeAssertion)), used by canvas hit-tests, render
policy, filter UIs, action-target inference, and view-local
hide keys. EdgeAssertion remains the write contract — it
carries construction-time payload (labels, decay state, etc.)
that read sites don’t need.
Traversal is the one variant without a sub-kind: traversal
is event-shaped, with temporal nuance in NavigationTrigger
rather than a TraversalSubKind enum.
OpenPredicate is a Semantic statement whose predicate IRI has no
recognized SemanticSubKind (minted by assert_semantic_predicate
/ JSON-LD ingest). It exists so relations() emits one row per
statement, matching has_relation(Family(Semantic)) (Q1 ruling,
2026-09-12). The IRI is reached through the typed payload
(semantic_statements()), not carried on the row, so the kind stays
Copy.
Variants§
Semantic(SemanticSubKind)
OpenPredicate
Traversal
Containment(ContainmentSubKind)
Arrangement(ArrangementSubKind)
Imported(ImportedSubKind)
Provenance(ProvenanceSubKind)
Implementations§
Source§impl RelationKind
impl RelationKind
Sourcepub fn predicate_iri(self) -> Option<&'static str>
pub fn predicate_iri(self) -> Option<&'static str>
The canonical predicate IRI for a recognized relation kind.
Semantic predicates retain their established byte-for-byte IRIs. The other sub-kind families use an explicit family-qualified local name so their predicate identity is stable across refactors. Traversal and open predicates do not name one fixed predicate here.
Sourcepub fn from_predicate_iri(iri: &str) -> Option<Self>
pub fn from_predicate_iri(iri: &str) -> Option<Self>
Decode a canonical predicate IRI produced by Self::predicate_iri.
Unknown and open predicates remain outside the closed relation-kind
vocabulary.
Sourcepub fn family(self) -> EdgeFamily
pub fn family(self) -> EdgeFamily
Project to the relation’s family. Pure function — no payload access required.
Sourcepub fn tag(self) -> u32
pub fn tag(self) -> u32
Encode this relation as an opaque u32 tag for transport
through layers that can’t depend on kernel (e.g.
graph-canvas::CanvasEdge::tag / HitProxy::Edge::tag).
The top byte is the family ordinal (0..5); the bottom three
bytes are the sub-kind ordinal within the family.
OpenPredicate keeps the Semantic family
byte and uses the all-ones sub-ordinal
([OPEN_PREDICATE_TAG_SUB]) as its sentinel, so a consumer that
reads only the family byte still sees Semantic.
Self::from_tag is the inverse.
Trait Implementations§
Source§impl Archive for RelationKind
impl Archive for RelationKind
Source§type Archived = ArchivedRelationKind
type Archived = ArchivedRelationKind
Source§type Resolver = RelationKindResolver
type Resolver = RelationKindResolver
Source§fn resolve(
&self,
resolver: <Self as Archive>::Resolver,
out: Place<<Self as Archive>::Archived>,
)
fn resolve( &self, resolver: <Self as Archive>::Resolver, out: Place<<Self as Archive>::Archived>, )
Source§const COPY_OPTIMIZATION: CopyOptimization<Self> = _
const COPY_OPTIMIZATION: CopyOptimization<Self> = _
serialize. Read moreSource§impl Clone for RelationKind
impl Clone for RelationKind
impl Copy for RelationKind
Source§impl Debug for RelationKind
impl Debug for RelationKind
Source§impl<'de> Deserialize<'de> for RelationKind
impl<'de> Deserialize<'de> for RelationKind
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Source§impl<__D: Fallible + ?Sized> Deserialize<RelationKind, __D> for Archived<RelationKind>where
SemanticSubKind: Archive,
<SemanticSubKind as Archive>::Archived: Deserialize<SemanticSubKind, __D>,
ContainmentSubKind: Archive,
<ContainmentSubKind as Archive>::Archived: Deserialize<ContainmentSubKind, __D>,
ArrangementSubKind: Archive,
<ArrangementSubKind as Archive>::Archived: Deserialize<ArrangementSubKind, __D>,
ImportedSubKind: Archive,
<ImportedSubKind as Archive>::Archived: Deserialize<ImportedSubKind, __D>,
ProvenanceSubKind: Archive,
<ProvenanceSubKind as Archive>::Archived: Deserialize<ProvenanceSubKind, __D>,
impl<__D: Fallible + ?Sized> Deserialize<RelationKind, __D> for Archived<RelationKind>where
SemanticSubKind: Archive,
<SemanticSubKind as Archive>::Archived: Deserialize<SemanticSubKind, __D>,
ContainmentSubKind: Archive,
<ContainmentSubKind as Archive>::Archived: Deserialize<ContainmentSubKind, __D>,
ArrangementSubKind: Archive,
<ArrangementSubKind as Archive>::Archived: Deserialize<ArrangementSubKind, __D>,
ImportedSubKind: Archive,
<ImportedSubKind as Archive>::Archived: Deserialize<ImportedSubKind, __D>,
ProvenanceSubKind: Archive,
<ProvenanceSubKind as Archive>::Archived: Deserialize<ProvenanceSubKind, __D>,
Source§fn deserialize(
&self,
deserializer: &mut __D,
) -> Result<RelationKind, <__D as Fallible>::Error>
fn deserialize( &self, deserializer: &mut __D, ) -> Result<RelationKind, <__D as Fallible>::Error>
impl Eq for RelationKind
Source§impl Hash for RelationKind
impl Hash for RelationKind
Source§impl PartialEq for RelationKind
impl PartialEq for RelationKind
Source§impl Serialize for RelationKind
impl Serialize for RelationKind
Source§impl<__S: Fallible + ?Sized> Serialize<__S> for RelationKindwhere
SemanticSubKind: Serialize<__S>,
ContainmentSubKind: Serialize<__S>,
ArrangementSubKind: Serialize<__S>,
ImportedSubKind: Serialize<__S>,
ProvenanceSubKind: Serialize<__S>,
impl<__S: Fallible + ?Sized> Serialize<__S> for RelationKindwhere
SemanticSubKind: Serialize<__S>,
ContainmentSubKind: Serialize<__S>,
ArrangementSubKind: Serialize<__S>,
ImportedSubKind: Serialize<__S>,
ProvenanceSubKind: Serialize<__S>,
impl StructuralPartialEq for RelationKind
Auto Trait Implementations§
impl Freeze for RelationKind
impl RefUnwindSafe for RelationKind
impl Send for RelationKind
impl Sync for RelationKind
impl Unpin for RelationKind
impl UnsafeUnpin for RelationKind
impl UnwindSafe for RelationKind
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Source§impl<T> ArchiveUnsized for Twhere
T: Archive,
impl<T> ArchiveUnsized for Twhere
T: Archive,
Source§type Archived = <T as Archive>::Archived
type Archived = <T as Archive>::Archived
Archive, it may be
unsized. Read moreSource§fn archived_metadata(
&self,
) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
fn archived_metadata( &self, ) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
impl<T> EntryIdentityKey for T
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
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>
impl<T> MemoryPayload for T
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
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out indicating that a T is niched.