Struct GlobalState

Source

pub struct GlobalState(/* private fields */);

Implementations§

Source §

impl GlobalState

Source

pub fn add_state(&mut self, ty: u16, state: RevealedData) -> Result<(), Error>

Source

pub fn extend_state( &mut self, ty: u16, iter: impl IntoIterator<Item = RevealedData>, ) -> Result<(), Error>

Methods from Deref<Target = Confined<BTreeMap<u16, GlobalValues>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>>§

Source

pub fn iter_mut(&'c mut self) -> <&'c mut C as IntoIterator>::IntoIter

Returns an iterator that allows modifying each value.

The iterator yields all items from start to end.

Source

pub fn keyed_values_mut(&'c mut self) -> <&'c mut C as IntoIterator>::IntoIter

Returns an iterator that allows modifying each value for each key.

Source

pub fn as_inner(&self) -> &C

Returns inner collection type

Source

pub fn to_inner(&self) -> C
where C: Clone,

Clones inner collection type and returns it

Source

pub fn push(&mut self, elem: <C as Collection>::Item) -> Result<(), Error>

Attempts to add a single element to the confined collection. Fails if the number of elements in the collection already maximal.

Source

pub fn extend<T>(&mut self, iter: T) -> Result<(), Error>
where T: IntoIterator<Item = <C as Collection>::Item>,

Attempts to add all elements from an iterator to the confined collection. Fails if the number of elements in the collection already maximal.

Source

pub fn clear(&mut self)

Removes all elements from the confined collection.

Source

pub fn len_u8(&self) -> u8

Returns number of elements in the confined collection as u8. The confinement guarantees that the collection length can’t exceed u8::MAX.

Source

pub fn len_u16(&self) -> u16

Returns number of elements in the confined collection as u16. The confinement guarantees that the collection length can’t exceed u16::MAX.

Source

pub fn len_u24(&self) -> u24

Returns number of elements in the confined collection as u24. The confinement guarantees that the collection length can’t exceed u24::MAX.

Source

pub fn len_u32(&self) -> u32

Returns number of elements in the confined collection as u32. The confinement guarantees that the collection length can’t exceed u32::MAX.

Source

pub fn get_mut( &mut self, key: &<C as KeyedCollection>::Key, ) -> Option<&mut <C as KeyedCollection>::Value>

Gets mutable reference to an element of the collection.

Source

pub fn insert( &mut self, key: <C as KeyedCollection>::Key, value: <C as KeyedCollection>::Value, ) -> Result<Option<<C as KeyedCollection>::Value>, Error>

Inserts a new value into the confined collection under a given key. Fails if the collection already contains maximum number of elements allowed by the confinement.

Source

pub fn pop(&mut self) -> Option<char>

Removes the last character from a string and returns it, or None if it is empty.

Source

pub fn remove(&mut self, index: usize) -> Result<char, Error>

Removes a single character from the confined string, unless the string doesn’t shorten more than the confinement requirement. Errors otherwise.

Source

pub fn pop(&mut self) -> Option<AsciiChar>

Removes the last character from a string and returns it, or None if it is empty.

Source

pub fn remove(&mut self, index: usize) -> Result<AsciiChar, Error>

Removes a single character from the confined string, unless the string doesn’t shorten more than the confinement requirement. Errors otherwise.

Source

pub fn as_slice(&self) -> &[T]

Returns slice representation of the vec.

Source

pub fn pop(&mut self) -> Option<T>

Removes the last element from a vector and returns it, or None if it is empty.

Source

pub fn remove(&mut self, index: usize) -> Result<T, Error>

Removes an element from the vector at a given index. Errors if the index exceeds the number of elements in the vector, of if the new vector length will be less than the confinement requirement. Returns the removed element otherwise.

Source

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

Returns an iterator over the slice.

The iterator yields all items from start to end.

Source

pub fn pop_front(&mut self) -> Option<T>

Removes the first element and returns it, or None if the deque is empty.

Source

pub fn pop_back(&mut self) -> Option<T>

Removes the last element and returns it, or None if the deque is empty.

Source

pub fn push_from(&mut self, elem: T) -> Result<(), Error>

Prepends an element to the deque. Errors if the new collection length will not fit the confinement requirements.

Source

pub fn push_back(&mut self, elem: T) -> Result<(), Error>

Appends an element to the deque. Errors if the new collection length will not fit the confinement requirements.

Source

pub fn remove(&mut self, index: usize) -> Result<T, Error>

Removes an element from the deque at a given index. Errors if the index exceeds the number of elements in the deque, of if the new deque length will be less than the confinement requirement. Returns the removed element otherwise.

Source

pub fn remove(&mut self, elem: &T) -> Result<bool, Error>

Available on crate feature std only.

Removes an element from the set. Errors if the index exceeds the number of elements in the set, of if the new collection length will be less than the confinement requirement. Returns if the element was present in the set.

Source

pub fn take(&mut self, elem: &T) -> Result<Option<T>, Error>

Available on crate feature std only.

Removes an element from the set. Errors if the index exceeds the number of elements in the set, of if the new collection length will be less than the confinement requirement. Returns the removed element otherwise.

Source

pub fn remove(&mut self, elem: &T) -> Result<bool, Error>

Removes an element from the set. Errors if the index exceeds the number of elements in the set, of if the new collection length will be less than the confinement requirement. Returns if the element was present in the set.

Source

pub fn take(&mut self, elem: &T) -> Result<Option<T>, Error>

Removes an element from the set. Errors if the index exceeds the number of elements in the set, of if the new collection length will be less than the confinement requirement. Returns the removed element otherwise.

Source

pub fn remove(&mut self, key: &K) -> Result<Option<V>, Error>

Available on crate feature std only.

Removes an element from the map. Errors if the index exceeds the number of elements in the map, of if the new collection length will be less than the confinement requirement. Returns the removed value otherwise.

Source

pub fn remove(&mut self, key: &K) -> Result<Option<V>, Error>

Removes an element from the map. Errors if the index exceeds the number of elements in the map, of if the new collection length will be less than the confinement requirement. Returns the removed value otherwise.