Struct secret_toolkit_storage::append_store::AppendStore

pub struct AppendStore<'a, T, Ser = Bincode2>
where
    T: Serialize + DeserializeOwned,
    Ser: Serde,
{ /* private fields */ }

Implementations

impl<'a, T: Serialize + DeserializeOwned, Ser: Serde> AppendStore<'a, T, Ser>

pub const fn new(namespace: &'a [u8]) -> Self

constructor

pub const fn new_with_page_size(namespace: &'a [u8], page_size: u32) -> Self

pub fn add_suffix(&self, suffix: &[u8]) -> Self

This is used to produce a new AppendListStorage. This can be used when you want to associate an AppendListStorage to each user and you still get to define the AppendListStorage as a static constant

impl<'a, T: Serialize + DeserializeOwned, Ser: Serde> AppendStore<'a, T, Ser>

pub fn get_len(&self, storage: &dyn Storage) -> StdResult<u32>

gets the length from storage, and otherwise sets it to 0

pub fn is_empty(&self, storage: &dyn Storage) -> StdResult<bool>

checks if the collection has any elements

pub fn get_at(&self, storage: &dyn Storage, pos: u32) -> StdResult<T>

gets the element at pos if within bounds

pub fn clear(&self, storage: &mut dyn Storage)

Clear the collection

pub fn set_at( &self, storage: &mut dyn Storage, pos: u32, item: &T ) -> StdResult<()>

Replaces data at a position within bounds

pub fn push(&self, storage: &mut dyn Storage, item: &T) -> StdResult<()>

Pushes an item to AppendStorage

pub fn pop(&self, storage: &mut dyn Storage) -> StdResult<T>

Pops an item from AppendStore

pub fn remove(&self, storage: &mut dyn Storage, pos: u32) -> StdResult<T>

Remove an element from the collection at the specified position.

Removing the last element has a constant cost. The cost of removing from the middle/start will depend on the proximity to tail of the list. All elements above the specified position will be shifted in storage.

Removing an element from the start (head) of the collection has the worst runtime and gas cost.

pub fn iter( &self, storage: &'a dyn Storage ) -> StdResult<AppendStoreIter<'_, T, Ser>>

Returns a readonly iterator

pub fn paging( &self, storage: &dyn Storage, start_page: u32, size: u32 ) -> StdResult<Vec<T>>

does paging with the given parameters