Struct pallet_bags_list::Bag
source · pub struct Bag<T: Config<I>, I: 'static = ()> { /* private fields */ }
Expand description
A Bag is a doubly-linked list of ids, where each id is mapped to a Node
.
Note that we maintain both head and tail pointers. While it would be possible to get away with maintaining only a head pointer and cons-ing elements onto the front of the list, it’s more desirable to ensure that there is some element of first-come, first-serve to the list’s iteration so that there’s no incentive to churn ids positioning to improve the chances of appearing within the ids set.
Implementations§
Trait Implementations§
source§impl<T: Clone + Config<I>, I: Clone + 'static> Clone for Bag<T, I>where
T::AccountId: Clone,
T::Score: Clone,
impl<T: Clone + Config<I>, I: Clone + 'static> Clone for Bag<T, I>where T::AccountId: Clone, T::Score: Clone,
source§impl<T: Config<I>, I: 'static> Decode for Bag<T, I>where
Option<T::AccountId>: Decode,
T::Score: Default,
PhantomData<I>: Default,
impl<T: Config<I>, I: 'static> Decode for Bag<T, I>where Option<T::AccountId>: Decode, T::Score: Default, PhantomData<I>: Default,
source§fn decode<__CodecInputEdqy: Input>(
__codec_input_edqy: &mut __CodecInputEdqy
) -> Result<Self, Error>
fn decode<__CodecInputEdqy: Input>( __codec_input_edqy: &mut __CodecInputEdqy ) -> Result<Self, Error>
Attempt to deserialise the value from input.
§fn decode_into<I>(
input: &mut I,
dst: &mut MaybeUninit<Self>
) -> Result<DecodeFinished, Error>where
I: Input,
fn decode_into<I>( input: &mut I, dst: &mut MaybeUninit<Self> ) -> Result<DecodeFinished, Error>where I: Input,
Attempt to deserialize the value from input into a pre-allocated piece of memory. Read more
§fn skip<I>(input: &mut I) -> Result<(), Error>where
I: Input,
fn skip<I>(input: &mut I) -> Result<(), Error>where I: Input,
Attempt to skip the encoded value from input. Read more
§fn encoded_fixed_size() -> Option<usize>
fn encoded_fixed_size() -> Option<usize>
Returns the fixed encoded size of the type. Read more
source§impl<T: Config<I>, I: 'static> Encode for Bag<T, I>where
Option<T::AccountId>: Encode,
impl<T: Config<I>, I: 'static> Encode for Bag<T, I>where Option<T::AccountId>: Encode,
source§fn encode_to<__CodecOutputEdqy: Output + ?Sized>(
&self,
__codec_dest_edqy: &mut __CodecOutputEdqy
)
fn encode_to<__CodecOutputEdqy: Output + ?Sized>( &self, __codec_dest_edqy: &mut __CodecOutputEdqy )
Convert self to a slice and append it to the destination.
§fn using_encoded<R, F>(&self, f: F) -> Rwhere
F: FnOnce(&[u8]) -> R,
fn using_encoded<R, F>(&self, f: F) -> Rwhere F: FnOnce(&[u8]) -> R,
Convert self to a slice and then invoke the given closure with it.
§fn encoded_size(&self) -> usize
fn encoded_size(&self) -> usize
Calculates the encoded size. Read more
source§impl<T: Config<I>, I: 'static> MaxEncodedLen for Bag<T, I>
impl<T: Config<I>, I: 'static> MaxEncodedLen for Bag<T, I>
source§fn max_encoded_len() -> usize
fn max_encoded_len() -> usize
Upper bound, in bytes, of the maximum encoded size of this item.
source§impl<T: PartialEq + Config<I>, I: PartialEq + 'static> PartialEq<Bag<T, I>> for Bag<T, I>where
T::AccountId: PartialEq,
T::Score: PartialEq,
impl<T: PartialEq + Config<I>, I: PartialEq + 'static> PartialEq<Bag<T, I>> for Bag<T, I>where T::AccountId: PartialEq, T::Score: PartialEq,
source§impl<T, I> TypeInfo for Bag<T, I>where
Option<T::AccountId>: TypeInfo + 'static,
T::Score: TypeInfo + 'static,
PhantomData<I>: TypeInfo + 'static,
T: Config<I> + 'static,
I: 'static,
impl<T, I> TypeInfo for Bag<T, I>where Option<T::AccountId>: TypeInfo + 'static, T::Score: TypeInfo + 'static, PhantomData<I>: TypeInfo + 'static, T: Config<I> + 'static, I: 'static,
impl<T: Config<I>, I: 'static> EncodeLike<Bag<T, I>> for Bag<T, I>where Option<T::AccountId>: Encode,
impl<T: Config<I>, I: 'static> StructuralPartialEq for Bag<T, I>
Auto Trait Implementations§
impl<T, I> RefUnwindSafe for Bag<T, I>where I: RefUnwindSafe, <T as Config>::AccountId: RefUnwindSafe, <T as Config<I>>::Score: RefUnwindSafe,
impl<T, I> Send for Bag<T, I>where I: Send, <T as Config<I>>::Score: Send,
impl<T, I> Sync for Bag<T, I>where I: Sync, <T as Config<I>>::Score: Sync,
impl<T, I> Unpin for Bag<T, I>where I: Unpin, <T as Config>::AccountId: Unpin, <T as Config<I>>::Score: Unpin,
impl<T, I> UnwindSafe for Bag<T, I>where I: UnwindSafe, <T as Config>::AccountId: UnwindSafe, <T as Config<I>>::Score: UnwindSafe,
Blanket Implementations§
source§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
§impl<T> DecodeAll for Twhere
T: Decode,
impl<T> DecodeAll for Twhere T: Decode,
§fn decode_all(input: &mut &[u8]) -> Result<T, Error>
fn decode_all(input: &mut &[u8]) -> Result<T, Error>
Decode
Self
and consume all of the given input data. Read more§impl<T> DecodeLimit for Twhere
T: Decode,
impl<T> DecodeLimit for Twhere T: Decode,
source§impl<T> Hashable for Twhere
T: Codec,
impl<T> Hashable for Twhere T: Codec,
fn blake2_128(&self) -> [u8; 16]
fn blake2_256(&self) -> [u8; 32]
fn blake2_128_concat(&self) -> Vec<u8, Global> ⓘ
fn twox_128(&self) -> [u8; 16]
fn twox_256(&self) -> [u8; 32]
fn twox_64_concat(&self) -> Vec<u8, Global> ⓘ
fn identity(&self) -> Vec<u8, Global> ⓘ
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T, Outer> IsWrappedBy<Outer> for Twhere
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
impl<T, Outer> IsWrappedBy<Outer> for Twhere Outer: AsRef<T> + AsMut<T> + From<T>, T: From<Outer>,
§impl<T> KeyedVec for Twhere
T: Codec,
impl<T> KeyedVec for Twhere T: Codec,
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
source§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere Self: UniqueSaturatedFrom<T>,
source§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere Self: UniqueSaturatedInto<T>,
Consume self to return an equivalent value of
T
. Read more§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.source§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere T: UncheckedFrom<S>,
source§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
The counterpart to
unchecked_from
.source§impl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
impl<T, S> UniqueSaturatedInto<T> for Swhere T: Bounded, S: TryInto<T>,
source§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
Consume self to return an equivalent value of
T
.