Type Alias FlattenedDocument 

pub type FlattenedDocument<T, B> = Vec<IndexedNode<T, B>>;

Result of the document flattening algorithm.

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

Aliased Type

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

Trait Implementations

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

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,

fn identify_all<G: Generator>(&mut self, generator: &mut G)

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

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

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

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

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

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

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

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

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

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,

fn relabel<G: Generator>( &mut self, generator: &mut G, relabeling: &mut HashMap<B, ValidId<T, B>>, )

where T: Clone + Eq + Hash, B: Clone + Eq + Hash, (): Vocabulary<Iri = T, BlankId = B>,