Struct Dataset 

pub struct Dataset { /* private fields */ }

An in-memory RDF Dataset

A dataset is a collection of named graphs plus a default graph. Each named graph is identified by an IRI or blank node.

Implementations

impl Dataset

pub fn new() -> Self

Creates a new empty dataset

pub fn with_capacity(capacity: usize) -> Self

Creates a new dataset with the specified capacity for named graphs

pub fn default_graph(&self) -> &Graph

Returns a reference to the default graph

pub fn default_graph_mut(&mut self) -> &mut Graph

Returns a mutable reference to the default graph

pub fn named_graph(&self, name: &GraphName) -> Option<&Graph>

Returns a reference to the named graph with the given name

pub fn named_graph_mut(&mut self, name: &GraphName) -> &mut Graph

Returns a mutable reference to the named graph with the given name

Creates the graph if it doesn’t exist.

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

Inserts a quad into the dataset

Returns true if the quad was not already present, false otherwise.

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

Removes a quad from the dataset

Returns true if the quad was present, false otherwise.

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

Returns true if the dataset contains the specified quad

pub fn len(&self) -> usize

Returns the total number of quads in the dataset

pub fn is_empty(&self) -> bool

Returns true if the dataset contains no quads

pub fn named_graph_count(&self) -> usize

Returns the number of named graphs (excluding default graph)

pub fn graph_names(&self) -> impl Iterator<Item = &GraphName>

Returns an iterator over all graph names (excluding default graph)

pub fn named_graphs(&self) -> impl Iterator<Item = (&GraphName, &Graph)>

Returns an iterator over all named graphs

pub fn clear(&mut self)

Clears the dataset, removing all quads

pub fn remove_graph(&mut self, name: &GraphName) -> Option<Graph>

Removes a named graph from the dataset

Returns the removed graph if it existed.

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

Returns an iterator over all quads in the dataset

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

Returns an iterator over all quads in the dataset as references

pub fn quads_for_pattern<'a>( &'a self, subject: Option<&'a Subject>, predicate: Option<&'a Predicate>, object: Option<&'a Object>, graph_name: Option<&'a GraphName>, ) -> Box<dyn Iterator<Item = Quad> + 'a>

Finds all quads matching the given pattern

None values in the pattern act as wildcards.

pub fn extend<I>(&mut self, quads: I)

where I: IntoIterator<Item = Quad>,

Extends the dataset with quads from an iterator

pub fn union(&self, other: &Dataset) -> Dataset

Creates the union of this dataset with another dataset

Trait Implementations

impl Clone for Dataset

fn clone(&self) -> Dataset

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Dataset

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

Formats the value using the given formatter.

impl Default for Dataset

fn default() -> Self

Returns the “default value” for a type.

impl Extend<Quad> for Dataset

fn extend<T: IntoIterator<Item = Quad>>(&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 FromIterator<Quad> for Dataset

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

Creates a value from an iterator.

impl IntoIterator for Dataset

type Item = Quad

The type of the elements being iterated over.

type IntoIter = IntoIter<Quad>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for Dataset

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

impl StructuralPartialEq for Dataset