Struct json_ld::NodeMap

source · [−]

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

Implementations

source

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

source

pub fn new() -> NodeMap<T, B, M>

source

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

source

pub fn iter(&self) -> Iter<'_, T, B, M>ⓘNotable traits for Iter<'a, T, B, M>`impl<'a, T, B, M> Iterator for Iter<'a, T, B, M> type Item = (Option<Meta<&'a Id<T, B>, &'a M>>, &'a NodeMapGraph<T, B, M>);`

source

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

source

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

source

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.

source

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

source

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

source

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

source

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

Trait Implementations

source

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

source

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

Returns the “default value” for a type. Read more

source

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?

source

fn into_iter(self) -> <&'a NodeMap<T, B, M> as IntoIterator>::IntoIter

Creates an iterator from a value. Read more

source

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?

source

fn into_iter(self) -> <NodeMap<T, B, M> as IntoIterator>::IntoIter

Creates an iterator from a value. Read more

source

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

source

fn quads(&self) -> Quads<'_, T, B, M>ⓘNotable traits for Quads<'a, T, B, M>`impl<'a, T, B, M> Iterator for Quads<'a, T, B, M> type Item = QuadRef<'a, T, B, M>;`

source

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

source

fn rdf_quads_with<N, G>(
 &self,
 vocabulary: &'n mut N,
 generator: &'g mut G,
 rdf_direction: Option<RdfDirection>
) -> Quads<'_, 'n, 'g, T, B, N, M, G>ⓘNotable traits for Quads<'a, 'n, 'g, T, B, N, M, G>`impl<'a, 'n, 'g, T, B, N, M, G> Iterator for Quads<'a, 'n, 'g, T, B, N, M, G>where T: Clone, B: Clone, N: IriVocabularyMut<Iri = T>, G: MetaGenerator<T, B, N, M>, type Item = Quad<Cow<'a, Subject<T, B>>, Cow<'a, Subject<T, B>>, Value<T, B>, &'a Subject<T, B>>;`where
 G: MetaGenerator<T, B, N, M>,

source

fn rdf_quads<G>(
 &self,
 generator: &'g mut G,
 rdf_direction: Option<RdfDirection>
) -> Quads<'_, 'static, 'g, T, B, (), M, G>ⓘNotable traits for Quads<'a, 'n, 'g, T, B, N, M, G>`impl<'a, 'n, 'g, T, B, N, M, G> Iterator for Quads<'a, 'n, 'g, T, B, N, M, G>where T: Clone, B: Clone, N: IriVocabularyMut<Iri = T>, G: MetaGenerator<T, B, N, M>, type Item = Quad<Cow<'a, Subject<T, B>>, Cow<'a, Subject<T, B>>, Value<T, B>, &'a Subject<T, B>>;`where
 G: MetaGenerator<T, B, (), M>,

Auto Trait Implementations

impl<T, B, M> RefUnwindSafe for NodeMap<T, B, M>where
 B: RefUnwindSafe,
 M: RefUnwindSafe,
 T: RefUnwindSafe,

impl<T, B, M> Send for NodeMap<T, B, M>where
 B: Send,
 M: Send,
 T: Send,

impl<T, B, M> Sync for NodeMap<T, B, M>where
 B: Sync,
 M: Sync,
 T: Sync,

impl<T, B, M> Unpin for NodeMap<T, B, M>where
 B: Unpin,
 M: Unpin,
 T: Unpin,

impl<T, B, M> UnwindSafe for NodeMap<T, B, M>where
 B: UnwindSafe,
 M: UnwindSafe,
 T: UnwindSafe,

Blanket Implementations

source

impl<T> Any for Twhere
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> At for T

source

fn at<M>(self, metadata: M) -> Meta<T, M>

Wraps self inside a Meta<Self, M> using the given metadata. Read more

source

impl<T> Borrow<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> BorrowStripped for T

source

fn stripped(&self) -> &Stripped<T>

source

impl<T> BorrowUnordered for T

source

fn unordered(&self) -> &Unordered<T>

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for Twhere
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T, B> IntoId<T, B> for T

type Id = Id<T, B>

The target type of the conversion, which can be borrowed as a Id<T, B>.

source

fn to_ref(self) -> <T as IntoId<T, B>>::Id

Convert the value into a reference.

impl<T> ToOwned for T

type Owned = T

source

impl<T, U> TryFrom for Twhere
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for Twhere
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

impl<T> WithContext for Twhere
T: ?Sized,

source

fn with<C>(&self, context: C) -> Contextual<&T, C>

source

Struct json_ld::NodeMap

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>ⓘNotable traits for Iter<'a, T, B, M>impl<'a, T, B, M> Iterator for Iter<'a, T, B, M> type Item = (Option<Meta<&'a Id<T, B>, &'a M>>, &'a NodeMapGraph<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,

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<N>( self, vocabulary: &N, ordered: bool) -> Vec<Meta<Indexed<Node<T, B, M>, M>, M>, Global>where N: 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>

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>)

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

fn into_iter(self) -> <&'a NodeMap<T, B, M> as IntoIterator>::IntoIter

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

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

type IntoIter = IntoIter<T, B, M>

fn into_iter(self) -> <NodeMap<T, B, M> as IntoIterator>::IntoIter

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>ⓘNotable traits for Quads<'a, T, B, M>impl<'a, T, B, M> Iterator for Quads<'a, T, B, M> type Item = QuadRef<'a, T, B, M>;

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

Auto Trait Implementations

impl<T, B, M> RefUnwindSafe for NodeMap<T, B, M>where B: RefUnwindSafe, M: RefUnwindSafe, T: RefUnwindSafe,

impl<T, B, M> Send for NodeMap<T, B, M>where B: Send, M: Send, T: Send,

impl<T, B, M> Sync for NodeMap<T, B, M>where B: Sync, M: Sync, T: Sync,

impl<T, B, M> Unpin for NodeMap<T, B, M>where B: Unpin, M: Unpin, T: Unpin,

impl<T, B, M> UnwindSafe for NodeMap<T, B, M>where B: UnwindSafe, M: UnwindSafe, T: UnwindSafe,

Blanket Implementations

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> At for T

fn at<M>(self, metadata: M) -> Meta<T, M>

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> BorrowStripped for T

fn stripped(&self) -> &Stripped<T>

impl<T> BorrowUnordered for T

fn unordered(&self) -> &Unordered<T>

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T, B> IntoId<T, B> for T

type Id = Id<T, B>

fn to_ref(self) -> <T as IntoId<T, B>>::Id

impl<T> ToOwned for T

type Owned = T

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<T> WithContext for Twhere T: ?Sized,

fn with<C>(&self, context: C) -> Contextual<&T, C>

fn into_with<C>(self, context: C) -> Contextual<T, C>

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>ⓘNotable traits for Iter<'a, T, B, M>`impl<'a, T, B, M> Iterator for Iter<'a, T, B, M> type Item = (Option<Meta<&'a Id<T, B>, &'a M>>, &'a NodeMapGraph<T, B, M>);`

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

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

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

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<N>(
self,
vocabulary: &N,
ordered: bool
) -> Vec<Meta<Indexed<Node<T, B, M>, M>, M>, Global>where
N: Vocabulary<Iri = T, BlankId = B>,

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

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>ⓘNotable traits for Quads<'a, T, B, M>`impl<'a, T, B, M> Iterator for Quads<'a, T, B, M> type Item = QuadRef<'a, T, B, M>;`

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

impl<T, B, M> RefUnwindSafe for NodeMap<T, B, M>where
B: RefUnwindSafe,
M: RefUnwindSafe,
T: RefUnwindSafe,

impl<T, B, M> Send for NodeMap<T, B, M>where
B: Send,
M: Send,
T: Send,

impl<T, B, M> Sync for NodeMap<T, B, M>where
B: Sync,
M: Sync,
T: Sync,

impl<T, B, M> Unpin for NodeMap<T, B, M>where
B: Unpin,
M: Unpin,
T: Unpin,

impl<T, B, M> UnwindSafe for NodeMap<T, B, M>where
B: UnwindSafe,
M: UnwindSafe,
T: UnwindSafe,

impl<T> Any for Twhere
T: 'static + ?Sized,

impl<T> Borrow<T> for Twhere
T: ?Sized,

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

impl<T, U> Into<U> for Twhere
U: From<T>,

impl<T, U> TryFrom<U> for Twhere
U: Into<T>,

impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,

impl<T> WithContext for Twhere
T: ?Sized,