pub enum Object<T = IriBuf, B = BlankIdBuf, M = ()> {
Value(Value<T, M>),
Node(Box<Node<T, B, M>>),
List(List<T, B, M>),
}
Expand description
Object.
JSON-LD connects together multiple kinds of data objects. Objects may be nodes, values or lists of objects.
You can get an Object
by expanding a JSON-LD document using the
expansion algorithm or by converting an already expanded JSON document
using TryFromJson
.
Variants§
Value(Value<T, M>)
Value object.
Node(Box<Node<T, B, M>>)
Node object.
List(List<T, B, M>)
List object.
Implementations§
source§impl<T, B, M> Object<T, B, M>
impl<T, B, M> Object<T, B, M>
sourcepub fn id(&self) -> Option<&Meta<Id<T, B>, M>>
pub fn id(&self) -> Option<&Meta<Id<T, B>, M>>
Identifier of the object, if it is a node object.
sourcepub fn identify_all_with<V, G>(&mut self, vocabulary: &mut V, generator: &mut G)where
V: Vocabulary<Iri = T, BlankId = B>,
G: MetaGenerator<V, M>,
M: Clone,
T: Eq + Hash,
B: Eq + Hash,
pub fn identify_all_with<V, G>(&mut self, vocabulary: &mut V, generator: &mut G)where
V: Vocabulary<Iri = T, BlankId = B>,
G: MetaGenerator<V, M>,
M: Clone,
T: Eq + Hash,
B: Eq + Hash,
Assigns an identifier to every node included in this object using the given generator
.
sourcepub fn identify_all<G>(&mut self, generator: &mut G)where
G: MetaGenerator<(), M>,
M: Clone,
T: Eq + Hash,
B: Eq + Hash,
(): Vocabulary<Iri = T, BlankId = B>,
pub fn identify_all<G>(&mut self, generator: &mut G)where
G: MetaGenerator<(), M>,
M: Clone,
T: Eq + Hash,
B: Eq + Hash,
(): Vocabulary<Iri = T, BlankId = B>,
Use the given generator
to assign an identifier to all nodes that
don’t have one.
sourcepub fn canonicalize_with(&mut self, buffer: &mut Buffer)
pub fn canonicalize_with(&mut self, buffer: &mut Buffer)
Puts this object literals into canonical form using the given
buffer
.
The buffer is used to compute the canonical form of numbers.
sourcepub fn canonicalize(&mut self)
pub fn canonicalize(&mut self)
Puts this object literals into canonical form.
sourcepub fn as_iri(&self) -> Option<&T>
pub fn as_iri(&self) -> Option<&T>
Identifier of the object as an IRI.
If the object is a node identified by an IRI, returns this IRI.
Returns None
otherwise.
sourcepub fn as_value_mut(&mut self) -> Option<&mut Value<T, M>>
pub fn as_value_mut(&mut self) -> Option<&mut Value<T, M>>
Returns this object as a mutable value, if it is one.
sourcepub fn into_value(self) -> Option<Value<T, M>>
pub fn into_value(self) -> Option<Value<T, M>>
Converts this object as a value, if it is one.
sourcepub fn as_node_mut(&mut self) -> Option<&mut Node<T, B, M>>
pub fn as_node_mut(&mut self) -> Option<&mut Node<T, B, M>>
Returns this object as a mutable node, if it is one.
sourcepub fn into_node(self) -> Option<Node<T, B, M>>
pub fn into_node(self) -> Option<Node<T, B, M>>
Converts this object into a node, if it is one.
sourcepub fn is_graph(&self) -> bool
pub fn is_graph(&self) -> bool
Tests if the object is a graph object (a node with a @graph
field).
sourcepub fn as_list_mut(&mut self) -> Option<&mut List<T, B, M>>
pub fn as_list_mut(&mut self) -> Option<&mut List<T, B, M>>
Returns this object as a mutable list, if it is one.
sourcepub fn into_list(self) -> Option<List<T, B, M>>
pub fn into_list(self) -> Option<List<T, B, M>>
Converts this object into a list, if it is one.
sourcepub fn as_str(&self) -> Option<&str>
pub fn as_str(&self) -> Option<&str>
Get the object as a string.
If the object is a value that is a string, returns this string.
If the object is a node that is identified, returns the identifier as a string.
Returns None
otherwise.
sourcepub fn language(&self) -> Option<LenientLanguageTag<'_>>
pub fn language(&self) -> Option<LenientLanguageTag<'_>>
If the object is a language-tagged value, Return its associated language.
sourcepub fn traverse(&self) -> Traverse<'_, T, B, M> ⓘ
pub fn traverse(&self) -> Traverse<'_, T, B, M> ⓘ
Returns an iterator over all fragments of this object, including the object itself.
Fragments include:
- objects
- key-value pairs,
- keys
- values
sourcepub fn equivalent(&self, other: &Object<T, B, M>) -> bool
pub fn equivalent(&self, other: &Object<T, B, M>) -> bool
Equivalence operator.
Equivalence is different from equality for anonymous objects: List objects and anonymous node objects have an implicit unlabeled blank nodes and thus never equivalent.
Trait Implementations§
source§impl<T, B, M> Any<T, B, M> for Object<T, B, M>
impl<T, B, M> Any<T, B, M> for Object<T, B, M>
fn as_ref(&self) -> Ref<'_, T, B, M>
fn id_entry<'a>(&'a self) -> Option<&'a Entry<Id<T, B>, M>>where
M: 'a,
fn id<'a>(&'a self) -> Option<&'a Meta<Id<T, B>, M>>where
M: 'a,
fn language<'a>(&'a self) -> Option<LenientLanguageTag<'a>>where
T: 'a,
B: 'a,
M: 'a,
fn is_value(&self) -> bool
fn is_node(&self) -> bool
fn is_graph(&self) -> bool
fn is_list(&self) -> bool
source§impl<T, B, M, N> IntoJsonWithContextMeta<M, N> for Object<T, B, M>where
M: Clone,
N: Vocabulary<Iri = T, BlankId = B>,
impl<T, B, M, N> IntoJsonWithContextMeta<M, N> for Object<T, B, M>where
M: Clone,
N: Vocabulary<Iri = T, BlankId = B>,
source§impl<T, B, M> PartialEq for Object<T, B, M>
impl<T, B, M> PartialEq for Object<T, B, M>
source§impl<T, B, M> StrippedHash for Object<T, B, M>
impl<T, B, M> StrippedHash for Object<T, B, M>
fn stripped_hash<H>(&self, state: &mut H)where
H: Hasher,
source§impl<T, B, M> StrippedPartialEq for Object<T, B, M>
impl<T, B, M> StrippedPartialEq for Object<T, B, M>
fn stripped_eq(&self, other: &Object<T, B, M>) -> bool
source§impl<T, B, M> TryFromJson<T, B, M> for Object<T, B, M>
impl<T, B, M> TryFromJson<T, B, M> for Object<T, B, M>
fn try_from_json_in( vocabulary: &mut impl VocabularyMut<Iri = T, BlankId = B>, _: Meta<Value<M>, M> ) -> Result<Meta<Object<T, B, M>, M>, Meta<InvalidExpandedJson<M>, M>>
source§impl<T, B, M> TryFromJsonObject<T, B, M> for Object<T, B, M>
impl<T, B, M> TryFromJsonObject<T, B, M> for Object<T, B, M>
fn try_from_json_object_in( vocabulary: &mut impl VocabularyMut<Iri = T, BlankId = B>, _: Meta<Object<M>, M> ) -> Result<Meta<Object<T, B, M>, M>, Meta<InvalidExpandedJson<M>, M>>
impl<T, B, M> Eq for Object<T, B, M>
impl<T, B, M> StrippedEq for Object<T, B, M>
Auto Trait Implementations§
impl<T, B, M> RefUnwindSafe for Object<T, B, M>
impl<T, B, M> Send for Object<T, B, M>
impl<T, B, M> Sync for Object<T, B, M>
impl<T, B, M> Unpin for Object<T, B, M>
impl<T, B, M> UnwindSafe for Object<T, B, M>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
§impl<T> CallHasher for T
impl<T> CallHasher for T
source§impl<I, B, M, T> CompactIndexedFragment<I, B, M> for Twhere
T: Any<I, B, M>,
impl<I, B, M, T> CompactIndexedFragment<I, B, M> for Twhere
T: Any<I, B, M>,
fn compact_indexed_fragment<N, C, L, 'a>( &'a self, vocabulary: &'a mut N, meta: &'a M, index: Option<&'a Entry<String, M>>, active_context: &'a Context<I, B, C, M>, type_scoped_context: &'a Context<I, B, C, M>, active_property: Option<Meta<&'a str, &'a M>>, loader: &'a mut L, options: Options ) -> Pin<Box<dyn Future<Output = Result<Meta<Value<M>, M>, Meta<Error<<L as ContextLoader<I, M>>::ContextError>, M>>> + Send + 'a>>
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.