Struct json_ld_core::flattening::NodeMap

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

Node identifier to node definition map.

Implementations

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

pub fn new() -> Self

pub fn into_parts(self) -> Parts<T, B, M>

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

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

impl<T: Eq + Hash, B: Eq + Hash, M> NodeMap<T, B, M>

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

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

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

pub fn merge(self) -> NodeMapGraph<T, B, M>where T: Clone, B: Clone, M: Clone,

Merge all the graphs into a single NodeMapGraph.

The order in which graphs are merged is not defined.

impl<T: Clone + Eq + Hash, B: Clone + Eq + Hash, M: Clone> NodeMap<T, B, M>

pub fn flatten(self, ordered: bool) -> Vec<IndexedNode<T, B, M>>where (): Vocabulary<Iri = T, BlankId = B>,

pub fn flatten_with<V>( self, vocabulary: &V, ordered: bool ) -> Vec<IndexedNode<T, B, M>>where V: Vocabulary<Iri = T, BlankId = B>,

pub fn flatten_unordered(self) -> HashSet<StrippedIndexedNode<T, B, M>>

Trait Implementations

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

fn default() -> Self

Returns the “default value” for a type.

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

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

The type of the elements being iterated over.

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

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

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

The type of the elements being iterated over.

type IntoIter = IntoIter<T, B, M>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Eq + Hash, B: Eq + Hash, M> LdQuads<T, B, M> for NodeMap<T, B, M>

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

impl<T: Eq + Hash, B: Eq + Hash, M> RdfQuads<T, B, M> for NodeMap<T, B, M>

fn rdf_quads_full<'n, 'g, V: Vocabulary<Iri = T, BlankId = B>, G: Generator<V, M>>( &self, vocabulary: &'n mut V, generator: &'g mut G, rdf_direction: Option<RdfDirection>, produce_generalized_rdf: bool ) -> Quads<'_, 'n, 'g, V, M, G>

fn rdf_quads_with<'n, 'g, V: Vocabulary<Iri = T, BlankId = B>, G: Generator<V, M>>( &self, vocabulary: &'n mut V, generator: &'g mut G, rdf_direction: Option<RdfDirection> ) -> Quads<'_, 'n, 'g, V, M, G>