Struct NodeMap

pub struct NodeMap<T, B> { /* private fields */ }

Node identifier to node definition map.

Implementations

impl<T, B> NodeMap<T, B>

pub fn new() -> NodeMap<T, B>

pub fn into_parts( self, ) -> (NodeMapGraph<T, B>, HashMap<Id<T, B>, NodeMapGraph<T, B>>)

pub fn iter(&self) -> Iter<'_, T, B>

pub fn iter_named(&self) -> Iter<'_, Id<T, B>, NodeMapGraph<T, B>>

impl<T, B> NodeMap<T, B>

where T: Eq + Hash, B: Eq + Hash,

pub fn graph(&self, id: Option<&Id<T, B>>) -> Option<&NodeMapGraph<T, B>>

pub fn graph_mut( &mut self, id: Option<&Id<T, B>>, ) -> Option<&mut NodeMapGraph<T, B>>

pub fn declare_graph(&mut self, id: Id<T, B>)

pub fn merge(self) -> NodeMapGraph<T, B>

where T: Clone, B: Clone,

Merge all the graphs into a single NodeMapGraph.

The order in which graphs are merged is not defined.

impl<T, B> NodeMap<T, B>

where T: Clone + Eq + Hash, B: Clone + Eq + Hash,

pub fn flatten(self, ordered: bool) -> Vec<Indexed<Node<T, B>>>

where (): Vocabulary<Iri = T, BlankId = B>,

pub fn flatten_with<V>( self, vocabulary: &V, ordered: bool, ) -> Vec<Indexed<Node<T, B>>>

where V: Vocabulary<Iri = T, BlankId = B>,

pub fn flatten_unordered(self) -> HashSet<Indexed<Node<T, B>>>

Trait Implementations

impl<T, B> Default for NodeMap<T, B>

fn default() -> NodeMap<T, B>

Returns the “default value” for a type.

impl<'a, T, B> IntoIterator for &'a NodeMap<T, B>

type Item = (Option<&'a Id<T, B>>, &'a NodeMapGraph<T, B>)

The type of the elements being iterated over.

type IntoIter = Iter<'a, T, B>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a NodeMap<T, B> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T, B> IntoIterator for NodeMap<T, B>

type Item = (Option<Id<T, B>>, NodeMapGraph<T, B>)

The type of the elements being iterated over.

type IntoIter = IntoIter<T, B>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <NodeMap<T, B> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T, B> LdQuads<T, B> for NodeMap<T, B>

where T: Eq + Hash, B: Eq + Hash,

fn quads(&self) -> Quads<'_, T, B>

impl<T, B> RdfQuads<T, B> for NodeMap<T, B>

where T: Eq + Hash, B: Eq + Hash,

fn rdf_quads_full<'a, V, G>( &'a self, vocabulary: &'a mut V, generator: &'a mut G, rdf_direction: Option<RdfDirection>, produce_generalized_rdf: bool, ) -> Quads<'a, V, G>

where V: Vocabulary<Iri = T, BlankId = B>, G: Generator<V>,

fn rdf_quads_with<'a, V, G>( &'a self, vocabulary: &'a mut V, generator: &'a mut G, rdf_direction: Option<RdfDirection>, ) -> Quads<'a, V, G>

where V: Vocabulary<Iri = T, BlankId = B>, G: Generator<V>,

fn rdf_quads<'a, G>( &'a self, generator: &'a mut G, rdf_direction: Option<RdfDirection>, ) -> Quads<'a, (), G>

where G: Generator, (): Vocabulary<Iri = T, BlankId = B>,