pub struct VecMapper<SA, T>
where SA: StorageMapperApi, T: TopEncode + TopDecode + 'static,
{ /* private fields */ }
Expand description

Manages a list of items of the same type. Saves each of the items under a separate key in storage. To produce each individual key, it concatenates the main key with a serialized 4-byte index. Indexes start from 1, instead of 0. (We avoid 0-value indexes to prevent confusion between an uninitialized variable and zero.) It also stores the count separately, at what would be index 0. The count is always kept in sync automatically.

Implementations§

source§

impl<SA, T> VecMapper<SA, T>

source

pub fn len(&self) -> usize

Number of items managed by the mapper.

source

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

Number of items in the mapper at the given address.

source

pub fn is_empty(&self) -> bool

True if no items present in the mapper.

source

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

source

pub fn push(&mut self, item: &T) -> usize

Add one item at the end of the list. Returns the index of the newly inserted item, which is also equal to the new number of elements.

source

pub fn extend_from_slice(&mut self, items: &[T]) -> usize

Adds multiple items at the end of the list. Cheaper than multiple push-es because the count only gets updated once at the end. Returns the index of the last inserted item, which is also equal to the new number of elements.

source

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

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

source

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

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

source

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

Get item at index from storage. There are no restrictions on the index, calling for an invalid index will simply return the zero-value.

source

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

Gets the item without checking index bounds. Prefer using get_at_address instead.

source

pub fn get_or_else<F: FnOnce() -> T>(self, index: usize, or_else: F) -> T

Get item at index from storage. If index is valid (1 <= index <= count), returns value at index, else calls lambda given as argument. The lambda only gets called lazily if the index is not valid.

source

pub fn item_is_empty_unchecked(&self, index: usize) -> bool

Checks whether or not there is anything in storage at index. There are no restrictions on the index, calling for an invalid index will simply return true.

source

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

Checks if the mapper at the given address stores anything at this index. Does not check index bounds. Prefer using item_is_empty instead.

source

pub fn item_is_empty(&self, index: usize) -> bool

Checks whether or not there is anything ins storage at index. Index must be valid (1 <= index <= count).

source

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

Checks if the mapper at the given address stores anything at this index. Index must be valid (1 <= index <= count).

source

pub fn set(&self, index: usize, item: &T)

Set item at index in storage. Index must be valid (1 <= index <= count).

source

pub fn clear_entry(&self, index: usize)

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

source

pub fn clear_entry_unchecked(&self, index: usize)

Clears item at index from storage. There are no restrictions on the index, calling for an invalid index will simply do nothing.

source

pub fn swap_remove(&mut self, index: usize)

Clears item at index from storage by swap remove last item takes the index of the item to remove and we remove the last index.

source

pub fn load_as_vec(&self) -> Vec<T>

Loads all items from storage and places them in a Vec. Can easily consume a lot of gas.

source

pub fn clear(&mut self)

Deletes all contents form storage and sets count to 0. Can easily consume a lot of gas.

source

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

Provides a forward iterator.

Trait Implementations§

source§

impl<'a, SA, T> IntoIterator for &'a VecMapper<SA, T>
where SA: StorageMapperApi, T: TopEncode + TopDecode + 'static,

§

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 VecMapper<SA, T>

source§

fn clear(&mut self)

Clears all the entries owned by the storage.
source§

impl<SA, T> StorageMapper<SA> for VecMapper<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 VecMapper<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 VecMapper<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<VecMapper<SA, T>> for MultiValueEncoded<SA, T>

Auto Trait Implementations§

§

impl<SA, T> CodecFromSelf for VecMapper<SA, T>

§

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

§

impl<SA, T> Send for VecMapper<SA, T>
where SA: Send, T: Send, <SA as HandleTypeInfo>::ManagedBufferHandle: Send,

§

impl<SA, T> Sync for VecMapper<SA, T>
where SA: Sync, T: Sync, <SA as HandleTypeInfo>::ManagedBufferHandle: Sync,

§

impl<SA, T> Unpin for VecMapper<SA, T>

§

impl<SA, T> UnwindSafe for VecMapper<SA, T>

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