Struct Redeemed

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

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

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.

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.

pub fn as_inner(&self) -> &C

Returns inner collection type

pub fn to_inner(&self) -> C

where C: Clone,

Clones inner collection type and returns it

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.

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.

pub fn clear(&mut self)

Removes all elements from the confined collection.

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.

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.

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.

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.

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.

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.

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

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

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.

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

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

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.

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

Returns slice representation of the vec.

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

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

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.

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

Returns an iterator over the slice.

The iterator yields all items from start to end.

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

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

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

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

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.

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.

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.

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.

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.

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.

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.

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.

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.

Trait Implementations

impl AsMut<<Redeemed as Wrapper>::Inner> for Redeemed

fn as_mut(&mut self) -> &mut <Redeemed as Wrapper>::Inner

Converts this type into a mutable reference of the (usually inferred) input type.

impl AsRef<Confined<BTreeMap<u16, OpId>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>> for Redeemed

fn as_ref( &self, ) -> &Confined<BTreeMap<u16, OpId>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>

Converts this type into a shared reference of the (usually inferred) input type.

impl Borrow<Confined<BTreeMap<u16, OpId>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>> for Redeemed

fn borrow( &self, ) -> &Confined<BTreeMap<u16, OpId>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>

Immutably borrows from an owned value.

impl BorrowMut<<Redeemed as Wrapper>::Inner> for Redeemed

fn borrow_mut(&mut self) -> &mut <Redeemed as Wrapper>::Inner

Mutably borrows from an owned value.

impl Clone for Redeemed

fn clone(&self) -> Redeemed

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl CommitStrategy for Redeemed

type Strategy = Strict

Specific strategy. List of supported strategies:

impl Debug for Redeemed

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Default for Redeemed

fn default() -> Redeemed

Returns the “default value” for a type.

impl Deref for Redeemed

type Target = Confined<BTreeMap<u16, OpId>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>

The resulting type after dereferencing.

fn deref(&self) -> &<Redeemed as Deref>::Target

Dereferences the value.

impl DerefMut for Redeemed

fn deref_mut(&mut self) -> &mut <Redeemed as Deref>::Target

Mutably dereferences the value.

impl<'de> Deserialize<'de> for Redeemed

fn deserialize<__D>( __deserializer: __D, ) -> Result<Redeemed, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl From<Confined<BTreeMap<u16, OpId>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>> for Redeemed

fn from( v: Confined<BTreeMap<u16, OpId>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>, ) -> Redeemed

Converts to this type from the input type.

impl From<Redeemed> for Confined<BTreeMap<u16, OpId>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>

fn from( wrapped: Redeemed, ) -> Confined<BTreeMap<u16, OpId>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>

Converts to this type from the input type.

impl Hash for Redeemed

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a> IntoIterator for &'a Redeemed

type Item = (&'a u16, &'a OpId)

The type of the elements being iterated over.

type IntoIter = Iter<'a, u16, OpId>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a Redeemed as IntoIterator>::IntoIter

Creates an iterator from a value.

impl Ord for Redeemed

fn cmp(&self, other: &Redeemed) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Redeemed

fn eq(&self, other: &Redeemed) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for Redeemed

fn partial_cmp(&self, other: &Redeemed) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for Redeemed

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StrictDecode for Redeemed

fn strict_decode(reader: &mut impl TypedRead) -> Result<Redeemed, DecodeError>

fn strict_read(lim: usize, reader: impl Read) -> Result<Self, DecodeError>

impl StrictEncode for Redeemed

fn strict_encode<W>(&self, writer: W) -> Result<W, Error>

where W: TypedWrite,

fn strict_write(&self, lim: usize, writer: impl Write) -> Result<usize, Error>

impl StrictTuple for Redeemed

const FIELD_COUNT: u8 = 1u8

fn strict_check_fields()

fn strict_type_info() -> TypeInfo<Self>

impl StrictType for Redeemed

const STRICT_LIB_NAME: &'static str = LIB_NAME_RGB

fn strict_name() -> Option<TypeName>

impl Wrapper for Redeemed

type Inner = Confined<BTreeMap<u16, OpId>, amplify::::collection::confinement::TinyOrdMap::{constant#0}, amplify::::collection::confinement::TinyOrdMap::{constant#1}>

Inner type wrapped by the current newtype

fn from_inner(inner: <Redeemed as Wrapper>::Inner) -> Redeemed

Instantiates wrapper type with the inner data

fn as_inner(&self) -> &<Redeemed as Wrapper>::Inner

Returns reference to the inner representation for the wrapper type

fn into_inner(self) -> <Redeemed as Wrapper>::Inner

Unwraps the wrapper returning the inner type

fn to_inner(&self) -> Self::Inner

where Self::Inner: Clone,

Clones inner data of the wrapped type and return them

fn copy(&self) -> Self

where Self: Sized, Self::Inner: Copy,

Copies the wrapped type

impl WrapperMut for Redeemed

fn as_inner_mut(&mut self) -> &mut <Redeemed as Wrapper>::Inner

Returns a mutable reference to the inner representation for the wrapper type

impl Eq for Redeemed

impl StrictProduct for Redeemed

impl StructuralPartialEq for Redeemed