Struct Properties

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

Properties of a node object, and their associated objects.

Implementations

impl<T, B> Properties<T, B>

pub fn new() -> Self

Creates an empty map.

pub fn len(&self) -> usize

Returns the number of properties.

pub fn is_empty(&self) -> bool

Checks if there are no defined properties.

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

Returns an iterator over the properties and their associated objects.

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

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

pub fn clear(&mut self)

Removes all properties.

impl<T: Eq + Hash, B: Eq + Hash> Properties<T, B>

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

Checks if the given property is associated to any object.

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

Returns an iterator over all the objects associated to the given property.

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

Get one of the objects associated to the given property.

If multiple objects are found, there are no guaranties on which object will be returned.

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

Associate the given object to the node through the given property with metadata.

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

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

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

Associate all the given objects to the node through the given property.

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

Associate all the given objects to the node through the given property, unless it is already.

The equivalence operator is used to remove equivalent objects.

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

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

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

pub fn remove<Q: ?Sized + Hash + Equivalent<Id<T, B>>>( &mut self, prop: &Q, ) -> Option<PropertyObjects<T, B>>

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

Trait Implementations

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

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

impl<T, B> Default for Properties<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<Object<T, B>>>)> for Properties<T, B>

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

where I: IntoIterator<Item = (Id<T, B>, Vec<IndexedObject<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, O> FromIterator<(Id<T, B>, O)> for Properties<T, B>

where O: IntoIterator<Item = IndexedObject<T, B>>,

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

Creates a value from an iterator.

impl<T: Hash, B: Hash> Hash for Properties<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 Properties<T, B>

type Item = (&'a Id<T, B>, &'a [Indexed<Object<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 Properties<T, B>

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

The type of the elements being iterated over.

type IntoIter = IterMut<'a, Id<T, B>, Multiset<Indexed<Object<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 Properties<T, B>

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

The type of the elements being iterated over.

type IntoIter = IntoIter<Id<T, B>, Multiset<Indexed<Object<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: Eq + Hash, B: Eq + Hash> MappedEq for Properties<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 Properties<T, B>

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

fn eq(&self, other: &Self) -> 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: Eq + Hash, B: Eq + Hash> TryFromJson<T, B> for Properties<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 Properties<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 Properties<T, B>

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