Struct IndexedBTreeGraph

pub struct IndexedBTreeGraph<R = Term> { /* private fields */ }

Indexed BTree-based RDF graph, optimized for pattern matching operations.

Implementations

impl<R> IndexedBTreeGraph<R>

pub fn new() -> Self

Creates a new empty graph.

pub fn from_non_indexed(graph: BTreeGraph<R>) -> Self

Creates a new indexed graph from a non-indexed one.

pub fn len(&self) -> usize

Returns the number of triples in the graph.

pub fn is_empty(&self) -> bool

Checks if the graph is empty.

pub fn iter(&self) -> Triples<'_, R>

Returns an iterator over the triples of the graph.

pub fn resources(&self) -> Resources<'_, R>

Returns an iterator over the resources of the graph.

pub fn subjects(&self) -> Subjects<'_, R>

Returns an iterator over the subjects of the graph.

pub fn predicates(&self) -> Predicates<'_, R>

Returns an iterator over the predicates of the graph.

pub fn objects(&self) -> Objects<'_, R>

Returns an iterator over the objects of the graph.

impl<R: Ord> IndexedBTreeGraph<R>

pub fn contains_resource(&self, resource: &R) -> bool

Checks if the provided resource appears in any triple in the graph.

pub fn contains(&self, triple: Triple<&R>) -> bool

Checks if the provided triple is in the graph.

pub fn insert(&mut self, triple: Triple<R>) -> bool

Inserts the given triple in the graph.

Returns true if the triple was not already in the graph, and false if it was.

pub fn remove(&mut self, triple: Triple<&R>) -> bool

Removes the given triple from the graph.

Returns whether or not the triple was in the graph. Does nothing if the triple was not in the graph.

pub fn pattern_matching( &self, pattern: CanonicalTriplePattern<&R>, ) -> PatternMatching<'_, R>

Returns an iterator over all the triples matching the given canonical triple pattern.

Trait Implementations

impl<R: Clone> Clone for IndexedBTreeGraph<R>

fn clone(&self) -> IndexedBTreeGraph<R>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<R: Debug> Debug for IndexedBTreeGraph<R>

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

Formats the value using the given formatter.

impl<R> Default for IndexedBTreeGraph<R>

fn default() -> Self

Returns the “default value” for a type.

impl<R: Clone + Ord> Extend<Triple<R>> for IndexedBTreeGraph<R>

fn extend<T: IntoIterator<Item = Triple<R>>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<R> From<BTreeGraph<R>> for IndexedBTreeGraph<R>

fn from(value: BTreeGraph<R>) -> Self

Converts to this type from the input type.

impl<R: Clone + Ord> FromIterator<Triple<R>> for IndexedBTreeGraph<R>

fn from_iter<T: IntoIterator<Item = Triple<R>>>(iter: T) -> Self

Creates a value from an iterator.

impl<R> Graph for IndexedBTreeGraph<R>

type Resource = R

impl<R: Clone + Ord> GraphMut for IndexedBTreeGraph<R>

fn insert(&mut self, triple: Triple<Self::Resource>)

fn remove(&mut self, triple: Triple<&Self::Resource>)

impl<R: Hash> Hash for IndexedBTreeGraph<R>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, R> IntoIterator for &'a IndexedBTreeGraph<R>

type Item = Triple<&'a R>

The type of the elements being iterated over.

type IntoIter = Triples<'a, R>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<R: Clone> IntoIterator for IndexedBTreeGraph<R>

type Item = Triple<R>

The type of the elements being iterated over.

type IntoIter = IntoTriples<R>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<R> ObjectTraversableGraph for IndexedBTreeGraph<R>

type GraphObjects<'a> = Objects<'a, R> where R: 'a

fn graph_objects(&self) -> Self::GraphObjects<'_>

fn graph_object_count(&self) -> usize

impl<R: Ord> Ord for IndexedBTreeGraph<R>

fn cmp(&self, other: &Self) -> 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<R: PartialEq> PartialEq for IndexedBTreeGraph<R>

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<R: PartialOrd> PartialOrd for IndexedBTreeGraph<R>

fn partial_cmp(&self, other: &Self) -> 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<R: Ord> PatternMatchingGraph for IndexedBTreeGraph<R>

type TriplePatternMatching<'a, 'p> = PatternMatching<'a, R> where R: 'a, Self::Resource: 'p

fn triple_pattern_matching<'p>( &self, pattern: CanonicalTriplePattern<&'p Self::Resource>, ) -> Self::TriplePatternMatching<'_, 'p>

fn contains_triple(&self, triple: Triple<&Self::Resource>) -> bool

fn contains_triple_subject(&self, subject: &Self::Resource) -> bool

Checks if the graph contains the given subject.

fn contains_triple_predicate(&self, predicate: &Self::Resource) -> bool

Checks if the graph contains the given predicate.

fn contains_triple_object(&self, object: &Self::Resource) -> bool

Checks if the graph contains the given object.

fn triple_predicates_objects<'p>( &self, subject: &'p Self::Resource, ) -> TriplePredicatesObjects<'_, 'p, Self>

where Self: PredicateTraversableGraph,

Returns an iterator over all the predicates p matching the triple subject p o present in the graph, for some o.

fn triple_objects<'p>( &self, subject: &'p Self::Resource, predicate: &'p Self::Resource, ) -> TripleObjects<'_, 'p, Self>

Returns an iterator over all the objects o matching the triple subject predicate o present in the graph.

impl<R> PredicateTraversableGraph for IndexedBTreeGraph<R>

type GraphPredicates<'a> = Predicates<'a, R> where R: 'a

fn graph_predicates(&self) -> Self::GraphPredicates<'_>

fn graph_predicate_count(&self) -> usize

impl<R: RdfDisplay> RdfDisplay for IndexedBTreeGraph<R>

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

Formats the value using the given formatter.

fn rdf_display(&self) -> RdfDisplayed<&Self>

Prepare the value to be formatted as an RDF syntax element.

impl<R> ResourceTraversableGraph for IndexedBTreeGraph<R>

type GraphResources<'a> = Resources<'a, R> where R: 'a

fn graph_resources(&self) -> Self::GraphResources<'_>

fn graph_resource_count(&self) -> usize

impl<R> SubjectTraversableGraph for IndexedBTreeGraph<R>

type GraphSubjects<'a> = Subjects<'a, R> where R: 'a

fn graph_subjects(&self) -> Self::GraphSubjects<'_>

fn graph_subject_count(&self) -> usize

impl<R> TraversableGraph for IndexedBTreeGraph<R>

type Triples<'a> = Triples<'a, R> where R: 'a

fn triples(&self) -> Self::Triples<'_>

fn triples_count(&self) -> usize

impl<R: Eq> Eq for IndexedBTreeGraph<R>