Struct rdftk_core::simple::indexed::IndexedSimpleGraph

pub struct IndexedSimpleGraph { /* fields omitted */ }

Simple, in-memory implementation of the Graph trait.

Trait Implementations

impl Clone for IndexedSimpleGraph

fn clone(&self) -> IndexedSimpleGraph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for IndexedSimpleGraph

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

Formats the value using the given formatter.

impl Featured for IndexedSimpleGraph

fn supports_feature(&self, feature: &IRIRef) -> bool

Return true if this instance, or factory, supports the feature identified by the IRI.

impl Graph for IndexedSimpleGraph

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 matches(
    &self,
    subject: Option<&SubjectNodeRef>,
    predicate: Option<&IRIRef>,
    object: Option<&ObjectNodeRef>
) -> HashSet<&StatementRef>

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

fn statements<'a>(&'a self) -> Box<dyn Iterator<Item = &'a StatementRef> + 'a>

Return an iterator over all the statements in the graph.

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 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 prefix_mappings(&self) -> PrefixMappingRef

Returns the set of prefix mappings held by the graph.

fn set_prefix_mappings(&mut self, mappings: PrefixMappingRef)

Set the prefix mappings held by the graph.

fn factory(&self) -> GraphFactoryRef

Return the factory that creates graphs using the same provider as self.

fn statement_factory(&self) -> StatementFactoryRef

Return the factory that creates statements using the same provider as self.

fn literal_factory(&self) -> LiteralFactoryRef

Return the factory that creates literals using the same provider as self.

fn statements_mut<'a>(
    &'a mut self
) -> Box<dyn Iterator<Item = &'a mut StatementRef> + 'a>

Return an iterator over all the statements in the graph.

fn insert(&mut self, statement: StatementRef)

Insert a new statement into the graph.

fn merge(&mut self, other: &Self) where
    Self: Sized, 

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.

fn dedup(&mut self) -> StatementList

Remove any duplicates within the graph, replacing any number of identical statements with just one. This will return a list of all statements removed.

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) -> StatementList

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

fn clear(&mut self)

Remove all statements from this graph.

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.