Struct TribleSet 

pub struct TribleSet {
    pub eav: PATCH<TRIBLE_LEN, EAVOrder, ()>,
    pub vea: PATCH<TRIBLE_LEN, VEAOrder, ()>,
    pub ave: PATCH<TRIBLE_LEN, AVEOrder, ()>,
    pub vae: PATCH<TRIBLE_LEN, VAEOrder, ()>,
    pub eva: PATCH<TRIBLE_LEN, EVAOrder, ()>,
    pub aev: PATCH<TRIBLE_LEN, AEVOrder, ()>,
}

Re-export of TribleSet. A collection of Tribles.

A TribleSet is a collection of Tribles that can be queried and manipulated. It supports efficient set operations like union, intersection, and difference.

The stored Tribles are indexed by the six possible orderings of their fields in corresponding PATCHes.

Clone is extremely cheap and can be used to create a snapshot of the current state of the TribleSet.

Note that the TribleSet does not support an explicit delete/remove operation, as this would conflict with the CRDT semantics of the TribleSet and CALM principles as a whole. It does allow for set subtraction, but that operation is meant to compute the difference between two sets and not to remove elements from the set. A subtle but important distinction.

Fields

eav: PATCH<TRIBLE_LEN, EAVOrder, ()>

Entity → Attribute → Inline index.

vea: PATCH<TRIBLE_LEN, VEAOrder, ()>

Inline → Entity → Attribute index.

ave: PATCH<TRIBLE_LEN, AVEOrder, ()>

Attribute → Inline → Entity index.

vae: PATCH<TRIBLE_LEN, VAEOrder, ()>

Inline → Attribute → Entity index.

eva: PATCH<TRIBLE_LEN, EVAOrder, ()>

Entity → Inline → Attribute index.

aev: PATCH<TRIBLE_LEN, AEVOrder, ()>

Attribute → Entity → Inline index.

Implementations

impl TribleSet

pub fn union(&mut self, other: Self)

Union of two TribleSets.

The other TribleSet is consumed, and this TribleSet is updated in place.

With the parallel feature enabled and other above [PARALLEL_UNION_THRESHOLD] tribles, the six index unions (eav/eva/aev/ave/vea/vae) fan out via nested rayon::join — they touch disjoint memory so there’s no contention. The threshold gates on other.len() because PATCH union work is bounded by the smaller side (each key from other is inserted into self); when other is tiny (e.g. the per- entity!{} += in a serial fold) the rayon overhead would dominate even at large self.

pub fn intersect(&self, other: &Self) -> Self

Returns a new set containing only tribles present in both sets.

pub fn difference(&self, other: &Self) -> Self

Returns a new set containing tribles in self but not in other.

pub fn new() -> TribleSet

Creates an empty set.

pub fn len(&self) -> usize

Returns the number of tribles in the set.

pub fn is_empty(&self) -> bool

Returns true when the set contains no tribles.

pub fn fingerprint(&self) -> TribleSetFingerprint

Returns a fast fingerprint suitable for in-memory caching.

The fingerprint matches TribleSet equality, but it is not stable across process boundaries because PATCH uses a per-process hash key.

pub fn insert(&mut self, trible: &Trible)

Inserts a trible into all six covering indexes.

pub fn contains(&self, trible: &Trible) -> bool

Returns true when the exact trible is present in the set.

pub fn value_in_range<V: InlineEncoding>( &self, variable: Variable<V>, min: Inline<V>, max: Inline<V>, ) -> TribleSetRangeConstraint

Creates a constraint that proposes only values in the byte range [min, max] (inclusive) using the VEA index with infixes_range.

Use with and! alongside a pattern! for efficient range queries:

find!(ts: Inline<NsTAIInterval>,
    and!(
        pattern!(&data, [{ ?id @ attr: ?ts }]),
        data.value_in_range(ts, min_ts, max_ts),
    )
)

pub fn entity_in_range( &self, variable: Variable<GenId>, min: Id, max: Id, ) -> EntityRangeConstraint

Creates a constraint that proposes only entity IDs in the byte range [min, max] (inclusive) using the EAV index with infixes_range.

find!(id: Id,
    and!(
        pattern!(&data, [{ ?id @ attr: value }]),
        data.entity_in_range(id, min_id, max_id),
    )
)

pub fn attribute_in_range( &self, variable: Variable<GenId>, min: Id, max: Id, ) -> AttributeRangeConstraint

Creates a constraint that proposes only attribute IDs in the byte range [min, max] (inclusive) using the AEV index with infixes_range.

find!(attr: Id,
    and!(
        pattern!(&data, [{ entity @ ?attr: _ }]),
        data.attribute_in_range(attr, min_attr, max_attr),
    )
)

pub fn iter(&self) -> TribleSetIterator<'_>

Iterates over all tribles in EAV order.

Trait Implementations

impl Add<Fragment> for TribleSet

type Output = TribleSet

The resulting type after applying the + operator.

fn add(self, rhs: Fragment) -> Self::Output

Performs the + operation.

impl Add<TribleSet> for Fragment

type Output = Fragment

The resulting type after applying the + operator.

fn add(self, rhs: TribleSet) -> Self::Output

Performs the + operation.

impl Add for TribleSet

type Output = TribleSet

The resulting type after applying the + operator.

fn add(self, rhs: Self) -> Self::Output

Performs the + operation.

impl AddAssign<Fragment> for TribleSet

fn add_assign(&mut self, rhs: Fragment)

Performs the += operation.

impl AddAssign<TribleSet> for Fragment

fn add_assign(&mut self, rhs: TribleSet)

Facts-only merge — does not touch exports or blobs.

impl AddAssign for TribleSet

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

impl Clone for TribleSet

fn clone(&self) -> TribleSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TribleSet

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

Formats the value using the given formatter.

impl Default for TribleSet

fn default() -> Self

Returns the “default value” for a type.

impl Encodes<&TribleSet> for SimpleArchive

where Handle<SimpleArchive>: InlineEncoding,

type Output = Blob<SimpleArchive>

The concrete form this source produces when encoded for this schema. Inline<Self> for inline encodings, Blob<Self> for blob encodings, or Inline<Handle<Self>> for the precomputed-handle case where Self: BlobEncoding.

fn encode(source: &TribleSet) -> Blob<SimpleArchive>

Run the encoding.

impl Encodes<TribleSet> for SimpleArchive

where Handle<SimpleArchive>: InlineEncoding,

type Output = Blob<SimpleArchive>

The concrete form this source produces when encoded for this schema. Inline<Self> for inline encodings, Blob<Self> for blob encodings, or Inline<Handle<Self>> for the precomputed-handle case where Self: BlobEncoding.

fn encode(source: TribleSet) -> Blob<SimpleArchive>

Run the encoding.

impl<U> From<&SuccinctArchive<U>> for TribleSet

where U: Universe,

fn from(archive: &SuccinctArchive<U>) -> Self

Converts to this type from the input type.

impl<U> From<&TribleSet> for SuccinctArchive<U>

where U: Universe + Serializable<Error = Error>, <U as Serializable>::Meta: Clone,

fn from(set: &TribleSet) -> Self

Converts to this type from the input type.

impl From<&TribleSet> for TribleSetFingerprint

fn from(set: &TribleSet) -> Self

Converts to this type from the input type.

impl From<Fragment> for TribleSet

fn from(value: Fragment) -> Self

Converts to this type from the input type.

impl From<TribleSet> for Fragment

Lossless promotion: a TribleSet becomes a Fragment with no exported root and an empty blob store. The reverse direction is intentionally not implemented — going from Fragment to TribleSet discards the embedded blob store and exports, so it has to be explicit (Fragment::into_facts).

fn from(facts: TribleSet) -> Self

Converts to this type from the input type.

impl FromIterator<Trible> for TribleSet

fn from_iter<I: IntoIterator<Item = Trible>>(iter: I) -> Self

Creates a value from an iterator.

impl<'a> IntoIterator for &'a TribleSet

type Item = &'a Trible

The type of the elements being iterated over.

type IntoIter = TribleSetIterator<'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq<Checkout> for TribleSet

fn eq(&self, other: &Checkout) -> 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 PartialEq<TribleSet> for Checkout

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

fn eq(&self, other: &Self) -> 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 TriblePattern for TribleSet

type PatternConstraint<'a> = TribleSetConstraint

The type of the constraint created by the pattern method.

fn pattern<V: InlineEncoding>( &self, e: Variable<GenId>, a: Variable<GenId>, v: Variable<V>, ) -> Self::PatternConstraint<'static>

Create a constraint for a given trible pattern. The method takes three variables, one for each part of the trible. The schemas of the entities and attributes are always GenId, while the value schema can be any type implementing InlineEncoding and is specified as a type parameter.

impl TryFromBlob<SimpleArchive> for TribleSet

type Error = UnarchiveError

The error type returned when the conversion fails.

fn try_from_blob(blob: Blob<SimpleArchive>) -> Result<Self, Self::Error>

Attempts to convert a blob into this type.

impl Eq for TribleSet