pub struct BiDiMapper<SA, K, V, A = CurrentStorage>where
SA: StorageMapperApi,
A: StorageAddress<SA>,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,{ /* private fields */ }
Expand description
A bi-directional map, from values to ids and viceversa. The mapper is based on UnorderedSetMapper, reason why the remove is done by swap_remove
Implementations§
Source§impl<SA, K, V, A> BiDiMapper<SA, K, V, A>where
SA: StorageMapperApi,
A: StorageAddress<SA>,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
impl<SA, K, V, A> BiDiMapper<SA, K, V, A>where
SA: StorageMapperApi,
A: StorageAddress<SA>,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
pub fn get_id(&self, value: &V) -> K
pub fn get_value(&self, id: &K) -> V
pub fn contains_id(&self, id: &K) -> bool
pub fn contains_value(&self, value: &V) -> bool
pub fn get_all_values(&self) -> Iter<'_, SA, V, A>
pub fn get_all_ids(&self) -> Iter<'_, SA, K, A>
pub fn iter(&self) -> Iter<'_, SA, K, V, A>
pub fn is_empty(&self) -> bool
pub fn len(&self) -> usize
Source§impl<SA, K, V> BiDiMapper<SA, K, V>where
SA: StorageMapperApi,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
impl<SA, K, V> BiDiMapper<SA, K, V>where
SA: StorageMapperApi,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
pub fn insert(&mut self, id: K, value: V) -> bool
pub fn remove_by_id(&mut self, id: &K) -> bool
pub fn remove_by_value(&mut self, value: &V) -> bool
pub fn remove_all_by_ids<I>(&mut self, iter: I)where
I: IntoIterator<Item = K>,
pub fn remove_all_by_values<I>(&mut self, iter: I)where
I: IntoIterator<Item = V>,
Trait Implementations§
Source§impl<'a, SA, K, V, A> IntoIterator for &'a BiDiMapper<SA, K, V, A>where
SA: StorageMapperApi,
A: StorageAddress<SA>,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
impl<'a, SA, K, V, A> IntoIterator for &'a BiDiMapper<SA, K, V, A>where
SA: StorageMapperApi,
A: StorageAddress<SA>,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
Source§impl<SA, K, V> StorageMapper<SA> for BiDiMapper<SA, K, V>where
SA: StorageMapperApi,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
impl<SA, K, V> StorageMapper<SA> for BiDiMapper<SA, K, V>where
SA: StorageMapperApi,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
Source§fn new(base_key: StorageKey<SA>) -> BiDiMapper<SA, K, V>
fn new(base_key: StorageKey<SA>) -> BiDiMapper<SA, K, V>
Will be called automatically by the
#[storage_mapper]
annotation generated code.Source§impl<SA, K, V> StorageMapperFromAddress<SA> for BiDiMapper<SA, K, V, ManagedAddress<SA>>where
SA: StorageMapperApi,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
impl<SA, K, V> StorageMapperFromAddress<SA> for BiDiMapper<SA, K, V, ManagedAddress<SA>>where
SA: StorageMapperApi,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
Source§fn new_from_address(
address: ManagedAddress<SA>,
base_key: StorageKey<SA>,
) -> BiDiMapper<SA, K, V, ManagedAddress<SA>>
fn new_from_address( address: ManagedAddress<SA>, base_key: StorageKey<SA>, ) -> BiDiMapper<SA, K, V, ManagedAddress<SA>>
Will be called automatically by the
#[storage_mapper_from_address]
annotation generated code.Source§impl<SA, K, V> TopEncodeMulti for BiDiMapper<SA, K, V>where
SA: StorageMapperApi,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
impl<SA, K, V> TopEncodeMulti for BiDiMapper<SA, K, V>where
SA: StorageMapperApi,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
Source§fn multi_encode_or_handle_err<O, H>(
&self,
output: &mut O,
h: H,
) -> Result<(), <H as EncodeErrorHandler>::HandledErr>where
O: TopEncodeMultiOutput,
H: EncodeErrorHandler,
fn multi_encode_or_handle_err<O, H>(
&self,
output: &mut O,
h: H,
) -> Result<(), <H as EncodeErrorHandler>::HandledErr>where
O: TopEncodeMultiOutput,
H: EncodeErrorHandler,
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>where
O: TopEncodeMultiOutput,
fn multi_encode<O>(&self, output: &mut O) -> Result<(), EncodeError>where
O: TopEncodeMultiOutput,
Attempt to serialize the value to ouput.
Source§impl<SA, K, V> TypeAbi for BiDiMapper<SA, K, V>where
SA: StorageMapperApi,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq + TypeAbi,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq + TypeAbi,
impl<SA, K, V> TypeAbi for BiDiMapper<SA, K, V>where
SA: StorageMapperApi,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq + TypeAbi,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq + TypeAbi,
type Unmanaged = BiDiMapper<SA, K, V>
fn type_name() -> String
fn type_name_rust() -> String
Source§fn provide_type_descriptions<TDC>(accumulator: &mut TDC)where
TDC: TypeDescriptionContainer,
fn provide_type_descriptions<TDC>(accumulator: &mut TDC)where
TDC: TypeDescriptionContainer,
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.
fn type_names() -> TypeNames
impl<SA, K, V> TypeAbiFrom<BiDiMapper<SA, K, V>> for BiDiMapper<SA, K, V>where
SA: StorageMapperApi,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
impl<SA, K, V> TypeAbiFrom<BiDiMapper<SA, K, V>> for MultiValueEncoded<SA, MultiValue2<K, V>>where
SA: StorageMapperApi,
K: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
V: TopEncode + TopDecode + NestedEncode + NestedDecode + 'static + Default + PartialEq,
Auto Trait Implementations§
impl<SA, K, V, A> Freeze for BiDiMapper<SA, K, V, A>
impl<SA, K, V, A> RefUnwindSafe for BiDiMapper<SA, K, V, A>where
A: RefUnwindSafe,
SA: RefUnwindSafe,
<SA as HandleTypeInfo>::ManagedBufferHandle: RefUnwindSafe,
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<SA, K, V, A> Send for BiDiMapper<SA, K, V, A>
impl<SA, K, V, A> Sync for BiDiMapper<SA, K, V, A>
impl<SA, K, V, A> Unpin for BiDiMapper<SA, K, V, A>
impl<SA, K, V, A> UnwindSafe for BiDiMapper<SA, K, V, A>where
A: UnwindSafe,
SA: UnwindSafe,
<SA as HandleTypeInfo>::ManagedBufferHandle: UnwindSafe,
K: UnwindSafe,
V: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> InterpretableFrom<T> for T
impl<T> InterpretableFrom<T> for T
fn interpret_from(from: T, _context: &InterpreterContext) -> T
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more