Struct pallet_ranked_collective::Tally
source · pub struct Tally<T, I, M: GetMaxVoters> { /* private fields */ }
Expand description
Aggregated votes for an ongoing poll by members of the ranked collective.
Implementations§
source§impl<T: Config<I>, I: 'static, M: GetMaxVoters> Tally<T, I, M>
impl<T: Config<I>, I: 'static, M: GetMaxVoters> Tally<T, I, M>
pub fn from_parts(bare_ayes: MemberIndex, ayes: Votes, nays: Votes) -> Self
Trait Implementations§
source§impl<T, I, M: GetMaxVoters> Clone for Tally<T, I, M>
impl<T, I, M: GetMaxVoters> Clone for Tally<T, I, M>
source§impl<T, I, M: GetMaxVoters> Debug for Tally<T, I, M>
impl<T, I, M: GetMaxVoters> Debug for Tally<T, I, M>
source§impl<T, I, M: GetMaxVoters> Decode for Tally<T, I, M>where
PhantomData<(T, I, M)>: Decode,
impl<T, I, M: GetMaxVoters> Decode for Tally<T, I, M>where PhantomData<(T, I, M)>: Decode,
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, I, M: GetMaxVoters> Encode for Tally<T, I, M>where
PhantomData<(T, I, M)>: Encode,
impl<T, I, M: GetMaxVoters> Encode for Tally<T, I, M>where PhantomData<(T, I, M)>: 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, I, M: GetMaxVoters> MaxEncodedLen for Tally<T, I, M>
impl<T, I, M: GetMaxVoters> MaxEncodedLen for Tally<T, I, M>
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, I, M: GetMaxVoters> PartialEq<Tally<T, I, M>> for Tally<T, I, M>
impl<T, I, M: GetMaxVoters> PartialEq<Tally<T, I, M>> for Tally<T, I, M>
source§impl<T, I, M> TypeInfo for Tally<T, I, M>where
PhantomData<(T, I, M)>: TypeInfo + 'static,
T: 'static,
I: 'static,
M: GetMaxVoters + 'static,
impl<T, I, M> TypeInfo for Tally<T, I, M>where PhantomData<(T, I, M)>: TypeInfo + 'static, T: 'static, I: 'static, M: GetMaxVoters + 'static,
source§impl<T: Config<I>, I: 'static, M: GetMaxVoters<Class = ClassOf<T, I>>> VoteTally<u32, <<T as Config<I>>::Polls as Polling<Tally<T, I, Pallet<T, I>>>>::Class> for Tally<T, I, M>
impl<T: Config<I>, I: 'static, M: GetMaxVoters<Class = ClassOf<T, I>>> VoteTally<u32, <<T as Config<I>>::Polls as Polling<Tally<T, I, Pallet<T, I>>>>::Class> for Tally<T, I, M>
fn new(_: ClassOf<T, I>) -> Self
fn ayes(&self, _: ClassOf<T, I>) -> Votes
fn support(&self, class: ClassOf<T, I>) -> Perbill
fn approval(&self, _: ClassOf<T, I>) -> Perbill
fn unanimity(class: ClassOf<T, I>) -> Self
fn rejection(class: ClassOf<T, I>) -> Self
fn from_requirements( support: Perbill, approval: Perbill, class: ClassOf<T, I> ) -> Self
impl<T, I, M: GetMaxVoters> EncodeLike<Tally<T, I, M>> for Tally<T, I, M>where PhantomData<(T, I, M)>: Encode,
impl<T, I, M: GetMaxVoters> Eq for Tally<T, I, M>
Auto Trait Implementations§
impl<T, I, M> RefUnwindSafe for Tally<T, I, M>where I: RefUnwindSafe, M: RefUnwindSafe, T: RefUnwindSafe,
impl<T, I, M> Send for Tally<T, I, M>where I: Send, M: Send, T: Send,
impl<T, I, M> Sync for Tally<T, I, M>where I: Sync, M: Sync, T: Sync,
impl<T, I, M> Unpin for Tally<T, I, M>where I: Unpin, M: Unpin, T: Unpin,
impl<T, I, M> UnwindSafe for Tally<T, I, M>where I: UnwindSafe, M: UnwindSafe, T: 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<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
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
.