Struct GraphEdge 

pub struct GraphEdge {
    pub from_id: [u8; 16],
    pub to_id: [u8; 16],
    pub kind: u8,
    pub label: String,
}

One graph edge. kind: 0 = Relation, 1 = Fact, 2 = HasStatement, 3 = Mentions, 4..=11 = the memory↔memory builtin kinds in EdgeKind order (4 + EdgeKind as u8), i.e. 4 = Caused, 5 = FollowedBy, 6 = DerivedFrom, 7 = SimilarTo, 8 = Contradicts, 9 = Supports, 10 = References, 11 = PartOf. The kind byte alone identifies the link — there is no companion field.

Fields

from_id: [u8; 16]

to_id: [u8; 16]

kind: u8

label: String

Predicate / relation-type label; empty for Mentions.

Trait Implementations

impl Clone for GraphEdge

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphEdge

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphEdge

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for GraphEdge

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for GraphEdge

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for GraphEdge