Struct rdftk_memgraph::MemGraph

pub struct MemGraph { /* fields omitted */ }

A very simple in-memory implementation of the Graph and NamedGraph traits.

Implementations

impl<'a> MemGraph

pub fn with(&mut self, statements: StatementList) -> &mut Self

Construct a new MemGraph from the list of statements.

pub fn mappings(&mut self, mappings: Rc<dyn PrefixMappings>) -> &mut Self

Construct a new empty MemGraph with the provided mappings.

Trait Implementations

impl Clone for MemGraph

fn clone(&self) -> MemGraph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a> DataSet<'a, MemGraph> for MemDataSet

type GraphIter = Iter<'a, GraphNameRef, MemGraph>

The type used to return an iterator over the graph name/graph pairs in this data set.

fn is_empty(&self) -> bool

Returns true if there are no graphs in this data set, else false.

fn len(&self) -> usize

Return the number of graphs in this data set.

fn has_default_graph(&self) -> bool

Return true if this data set has a default graph, else false.

fn default_graph(&self) -> &Option<MemGraph>

Return the default graph for this data set, if it exists.

fn has_graph_named(&self, name: &GraphNameRef) -> bool

Return true if this data set has a graph with the provided name, else false.

fn graph_named(&self, name: &GraphNameRef) -> Option<&MemGraph>

Return the graph with the provided name from this data set, if it exists.

fn graphs(&'a self) -> Self::GraphIter

Return an iterator over graph name/graph pairs.

fn has_index(&self, _: &DataSetIndex) -> bool

Returns true if this data set has an index of the specified kind, else false.

fn has_indices(&self, indices: &[DataSetIndex]) -> bool

Returns true if this data set has *all the specified index kinds, else false.

impl Debug for MemGraph

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

Formats the value using the given formatter.

impl Default for MemGraph

fn default() -> Self

Returns the “default value” for a type.

impl From<MemGraph> for MemDataSet

fn from(v: MemGraph) -> Self

Performs the conversion.

impl From<Vec<Rc<Statement>, Global>> for MemGraph

fn from(sts: StatementList) -> Self

Performs the conversion.

impl From<Vec<Statement, Global>> for MemGraph

fn from(sts: Vec<Statement>) -> Self

Performs the conversion.

impl<'a> Graph<'a> for MemGraph

type StatementIter = Iter<'a, StatementRef>

The type used to return an iterator over the statements in this graph.

type FilteredIter = Filter<Iter<'a, StatementRef>, fn(_: &&StatementRef) -> bool>

The type used to return an filtered iterator over the statements in this graph.

fn is_empty(&self) -> bool

Returns true if there are no statements in this graph, else false.

fn len(&self) -> usize

Return the number of statements in this graph.

fn contains_subject(&self, subject: &SubjectNodeRef) -> bool

Returns true if this graph contains any statement with the provided subject, else false.

fn contains_individual(&self, subject: &IRIRef) -> bool

Returns true if this graph contains any statement with the provided IRI as subject, else false.

fn contains(&self, statement: &StatementRef) -> bool

Returns true if this graph contains the provided statement, else false.

fn contains_all(
    &self,
    subject: &SubjectNodeRef,
    predicate: &IRIRef,
    object: &ObjectNodeRef
) -> bool

Returns true if this graph contains the any statement with the provided subject, predicate, and object, else false.

fn statements(&'a self) -> Self::StatementIter

Return an iterator over all the statements in the graph.

fn filter(&'a self, filter: fn(_: &&StatementRef) -> bool) -> Self::FilteredIter

Return an iterator over the statements in the graph that match the provided predicate.

fn subjects(&self) -> HashSet<&SubjectNodeRef>

Return a set of all subjects in the graph, note that this is a set so that it removes duplicates.

fn predicates(&self) -> HashSet<&IRIRef>

Return a set of all predicate in the graph, note that this is a set so that it removes duplicates.

fn predicates_for(&self, subject: &SubjectNodeRef) -> HashSet<&IRIRef>

Return a set of all predicate referenced by the provided subject in the graph, note that this is a set so that it removes duplicates.

fn objects(&self) -> HashSet<&ObjectNodeRef>

Return a set of all objects in the graph, note that this is a set so that it removes duplicates.

fn objects_for(
    &self,
    subject: &SubjectNodeRef,
    predicate: &IRIRef
) -> HashSet<&ObjectNodeRef>

Return a set of all objects referenced by the provided subject and predicate in the graph, note that this is a set so that it removes duplicates.

fn has_index(&self, _: &GraphIndex) -> bool

Returns true if this graph has an index of the specified kind, else false.

fn prefix_mappings(&self) -> Rc<dyn PrefixMappings>

Returns the set of prefix mappings held by the graph.

fn has_indices(&self, indices: &[GraphIndex]) -> bool

Returns true if this graph has *all the specified index kinds, else false.

fn value_factory(&self) -> Option<Rc<dyn ValueFactory + 'static>>

Returns the value factory that is associated with this graph, if present.

impl<'a> MutableDataSet<'a, MemGraph> for MemDataSet

fn set_default_graph(&mut self, graph: MemGraph)

Set the provided graph as the default, unnamed graph, for this data set. Only one graph may be the default.

fn unset_default_graph(&mut self)

Remove any graph that may be set as the current default. This operation has no effect if no default graph is present.

fn insert(&mut self, name: GraphNameRef, graph: MemGraph)

Insert a new graph with it’s associated name into the data set.

fn remove(&mut self, name: &GraphNameRef)

Remove the graph with the provided name from this data set. This operation has no effect if no such graph is present.

fn clear(&mut self)

Remove all graphs from this data set.

impl<'a> MutableGraph<'a> for MemGraph

fn insert(&mut self, statement: StatementRef)

Insert a new statement into the graph.

fn merge(
    &mut self,
    other: &'a Rc<dyn Graph<'a, StatementIter = Self::StatementIter, FilteredIter = Self::FilteredIter>>
)

Merge another graph into this one. Note that the graphs are required to have the same implementation type based in the type qualifiers for StatementIter and FilteredIter.

fn dedup(&mut self)

Remove any duplicates within the graph, replacing any number of identical statements with just one.

fn remove(&mut self, statement: &StatementRef)

Remove any statement that matches the provided. If a graph has duplicates this method does not differentiate between them.

fn remove_all_for(&mut self, subject: &SubjectNodeRef)

Remove all statements from this graph that have the provided subject.

fn clear(&mut self)

Remove all statements from this graph.