Struct NodeMap 

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

Node identifier to node definition map.

Graphs are stored in declaration order so that flattening is deterministic: §4.9 of the JSON-LD API assigns blank node identifiers in document traversal order.

Implementations

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

pub fn new() -> Self

Creates a new NodeMap.

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

Consumes the node map, returning its default graph and named graphs.

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

Returns an iterator over the graphs of the node map: the default graph first, then the named graphs in declaration order.

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

Returns an iterator over the named graphs only, in declaration order.

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

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

Returns the graph of the given name, or the default graph for None, if it is declared.

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

Mutably borrows the graph of the given name, if it is declared.

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

Declares a named graph, leaving it untouched if it already exists.

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

where T: Clone, B: Clone,

Merge all the graphs into a single NodeMapGraph.

Graphs are merged into the default graph in declaration order.

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

pub fn flatten(self, ordered: bool) -> FlattenedDocument<T, B>

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

Flattens this node map into a list of nodes, sorted when ordered is set.

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

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

Flattens this node map into a list of nodes, sorting through the given vocabulary when ordered is set.

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

Flattens this node map into an unordered set of nodes.

Trait Implementations

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

fn default() -> Self

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) -> Self::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) -> Self::IntoIter

Creates an iterator from a value.

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

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

Returns an iterator over the quads of the document.

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

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

Returns the RDF quads of this document, taking every parameter explicitly.

fn rdf_quads_with<'a, V: Vocabulary<Iri = T, BlankId = B>, G: LocalGenerator>( &'a self, vocabulary: &'a mut V, generator: &'a mut G, rdf_direction: Option<RdfDirection>, ) -> Quads<'a, V, G>

Returns the RDF quads of this document, using the given vocabulary.

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

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

Returns the RDF quads of this document.