Struct pallet_distance::EvaluationPool
source · pub struct EvaluationPool<AccountId: Ord, IdtyIndex> {
pub evaluations: BoundedVec<(IdtyIndex, MedianAcc<Perbill, MAX_EVALUATORS_PER_SESSION>), ConstU32<MAX_EVALUATIONS_PER_SESSION>>,
pub evaluators: BoundedBTreeSet<AccountId, ConstU32<MAX_EVALUATORS_PER_SESSION>>,
}
Expand description
Represents a pool where distance evaluation requests and results are stored.
Depending on the pool rotation, this may not be complete and may still be accepting new evaluation requests (with empty median accumulators) or new evaluations (with evaluators and new samples in the median accumulators).
Fields§
§evaluations: BoundedVec<(IdtyIndex, MedianAcc<Perbill, MAX_EVALUATORS_PER_SESSION>), ConstU32<MAX_EVALUATIONS_PER_SESSION>>
List of identities with their evaluation result. The result is the median of all the evaluations.
evaluators: BoundedBTreeSet<AccountId, ConstU32<MAX_EVALUATORS_PER_SESSION>>
Evaluators who have published a result.
Its length should be the same as the number of samples
in each evaluation result MedianAcc
.
An evaluator is not allowed to publish twice in a single session.
Trait Implementations§
source§impl<AccountId: Clone + Ord, IdtyIndex: Clone> Clone for EvaluationPool<AccountId, IdtyIndex>
impl<AccountId: Clone + Ord, IdtyIndex: Clone> Clone for EvaluationPool<AccountId, IdtyIndex>
source§fn clone(&self) -> EvaluationPool<AccountId, IdtyIndex>
fn clone(&self) -> EvaluationPool<AccountId, IdtyIndex>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<AccountId, IdtyIndex> Debug for EvaluationPool<AccountId, IdtyIndex>
impl<AccountId, IdtyIndex> Debug for EvaluationPool<AccountId, IdtyIndex>
source§impl<AccountId: Ord, IdtyIndex> Decode for EvaluationPool<AccountId, IdtyIndex>where
BoundedVec<(IdtyIndex, MedianAcc<Perbill, MAX_EVALUATORS_PER_SESSION>), ConstU32<MAX_EVALUATIONS_PER_SESSION>>: Decode,
BoundedVec<(IdtyIndex, MedianAcc<Perbill, MAX_EVALUATORS_PER_SESSION>), ConstU32<MAX_EVALUATIONS_PER_SESSION>>: Decode,
BoundedBTreeSet<AccountId, ConstU32<MAX_EVALUATORS_PER_SESSION>>: Decode,
BoundedBTreeSet<AccountId, ConstU32<MAX_EVALUATORS_PER_SESSION>>: Decode,
impl<AccountId: Ord, IdtyIndex> Decode for EvaluationPool<AccountId, IdtyIndex>where
BoundedVec<(IdtyIndex, MedianAcc<Perbill, MAX_EVALUATORS_PER_SESSION>), ConstU32<MAX_EVALUATIONS_PER_SESSION>>: Decode,
BoundedVec<(IdtyIndex, MedianAcc<Perbill, MAX_EVALUATORS_PER_SESSION>), ConstU32<MAX_EVALUATIONS_PER_SESSION>>: Decode,
BoundedBTreeSet<AccountId, ConstU32<MAX_EVALUATORS_PER_SESSION>>: Decode,
BoundedBTreeSet<AccountId, ConstU32<MAX_EVALUATORS_PER_SESSION>>: 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<AccountId: Ord, IdtyIndex> Default for EvaluationPool<AccountId, IdtyIndex>
impl<AccountId: Ord, IdtyIndex> Default for EvaluationPool<AccountId, IdtyIndex>
source§impl<AccountId: Ord, IdtyIndex> Encode for EvaluationPool<AccountId, IdtyIndex>where
BoundedVec<(IdtyIndex, MedianAcc<Perbill, MAX_EVALUATORS_PER_SESSION>), ConstU32<MAX_EVALUATIONS_PER_SESSION>>: Encode,
BoundedVec<(IdtyIndex, MedianAcc<Perbill, MAX_EVALUATORS_PER_SESSION>), ConstU32<MAX_EVALUATIONS_PER_SESSION>>: Encode,
BoundedBTreeSet<AccountId, ConstU32<MAX_EVALUATORS_PER_SESSION>>: Encode,
BoundedBTreeSet<AccountId, ConstU32<MAX_EVALUATORS_PER_SESSION>>: Encode,
impl<AccountId: Ord, IdtyIndex> Encode for EvaluationPool<AccountId, IdtyIndex>where
BoundedVec<(IdtyIndex, MedianAcc<Perbill, MAX_EVALUATORS_PER_SESSION>), ConstU32<MAX_EVALUATIONS_PER_SESSION>>: Encode,
BoundedVec<(IdtyIndex, MedianAcc<Perbill, MAX_EVALUATORS_PER_SESSION>), ConstU32<MAX_EVALUATIONS_PER_SESSION>>: Encode,
BoundedBTreeSet<AccountId, ConstU32<MAX_EVALUATORS_PER_SESSION>>: Encode,
BoundedBTreeSet<AccountId, ConstU32<MAX_EVALUATORS_PER_SESSION>>: Encode,
source§fn size_hint(&self) -> usize
fn size_hint(&self) -> usize
If possible give a hint of expected size of the encoding. Read more
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) -> R
fn using_encoded<R, F>(&self, f: F) -> 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<AccountId, IdtyIndex> TypeInfo for EvaluationPool<AccountId, IdtyIndex>
impl<AccountId, IdtyIndex> TypeInfo for EvaluationPool<AccountId, IdtyIndex>
impl<AccountId: Ord, IdtyIndex> EncodeLike for EvaluationPool<AccountId, IdtyIndex>where
BoundedVec<(IdtyIndex, MedianAcc<Perbill, MAX_EVALUATORS_PER_SESSION>), ConstU32<MAX_EVALUATIONS_PER_SESSION>>: Encode,
BoundedVec<(IdtyIndex, MedianAcc<Perbill, MAX_EVALUATORS_PER_SESSION>), ConstU32<MAX_EVALUATIONS_PER_SESSION>>: Encode,
BoundedBTreeSet<AccountId, ConstU32<MAX_EVALUATORS_PER_SESSION>>: Encode,
BoundedBTreeSet<AccountId, ConstU32<MAX_EVALUATORS_PER_SESSION>>: Encode,
Auto Trait Implementations§
impl<AccountId, IdtyIndex> Freeze for EvaluationPool<AccountId, IdtyIndex>
impl<AccountId, IdtyIndex> RefUnwindSafe for EvaluationPool<AccountId, IdtyIndex>where
AccountId: RefUnwindSafe,
IdtyIndex: RefUnwindSafe,
impl<AccountId, IdtyIndex> Send for EvaluationPool<AccountId, IdtyIndex>
impl<AccountId, IdtyIndex> Sync for EvaluationPool<AccountId, IdtyIndex>
impl<AccountId, IdtyIndex> Unpin for EvaluationPool<AccountId, IdtyIndex>where
IdtyIndex: Unpin,
impl<AccountId, IdtyIndex> UnwindSafe for EvaluationPool<AccountId, IdtyIndex>where
AccountId: RefUnwindSafe,
IdtyIndex: 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
§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
§fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
§fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
fn checked_into<T>(self) -> Option<T>where
Self: TryInto<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,
§impl<T> Hashable for Twhere
T: Codec,
impl<T> Hashable for Twhere
T: Codec,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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§impl<T> IsType<T> for T
impl<T> IsType<T> for T
§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
§impl<T> KeyedVec for Twhere
T: Codec,
impl<T> KeyedVec for Twhere
T: Codec,
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
§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.§impl<T, U> TryIntoKey<U> for Twhere
U: TryFromKey<T>,
impl<T, U> TryIntoKey<U> for Twhere
U: TryFromKey<T>,
type Error = <U as TryFromKey<T>>::Error
fn try_into_key(self) -> Result<U, <U as TryFromKey<T>>::Error>
§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
The counterpart to
unchecked_from
.§impl<T, S> UniqueSaturatedInto<T> for S
impl<T, S> UniqueSaturatedInto<T> for S
§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
Consume self to return an equivalent value of
T
.