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

pub struct ReverseProperties<T = IriBuf, B = BlankIdBuf>(/* private fields */);

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

Implementations

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

pub fn new() -> Self

Creates an empty map.

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>

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

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

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> ReverseProperties<T, B>

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>

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

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, prop: Id<T, B>, value: IndexedNode<T, B>)

Associate the given node to the given reverse property.

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

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

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

Associate all the given nodes to the given reverse property.

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

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

pub fn set(&mut self, prop: Id<T, B>, values: ReversePropertyNodes<T, B>)

pub fn extend_unique<N>( &mut self, iter: impl IntoIterator<Item = (Id<T, B>, N)>, )

where N: IntoIterator<Item = IndexedNode<T, B>>,

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

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

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug, B: Debug> Debug for ReverseProperties<T, B>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T, B> Default for ReverseProperties<T, B>

fn default() -> Self

Returns the “default value” for a type.

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

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

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

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: Eq + Hash, B: Eq + Hash, N> FromIterator<(Id<T, B>, N)> for ReverseProperties<T, B>

where N: IntoIterator<Item = IndexedNode<T, B>>,

fn from_iter<I: IntoIterator<Item = (Id<T, B>, N)>>(iter: I) -> Self

Creates a value from an iterator.

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

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> IntoIterator for &'a ReverseProperties<T, B>

type Item = (&'a Id<T, B>, &'a [Indexed<Node<T, B>>])

The type of the elements being iterated over.

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

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> IntoIterator for &'a mut ReverseProperties<T, B>

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

The type of the elements being iterated over.

type IntoIter = IterMut<'a, Id<T, B>, Multiset<Indexed<Node<T, B>>>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

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

The type of the elements being iterated over.

type IntoIter = IntoIter<Id<T, B>, Multiset<Indexed<Node<T, B>>>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

fn into_json_with(self, vocabulary: &N) -> Value

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

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> PartialEq for ReverseProperties<T, B>

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

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, N: Vocabulary<Iri = T, BlankId = B>> PrecomputeSizeWithContext<N> for ReverseProperties<T, B>

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

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

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

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

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

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

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

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

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