Struct Fragment 

pub struct Fragment { /* private fields */ }

Re-export of Fragment. A rooted (or multi-root) fragment of a knowledge graph.

A fragment is a TribleSet plus a (possibly empty) set of “exported” entity ids that act as entry points into the contained facts. Exports are not privileged in the graph model itself; they are simply the ids the producer wants to hand back to the caller as the fragment’s interface.

Implementations

impl Fragment

pub fn empty() -> Self

Creates an empty fragment with no exports and no facts.

pub fn rooted(root: Id, facts: TribleSet) -> Self

Creates a fragment that exports a single root id.

pub fn new<I>(exports: I, facts: TribleSet) -> Self

where I: IntoIterator<Item = Id>,

Creates a fragment with the given exported ids.

Export ids are canonicalized as a set (duplicates are ignored). Empty exports are allowed.

pub fn exports(&self) -> impl Iterator<Item = Id> + '_

Returns the exported ids for this fragment, in deterministic (lexicographic) order.

pub fn root(&self) -> Option<Id>

Returns the single exported id if this fragment is rooted.

pub fn facts(&self) -> &TribleSet

pub fn into_facts(self) -> TribleSet

pub fn into_parts(self) -> (PATCH<16>, TribleSet)

Methods from Deref<Target = TribleSet>

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 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 contains(&self, trible: &Trible) -> bool

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

pub fn value_in_range<V: ValueSchema>( &self, variable: Variable<V>, min: Value<V>, max: Value<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: Value<NsTAIInterval>,
    and!(
        pattern!(&data, [{ ?id @ attr: ?ts }]),
        data.value_in_range(ts, min_ts, max_ts),
    )
)

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 Fragment

type Output = Fragment

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)

Performs the += operation.

impl AddAssign for Fragment

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

impl Clone for Fragment

fn clone(&self) -> Fragment

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Fragment

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

Formats the value using the given formatter.

impl Default for Fragment

fn default() -> Fragment

Returns the “default value” for a type.

impl Deref for Fragment

type Target = TribleSet

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl From<Fragment> for TribleSet

fn from(value: Fragment) -> Self

Converts to this type from the input type.

impl<'a> IntoIterator for &'a Fragment

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 for Fragment

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

type Item = Id

The type of each yielded value.

type Iter = IntoIter<Id>

The iterator type returned by spread.

fn spread(self) -> (Self::Iter, TribleSet)

Decomposes the value into an iterator of items and extra facts to merge.

impl Eq for Fragment

impl StructuralPartialEq for Fragment