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

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<'_, Id<T, B>, Multiset<Indexed<Node<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, B> ReverseProperties<T, B>

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

pub fn contains<Q>(&self, prop: &Q) -> bool

where Q: Hash + Equivalent<Id<T, B>> + ?Sized,

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

pub fn get<'a, Q>(&self, prop: &Q) -> Nodes<'_, T, B>

where Q: Hash + Equivalent<Id<T, B>> + ?Sized, T: 'a,

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

pub fn get_any<'a, Q>(&self, prop: &Q) -> Option<&Indexed<Node<T, B>>>

where Q: Hash + Equivalent<Id<T, B>> + ?Sized, 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: Indexed<Node<T, B>>)

Associate the given node to the given reverse property.

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

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

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

where Objects: IntoIterator<Item = Indexed<Node<T, B>>>,

Associate all the given nodes to the given reverse property.

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

where Nodes: IntoIterator<Item = Indexed<Node<T, B>>>,

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

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

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

where N: IntoIterator<Item = Indexed<Node<T, B>>>,

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

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

Trait Implementations

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

where T: Clone, B: Clone,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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

where T: Debug, B: Debug,

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

Formats the value using the given formatter.

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

fn default() -> ReverseProperties<T, B>

Returns the “default value” for a type.

impl<T, B> Extend<(Id<T, B>, Vec<Indexed<Node<T, B>>>)> for ReverseProperties<T, B>

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

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

where I: IntoIterator<Item = (Id<T, B>, Vec<Indexed<Node<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, B, N> FromIterator<(Id<T, B>, N)> for ReverseProperties<T, B>

where T: Eq + Hash, B: Eq + Hash, N: IntoIterator<Item = Indexed<Node<T, B>>>,

fn from_iter<I>(iter: I) -> ReverseProperties<T, B>

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

Creates a value from an iterator.

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

where T: Hash, B: Hash,

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

where H: Hasher,

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) -> <&'a ReverseProperties<T, B> as IntoIterator>::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, ) -> <&'a mut ReverseProperties<T, B> as IntoIterator>::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) -> <ReverseProperties<T, B> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T, B, N> IntoJsonWithContext<N> for ReverseProperties<T, B>

where N: Vocabulary<Iri = T, BlankId = B>,

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

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

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

type BlankId = B

fn mapped_eq<'a, 'b, F>(&'a self, other: &ReverseProperties<T, B>, f: F) -> bool

where F: Clone + Fn(&'a B) -> &'b B, 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: &ReverseProperties<T, B>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T, B, N> PrecomputeSizeWithContext<N> for ReverseProperties<T, B>

where N: Vocabulary<Iri = T, BlankId = B>,

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

impl<T, B, N> PrintWithSizeAndContext<N> for ReverseProperties<T, B>

where N: Vocabulary<Iri = T, BlankId = B>,

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

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

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

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

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

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

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

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

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