Struct AtomKey 

pub struct AtomKey {
    pub domain: String,
    pub subject: String,
    pub predicate: Option<String>,
    pub object: Option<String>,
}

The identity of an atom: the domain plus the triple (subject, predicate, object?), owned so it survives across merged sources. The domain is the leading sort key, so atoms group by domain; ordering is otherwise lexicographic → canonical. Two atoms with the same triple in different domains are distinct (no cross-domain unification).

Fields

domain: String

The domain this atom belongs to (the resolved namespace, never a raw alias). physics.engine and plan.engine are different atoms.

subject: String

The entity the claim is about (owned copy of the parser’s subject).

predicate: Option<String>

The relation or property asserted. None for a bare proposition — a single-word atom introduced by a VAR port (e.g. db_ready). None sorts before any Some, so existing (always-Some) atoms keep their order.

object: Option<String>

Optional object; part of identity, so has flying ≠ has swimming. Always None when predicate is None.

Trait Implementations

impl Clone for AtomKey

fn clone(&self) -> AtomKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AtomKey

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

Formats the value using the given formatter.

impl Eq for AtomKey

impl Ord for AtomKey

fn cmp(&self, other: &AtomKey) -> 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 AtomKey

fn eq(&self, other: &AtomKey) -> 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 AtomKey

fn partial_cmp(&self, other: &AtomKey) -> 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 StructuralPartialEq for AtomKey