Struct BTreeDataset

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

BTree-based RDF dataset.

Implementations

impl<R> BTreeDataset<R>

pub fn new() -> Self

Creates a new empty dataset.

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 into_indexed(self) -> IndexedBTreeDataset<R>

Indexes the quads to allow more operation on this dataset, such as pattern matching using the PatternMatchingDataset trait.

impl<R: Ord> BTreeDataset<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.

Trait Implementations

impl<R: Clone> Clone for BTreeDataset<R>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<R> Dataset for BTreeDataset<R>

type Resource = R

Resource type.

impl<R: Clone + Ord> DatasetMut for BTreeDataset<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 BTreeDataset<R>

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

Formats the value using the given formatter.

impl<R> Default for BTreeDataset<R>

fn default() -> Self

Returns the “default value” for a type.

impl<R: Clone + Ord> Extend<Quad<R>> for BTreeDataset<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 BTreeDataset<R>

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

Creates a value from an iterator.

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

type Item = Quad<R>

The type of the elements being iterated over.

type IntoIter = IntoQuads<R>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<R: Ord> Ord for BTreeDataset<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 BTreeDataset<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 BTreeDataset<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: RdfDisplay> RdfDisplay for BTreeDataset<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 BTreeDataset<R>

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

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

fn resource_count(&self) -> usize

impl<R> TraversableDataset for BTreeDataset<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 BTreeDataset<R>