Struct json_ld_core::object::node::reverse_properties::ReverseProperties

pub struct ReverseProperties<T, B, M>(/* private fields */);

Reverse properties of a node object, and their associated nodes.

Implementations

impl<T, B, M> ReverseProperties<T, B, M>

pub fn len(&self) -> usize

Returns the number of reverse properties.

pub fn is_empty(&self) -> bool

Checks if there are no defined reverse properties.

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

Returns an iterator over the reverse properties and their associated nodes.

pub fn iter_mut(&mut self) -> IterMut<'_, T, B, M>

Returns an iterator over the reverse properties with a mutable reference to their associated nodes.

pub fn clear(&mut self)

Removes all reverse properties.

impl<T: Eq + Hash, B: Eq + Hash, M> ReverseProperties<T, B, M>

pub fn contains<Q: ?Sized + Hash + Equivalent<Id<T, B>>>( &self, prop: &Q ) -> bool

Checks if the given reverse property is associated to any node.

pub fn get<'a, Q: ?Sized + Hash + Equivalent<Id<T, B>>>( &self, prop: &Q ) -> Nodes<'_, T, B, M>

where T: 'a,

Returns an iterator over all the nodes associated to the given reverse property.

pub fn get_any<'a, Q: ?Sized + Hash + Equivalent<Id<T, B>>>( &self, prop: &Q ) -> Option<&IndexedNode<T, B, M>>

where T: 'a,

Get one of the nodes associated to the given reverse property.

If multiple nodes are found, there are no guaranties on which node will be returned.

pub fn insert(&mut self, Meta: Meta<Id<T, B>, M>, value: IndexedNode<T, B, M>)

Associate the given node to the given reverse property.

pub fn insert_unique( &mut self, Meta: Meta<Id<T, B>, M>, value: IndexedNode<T, B, M> )

Associate the given node to the given reverse property, unless it is already.

pub fn insert_all<Objects: IntoIterator<Item = IndexedNode<T, B, M>>>( &mut self, Meta: Meta<Id<T, B>, M>, values: Objects )

Associate all the given nodes to the given reverse property.

pub fn insert_all_unique_stripped<Nodes: IntoIterator<Item = Stripped<IndexedNode<T, B, M>>>>( &mut self, Meta: Meta<Id<T, B>, M>, values: Nodes )

Associate all the given nodes to the given reverse property, unless it is already.

pub fn insert_all_unique<Nodes: IntoIterator<Item = IndexedNode<T, B, M>>>( &mut self, prop: Meta<Id<T, B>, M>, values: Nodes )

Associate all the given nodes to the given reverse property, unless it is already.

pub fn extend_unique<I, N>(&mut self, iter: I)

where I: IntoIterator<Item = (Meta<Id<T, B>, M>, N)>, N: IntoIterator<Item = IndexedNode<T, B, M>>,

pub fn extend_unique_stripped<I, N>(&mut self, iter: I)

where I: IntoIterator<Item = (Meta<Id<T, B>, M>, N)>, N: IntoIterator<Item = Stripped<IndexedNode<T, B, M>>>,

pub fn remove( &mut self, prop: &Id<T, B> ) -> Option<ReversePropertyEntry<T, B, M>>

Removes and returns all the values associated to the given reverse property.

Trait Implementations

impl<T: Clone, B: Clone, M: Clone> Clone for ReverseProperties<T, B, M>

fn clone(&self) -> ReverseProperties<T, B, M>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Eq + Hash, B: Eq + Hash, M> Extend<(Meta<Id<T, B>, M>, Vec<Meta<Indexed<Node<T, B, M>, M>, M>>)> for ReverseProperties<T, B, M>

fn extend<I>(&mut self, iter: I)

where I: IntoIterator<Item = (Meta<Id<T, B>, M>, Vec<IndexedNode<T, B, M>>)>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T: Hash, B: Hash, M: Hash> Hash for ReverseProperties<T, B, M>

fn hash<H: Hasher>(&self, h: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, T, B, M> IntoIterator for &'a ReverseProperties<T, B, M>

type Item = (Meta<&'a Id<T, B>, &'a M>, &'a [Stripped<Meta<Indexed<Node<T, B, M>, M>, 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?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T, B, M> IntoIterator for &'a mut ReverseProperties<T, B, M>

type Item = (Meta<&'a Id<T, B>, &'a mut M>, &'a mut Multiset<Stripped<Meta<Indexed<Node<T, B, M>, M>, M>>>)

The type of the elements being iterated over.

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

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

type Item = (Meta<Id<T, B>, M>, Multiset<Stripped<Meta<Indexed<Node<T, B, M>, M>, M>>>)

The type of the elements being iterated over.

type IntoIter = IntoIter<T, B, M>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, B, M: Clone, N: Vocabulary<Iri = T, BlankId = B>> IntoJsonWithContextMeta<M, N> for ReverseProperties<T, B, M>

fn into_json_meta_with(self, meta: M, vocabulary: &N) -> Meta<Value<M>, M>

impl<T: Eq + Hash, B: Eq + Hash, M> MappedEq for ReverseProperties<T, B, M>

type BlankId = B

fn mapped_eq<'a, 'b, F: Clone + Fn(&'a B) -> &'b B>( &'a self, other: &Self, f: F ) -> bool

where B: 'a + 'b,

Structural equality with mapped blank identifiers.

impl<T, B, M> PartialEq for ReverseProperties<T, B, M>

where T: Eq + Hash, B: Eq + Hash, M: PartialEq,

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T, B, M, N: Vocabulary<Iri = T, BlankId = B>> PrecomputeSizeWithContext<N> for ReverseProperties<T, B, M>

fn contextual_pre_compute_size( &self, vocabulary: &N, options: &Options, sizes: &mut Vec<Size> ) -> Size

impl<T, B, M, N: Vocabulary<Iri = T, BlankId = B>> PrintWithSizeAndContext<N> for ReverseProperties<T, B, M>

fn contextual_fmt_with_size( &self, vocabulary: &N, f: &mut Formatter<'_>, options: &Options, indent: usize, sizes: &[Size], index: &mut usize ) -> Result

impl<T: Hash, B: Hash, M> StrippedHash for ReverseProperties<T, B, M>

fn stripped_hash<H: Hasher>(&self, h: &mut H)

impl<T: Eq + Hash, B: Eq + Hash, M> StrippedPartialEq for ReverseProperties<T, B, M>

fn stripped_eq(&self, other: &Self) -> bool

impl<T: Eq + Hash, B: Eq + Hash, M> TryFromJson<T, B, M> for ReverseProperties<T, B, M>

fn try_from_json_in( vocabulary: &mut impl VocabularyMut<Iri = T, BlankId = B>, Meta: Meta<Value<M>, M> ) -> Result<Meta<Self, M>, Meta<InvalidExpandedJson<M>, M>>

impl<T: Eq + Hash, B: Eq + Hash, M> TryFromJsonObject<T, B, M> for ReverseProperties<T, B, M>

fn try_from_json_object_in( vocabulary: &mut impl VocabularyMut<Iri = T, BlankId = B>, Meta: Meta<Object<M>, M> ) -> Result<Meta<Self, M>, Meta<InvalidExpandedJson<M>, M>>

impl<T, B, M> Eq for ReverseProperties<T, B, M>

where T: Eq + Hash, B: Eq + Hash, M: Eq,

impl<T: Eq + Hash, B: Eq + Hash, M> StrippedEq for ReverseProperties<T, B, M>