pub struct UnorderedSetMapper<SA, T>{ /* private fields */ }

Implementations§

source§

impl<SA, T> UnorderedSetMapper<SA, T>

source

pub fn get_index(&self, value: &T) -> usize

source

pub fn get_index_at_address( &self, address: &ManagedAddress<SA>, value: &T ) -> usize

Gets the item’s index at the given address’ mapper. Returns 0 if the item is not in the list.

source

pub fn get_by_index(&self, index: usize) -> T

Get item at index from storage. Index must be valid (1 <= index <= count).

source

pub fn get_by_index_at_address( &self, address: &ManagedAddress<SA>, index: usize ) -> T

Gets the item by index from the given address. Index must be valid (1 <= index <= count).

source

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

source

pub fn is_empty_at_address(&self, address: &ManagedAddress<SA>) -> bool

Returns true if the address’ mapper contains no elements.

source

pub fn len(&self) -> usize

Returns the number of elements in the set.

source

pub fn len_at_address(&self, address: &ManagedAddress<SA>) -> usize

Returns the number of elements contained in the given address’ mapper.

source

pub fn contains(&self, value: &T) -> bool

Returns true if the set contains a value.

source

pub fn contains_at_address( &self, address: &ManagedAddress<SA>, value: &T ) -> bool

Returns true if the mapper at the given address contains the value.

source

pub fn insert(&mut self, value: T) -> bool

Adds a value to the set.

If the set did not have this value present, true is returned.

If the set did have this value present, false is returned.

source

pub fn swap_remove(&mut self, value: &T) -> bool

Removes a value from the set. Returns whether the value was present in the set.

source

pub fn swap_indexes(&mut self, index1: usize, index2: usize) -> bool

Exchanges the indexes of two values. Returns whether the operation was successful.

source

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

An iterator visiting all elements in arbitrary order. The iterator element type is &'a T.

Trait Implementations§

source§

impl<SA, T> Extend<T> for UnorderedSetMapper<SA, T>

source§

fn extend<I>(&mut self, iter: I)
where I: IntoIterator<Item = T>,

Extends a collection with the contents of an iterator. Read more
source§

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)
Extends a collection with exactly one element.
source§

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. Read more
source§

impl<'a, SA, T> IntoIterator for &'a UnorderedSetMapper<SA, T>

§

type Item = T

The type of the elements being iterated over.
§

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

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl<SA, T> StorageClearable for UnorderedSetMapper<SA, T>

source§

fn clear(&mut self)

Clears all the entries owned by the storage.
source§

impl<SA, T> StorageMapper<SA> for UnorderedSetMapper<SA, T>

source§

fn new(base_key: StorageKey<SA>) -> Self

Will be called automatically by the #[storage_mapper] annotation generated code.
source§

impl<SA, T> TopEncodeMulti for UnorderedSetMapper<SA, T>

Behaves like a MultiResultVec when an endpoint result.

source§

fn multi_encode_or_handle_err<O, H>( &self, output: &mut O, h: H ) -> Result<(), H::HandledErr>

Version of top_encode that can handle errors as soon as they occur. For instance in can exit immediately and make sure that if it returns, it is a success. By not deferring error handling, this can lead to somewhat smaller bytecode.
source§

fn multi_encode<O>(&self, output: &mut O) -> Result<(), EncodeError>

Attempt to serialize the value to ouput.
source§

impl<SA, T> TypeAbi for UnorderedSetMapper<SA, T>

Behaves like a MultiResultVec when an endpoint result.

source§

fn type_name() -> TypeName

source§

fn provide_type_descriptions<TDC: TypeDescriptionContainer>( accumulator: &mut TDC )

A type can provide more than its own name. For instance, a struct can also provide the descriptions of the type of its fields. TypeAbi doesn’t care for the exact accumulator type, which is abstracted by the TypeDescriptionContainer trait.
source§

impl<SA, T> CodecFrom<UnorderedSetMapper<SA, T>> for MultiValueEncoded<SA, T>

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<F, I> CodecInto<F> for I
where I: TopEncodeMulti, F: CodecFrom<I>,