Type Alias json_ld_core::FlattenedDocument

source ·
pub type FlattenedDocument<T, B> = Vec<IndexedNode<T, B>>;
Expand description

Result of the document flattening algorithm.

It is just an alias for a set of (indexed) nodes.

Aliased Type§

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

Trait Implementations§

source§

impl<T, B> IdentifyAll<T, B> for FlattenedDocument<T, B>

source§

fn identify_all_with<V: Vocabulary<Iri = T, BlankId = B>, G: Generator<V>>( &mut self, vocabulary: &mut V, generator: &mut G, )
where T: Eq + Hash, B: Eq + Hash,

source§

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

source§

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

source§

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

source§

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

source§

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

source§

impl<T, B> Relabel<T, B> for FlattenedDocument<T, B>

source§

fn relabel_with<N: Vocabulary<Iri = T, BlankId = B>, G: Generator<N>>( &mut self, vocabulary: &mut N, generator: &mut G, relabeling: &mut HashMap<B, Subject<T, B>>, )
where T: Clone + Eq + Hash, B: Clone + Eq + Hash,