Struct json_ld::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() -> NodeMap<T, B, M>

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

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

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

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

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<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, B, M> NodeMap<T, B, M>where
    T: Clone + Eq + Hash,
    B: Clone + Eq + Hash,
    M: Clone,

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

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

pub fn flatten_unordered(
    self
) -> HashSet<Stripped<Meta<Indexed<Node<T, B, M>, M>, M>>, RandomState>

Trait Implementations

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

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

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) -> <&'a NodeMap<T, B, M> as IntoIterator>::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) -> <NodeMap<T, B, M> as IntoIterator>::IntoIter

Creates an iterator from a value.

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

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

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

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

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