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 is_empty(&self) -> bool

Returns true if the set contains no elements.

source

pub fn len(&self) -> usize

Returns the number of elements in the set.

source

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

Returns true if the set contains a 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 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> EndpointResult for UnorderedSetMapper<SA, T>

Behaves like a MultiResultVec when an endpoint result.

§

type DecodeAs = MultiArgVec<<T as EndpointResult>::DecodeAs>

Indicates how the result of the endpoint can be interpreted when called via proxy. Self for most types.
source§

fn finish<FA>(&self)

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

Auto Trait Implementations§

§

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

§

impl<SA, T> Send for UnorderedSetMapper<SA, T>
where SA: Send, T: Send,

§

impl<SA, T> Sync for UnorderedSetMapper<SA, T>
where SA: Sync, T: Sync,

§

impl<SA, T> Unpin for UnorderedSetMapper<SA, T>
where SA: Unpin, T: Unpin,

§

impl<SA, T> UnwindSafe for UnorderedSetMapper<SA, T>
where SA: UnwindSafe, T: UnwindSafe,

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.