Struct rdftk_memgraph::MemGraph [−][src]
pub struct MemGraph { /* fields omitted */ }
A very simple in-memory implementation of the Graph
and NamedGraph
traits.
Implementations
impl MemGraph
[src]
pub fn with(&mut self, statements: StatementList) -> &mut Self
[src]
pub fn mappings(&mut self, mappings: Rc<dyn PrefixMappings>) -> &mut Self
[src]
Trait Implementations
impl Clone for MemGraph
[src]
impl DataSet<MemGraph> for MemDataSet
[src]
fn has_default_graph(&self) -> bool
[src]
fn default_graph(&self) -> &Option<MemGraph>
[src]
fn has_graph_named(&self, name: &GraphName) -> bool
[src]
fn graph_named(&self, name: &GraphName) -> Option<&MemGraph>
[src]
fn graphs(&self) -> Vec<(&GraphName, &MemGraph)>
[src]
fn all_prefix_mappings(&self) -> Rc<dyn PrefixMappings>
[src]
impl Debug for MemGraph
[src]
impl Default for MemGraph
[src]
impl From<MemGraph> for MemDataSet
[src]
impl From<Vec<Rc<Statement>, Global>> for MemGraph
[src]
fn from(sts: StatementList) -> Self
[src]
impl From<Vec<Statement, Global>> for MemGraph
[src]
impl Graph for MemGraph
[src]
fn is_empty(&self) -> bool
[src]
fn len(&self) -> usize
[src]
fn contains_subject(&self, subject: &SubjectNode) -> bool
[src]
fn contains_individual(&self, subject: &IRIRef) -> bool
[src]
fn contains(&self, statement: &Statement) -> bool
[src]
fn contains_all(
&self,
subject: &SubjectNode,
predicate: &IRIRef,
object: &ObjectNode
) -> bool
[src]
&self,
subject: &SubjectNode,
predicate: &IRIRef,
object: &ObjectNode
) -> bool
fn statements(&self) -> StatementList
[src]
fn statements_for(&self, subject: &SubjectNode) -> StatementList
[src]
fn subjects(&self) -> HashSet<&SubjectNode>
[src]
fn predicates(&self) -> HashSet<&IRIRef>
[src]
fn predicates_for(&self, subject: &SubjectNode) -> HashSet<&IRIRef>
[src]
fn objects(&self) -> HashSet<&ObjectNode>
[src]
fn objects_for(
&self,
subject: &SubjectNode,
predicate: &IRIRef
) -> HashSet<&ObjectNode>
[src]
&self,
subject: &SubjectNode,
predicate: &IRIRef
) -> HashSet<&ObjectNode>
fn resource_for(&self, subject: &SubjectNode) -> Resource
[src]
fn prefix_mappings(&self) -> Rc<dyn PrefixMappings>
[src]
impl MutableDataSet<MemGraph> for MemDataSet
[src]
fn set_default_graph(&mut self, graph: MemGraph)
[src]
fn unset_default_graph(&mut self)
[src]
fn insert_graph(&mut self, name: GraphName, graph: MemGraph)
[src]
fn remove_graph(&mut self, name: &GraphName)
[src]
impl MutableGraph for MemGraph
[src]
Auto Trait Implementations
impl !RefUnwindSafe for MemGraph
impl !Send for MemGraph
impl !Sync for MemGraph
impl Unpin for MemGraph
impl !UnwindSafe for MemGraph
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,