Struct pallet_grandpa::StoredPendingChange
source · pub struct StoredPendingChange<N, Limit> {
pub scheduled_at: N,
pub delay: N,
pub next_authorities: BoundedAuthorityList<Limit>,
pub forced: Option<N>,
}
Expand description
A stored pending change.
Limit
is the bound for next_authorities
Fields§
§scheduled_at: N
The block number this was scheduled at.
delay: N
The delay in blocks until it will be applied.
The next authority set, weakly bounded in size by Limit
.
forced: Option<N>
If defined it means the change was forced and the given block number indicates the median last finalized block when the change was signaled.
Trait Implementations§
source§impl<N, Limit> Decode for StoredPendingChange<N, Limit>where
N: Decode,
BoundedAuthorityList<Limit>: Decode,
Option<N>: Decode,
impl<N, Limit> Decode for StoredPendingChange<N, Limit>where N: Decode, BoundedAuthorityList<Limit>: Decode, Option<N>: 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<N, Limit> Encode for StoredPendingChange<N, Limit>where
N: Encode,
BoundedAuthorityList<Limit>: Encode,
Option<N>: Encode,
impl<N, Limit> Encode for StoredPendingChange<N, Limit>where N: Encode, BoundedAuthorityList<Limit>: Encode, Option<N>: 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<N, Limit> MaxEncodedLen for StoredPendingChange<N, Limit>where
N: MaxEncodedLen,
Limit: Get<u32>,
impl<N, Limit> MaxEncodedLen for StoredPendingChange<N, Limit>where N: MaxEncodedLen, Limit: Get<u32>,
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<N, Limit> TypeInfo for StoredPendingChange<N, Limit>where
N: TypeInfo + 'static,
BoundedAuthorityList<Limit>: TypeInfo + 'static,
Option<N>: TypeInfo + 'static,
Limit: 'static,
impl<N, Limit> TypeInfo for StoredPendingChange<N, Limit>where N: TypeInfo + 'static, BoundedAuthorityList<Limit>: TypeInfo + 'static, Option<N>: TypeInfo + 'static, Limit: 'static,
impl<N, Limit> EncodeLike<StoredPendingChange<N, Limit>> for StoredPendingChange<N, Limit>where N: Encode, BoundedAuthorityList<Limit>: Encode, Option<N>: Encode,
Auto Trait Implementations§
impl<N, Limit> RefUnwindSafe for StoredPendingChange<N, Limit>where Limit: RefUnwindSafe, N: RefUnwindSafe,
impl<N, Limit> Send for StoredPendingChange<N, Limit>where Limit: Send, N: Send,
impl<N, Limit> Sync for StoredPendingChange<N, Limit>where Limit: Sync, N: Sync,
impl<N, Limit> Unpin for StoredPendingChange<N, Limit>where Limit: Unpin, N: Unpin,
impl<N, Limit> UnwindSafe for StoredPendingChange<N, Limit>where Limit: UnwindSafe, N: 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
.