Struct BTreeGraph

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

BTree-based RDF graph.

Implementations

impl<R> BTreeGraph<R>

pub fn new() -> Self

Creates a new empty graph.

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

Indexes the triples to allow more operation on this graph, such as pattern matching using the PatternMatchingGraph trait.

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

Trait Implementations

impl<R: Clone> Clone for BTreeGraph<R>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<R: Debug> Debug for BTreeGraph<R>

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

Formats the value using the given formatter.

impl<R> Default for BTreeGraph<R>

fn default() -> Self

Returns the “default value” for a type.

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

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

Creates a value from an iterator.

impl<R> Graph for BTreeGraph<R>

type Resource = R

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

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

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

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

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

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

fn graph_resource_count(&self) -> usize

impl<R> TraversableGraph for BTreeGraph<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 BTreeGraph<R>