Struct IndexedBTreeDataset

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

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

Implementations

impl<R> IndexedBTreeDataset<R>

pub fn new() -> Self

Creates a new empty dataset.

pub fn from_non_indexed(dataset: BTreeDataset<R>) -> Self

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

pub fn len(&self) -> usize

Returns the number of quads in the dataset.

pub fn is_empty(&self) -> bool

Checks if the dataset is empty.

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

Returns an iterator over the quads of the dataset.

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

Returns an iterator over the resources of the dataset.

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

Returns an iterator over the subjects of the dataset.

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

Returns an iterator over the predicates of the dataset.

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

Returns an iterator over the objects of the dataset.

pub fn named_graphs(&self) -> NamedGraphs<'_, R>

Returns an iterator over the named graphs of the dataset.

impl<R: Ord> IndexedBTreeDataset<R>

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

Checks if the provided resource appears in any quad in the dataset.

pub fn contains(&self, quad: Quad<&R>) -> bool

Checks if the provided quad is in the dataset.

pub fn insert(&mut self, quad: Quad<R>) -> bool

Inserts the given quad in the dataset.

Returns true if the quad was not already in the dataset, and false if it was.

pub fn remove(&mut self, quad: Quad<&R>) -> bool

Removes the given quad from the dataset.

Returns whether or not the quad was in the dataset. Does nothing if the quad was not in the dataset.

pub fn remove_graph(&mut self, graph: Option<&R>) -> Option<BTreeGraph<R>>

where R: Clone,

Removes the given graph from the dataset if it exists, and returns it.

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

Returns an iterator over all the quads matching the given canonical quad pattern.

pub fn extract_pattern_matching( &mut self, pattern: CanonicalQuadPattern<&R>, ) -> ExtractPatternMatching<'_, R>

Returns an iterator over all the quads matching the given canonical quad pattern. The matching quads are removed from the dataset.

Trait Implementations

impl<R: Clone> Clone for IndexedBTreeDataset<R>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<R> Dataset for IndexedBTreeDataset<R>

type Resource = R

Resource type.

impl<R: Clone + Ord> DatasetMut for IndexedBTreeDataset<R>

fn insert(&mut self, quad: Quad<Self::Resource>)

Inserts the given quad in the dataset.

fn remove(&mut self, quad: Quad<&Self::Resource>)

Removes the given quad from the dataset.

impl<R: Debug> Debug for IndexedBTreeDataset<R>

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

Formats the value using the given formatter.

impl<R> Default for IndexedBTreeDataset<R>

fn default() -> Self

Returns the “default value” for a type.

impl<R: Clone + Ord> Extend<Quad<R>> for IndexedBTreeDataset<R>

fn extend<T: IntoIterator<Item = Quad<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 From<BTreeDataset> for IndexedBTreeDataset

fn from(value: BTreeDataset) -> Self

Converts to this type from the input type.

impl<R: Clone + Ord> FromIterator<Quad<R>> for IndexedBTreeDataset<R>

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

Creates a value from an iterator.

impl<R: Hash> Hash for IndexedBTreeDataset<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 IndexedBTreeDataset<R>

type Item = Quad<&'a R>

The type of the elements being iterated over.

type IntoIter = Quads<'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 IndexedBTreeDataset<R>

type Item = Quad<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> NamedGraphTraversableDataset for IndexedBTreeDataset<R>

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

fn named_graphs(&self) -> Self::NamedGraphs<'_>

fn named_graph_count(&self) -> usize

impl<R> ObjectTraversableDataset for IndexedBTreeDataset<R>

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

fn objects(&self) -> Self::Objects<'_>

fn object_count(&self) -> usize

impl<R: Ord> Ord for IndexedBTreeDataset<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 IndexedBTreeDataset<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 IndexedBTreeDataset<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> PatternMatchingDataset for IndexedBTreeDataset<R>

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

Pattern-matching iterator.

fn quad_pattern_matching<'p>( &self, pattern: CanonicalQuadPattern<&'p Self::Resource>, ) -> Self::QuadPatternMatching<'_, 'p>

Returns an iterator over all the quads of the dataset matching the given pattern.

fn contains_quad(&self, quad: Quad<&Self::Resource>) -> bool

Checks if the dataset contains the given quad.

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

Checks if the dataset contains the given subject.

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

Checks if the dataset contains the given predicate.

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

Checks if the dataset contains the given object.

fn contains_named_graph(&self, named_graph: &Self::Resource) -> bool

Checks if the dataset contains the given named graph.

fn quad_predicates_objects<'p>( &self, graph: Option<&'p Self::Resource>, subject: &'p Self::Resource, ) -> QuadPredicatesObjects<'_, 'p, Self>

where Self: PredicateTraversableDataset,

Returns an iterator over all the predicates p matching any quad subject p o graph present in the dataset, for any object o.

fn quad_objects<'p>( &self, graph: Option<&'p Self::Resource>, subject: &'p Self::Resource, predicate: &'p Self::Resource, ) -> QuadObjects<'_, 'p, Self>

Returns an iterator over all the objects o matching the quad subject predicate o graph.

impl<R> PredicateTraversableDataset for IndexedBTreeDataset<R>

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

fn predicates(&self) -> Self::Predicates<'_>

fn predicate_count(&self) -> usize

impl<R: RdfDisplay> RdfDisplay for IndexedBTreeDataset<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> ResourceTraversableDataset for IndexedBTreeDataset<R>

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

fn resources(&self) -> Self::Resources<'_>

fn resource_count(&self) -> usize

impl<R> SubjectTraversableDataset for IndexedBTreeDataset<R>

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

fn subjects(&self) -> Self::Subjects<'_>

fn subject_count(&self) -> usize

impl<R> TraversableDataset for IndexedBTreeDataset<R>

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

Quads iterator.

fn quads(&self) -> Self::Quads<'_>

Returns an iterator over the quads of the dataset.

fn quads_count(&self) -> usize

impl<R: Eq> Eq for IndexedBTreeDataset<R>