[−][src]Struct pallet_node_authorization::WellKnownNodes
The set of well known nodes. This is stored sorted (just by value).
Trait Implementations
impl StorageValue<BTreeSet<OpaquePeerId>> for WellKnownNodes[src]
type Query = BTreeSet<PeerId>
The type that get/take returns.
fn module_prefix() -> &'static [u8][src]
fn storage_prefix() -> &'static [u8][src]
fn from_optional_value_to_query(v: Option<BTreeSet<PeerId>>) -> Self::Query[src]
fn from_query_to_optional_value(v: Self::Query) -> Option<BTreeSet<PeerId>>[src]
fn storage_value_final_key() -> [u8; 32][src]
Auto Trait Implementations
impl RefUnwindSafe for WellKnownNodes
impl Send for WellKnownNodes
impl Sync for WellKnownNodes
impl Unpin for WellKnownNodes
impl UnwindSafe for WellKnownNodes
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T> CheckedConversion for T[src]
fn checked_from<T>(t: T) -> Option<Self> where
Self: TryFrom<T>, [src]
Self: TryFrom<T>,
fn checked_into<T>(self) -> Option<T> where
Self: TryInto<T>, [src]
Self: TryInto<T>,
impl<T> From<T> for T[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T> IsType<T> for T[src]
fn from_ref(t: &T) -> &T[src]
fn into_ref(&self) -> &T[src]
fn from_mut(t: &mut T) -> &mut T[src]
fn into_mut(&mut self) -> &mut T[src]
impl<T, Outer> IsWrappedBy<Outer> for T where
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>, [src]
Outer: AsRef<T> + AsMut<T> + From<T>,
T: From<Outer>,
fn from_ref(outer: &Outer) -> &T[src]
Get a reference to the inner from the outer.
fn from_mut(outer: &mut Outer) -> &mut T[src]
Get a mutable reference to the inner from the outer.
impl<T> MaybeRefUnwindSafe for T where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<T> SaturatedConversion for T
fn saturated_from<T>(t: T) -> Self where
Self: UniqueSaturatedFrom<T>,
Self: UniqueSaturatedFrom<T>,
fn saturated_into<T>(self) -> T where
Self: UniqueSaturatedInto<T>,
Self: UniqueSaturatedInto<T>,
impl<T, G> StorageValue<T> for G where
G: StorageValue<T>,
T: FullCodec, [src]
G: StorageValue<T>,
T: FullCodec,
type Query = <G as StorageValue<T>>::Query
The type that get/take return.
fn hashed_key() -> [u8; 32][src]
fn exists() -> bool[src]
fn get() -> <G as StorageValue<T>>::Query[src]
fn try_get() -> Result<T, ()>[src]
fn translate<O, F>(f: F) -> Result<Option<T>, ()> where
F: FnOnce(Option<O>) -> Option<T>,
O: Decode, [src]
F: FnOnce(Option<O>) -> Option<T>,
O: Decode,
fn put<Arg>(val: Arg) where
Arg: EncodeLike<T>, [src]
Arg: EncodeLike<T>,
fn set(maybe_val: <G as StorageValue<T>>::Query)[src]
fn kill()[src]
fn mutate<R, F>(f: F) -> R where
F: FnOnce(&mut <G as StorageValue<T>>::Query) -> R, [src]
F: FnOnce(&mut <G as StorageValue<T>>::Query) -> R,
fn try_mutate<R, E, F>(f: F) -> Result<R, E> where
F: FnOnce(&mut <G as StorageValue<T>>::Query) -> Result<R, E>, [src]
F: FnOnce(&mut <G as StorageValue<T>>::Query) -> Result<R, E>,
fn take() -> <G as StorageValue<T>>::Query[src]
fn append<Item, EncodeLikeItem>(item: EncodeLikeItem) where
EncodeLikeItem: EncodeLike<Item>,
Item: Encode,
T: StorageAppend<Item>, [src]
EncodeLikeItem: EncodeLike<Item>,
Item: Encode,
T: StorageAppend<Item>,
fn decode_len() -> Option<usize> where
T: StorageDecodeLength, [src]
T: StorageDecodeLength,
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]
impl<S, T> UncheckedInto<T> for S where
T: UncheckedFrom<S>, [src]
T: UncheckedFrom<S>,
fn unchecked_into(self) -> T[src]
impl<T, S> UniqueSaturatedInto<T> for S where
S: TryInto<T>,
T: Bounded,
S: TryInto<T>,
T: Bounded,
fn unique_saturated_into(self) -> T
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,