pub struct StorageApi;

Implementations§

source§

impl StorageApi

source

pub fn time_since_genesis( &self ) -> StaticStorageAddress<DecodeStaticType<DurationWrapper>, Yes, Yes, ()>

The time span since genesis, incremented at the end of each era.

source

pub fn validator_count( &self ) -> StaticStorageAddress<DecodeStaticType<u32>, Yes, Yes, ()>

The ideal number of active validators.

source

pub fn minimum_validator_count( &self ) -> StaticStorageAddress<DecodeStaticType<u32>, Yes, Yes, ()>

Minimum number of staking participants before emergency conditions are imposed.

source

pub fn invulnerables( &self ) -> StaticStorageAddress<DecodeStaticType<Vec<AccountId32>>, Yes, Yes, ()>

Any validators that may never be slashed or forcibly kicked. It’s a Vec since they’re easy to initialize and the performance hit is minimal (we expect no more than four invulnerables) and restricted to testnets.

source

pub fn bonded( &self, _0: impl Borrow<AccountId32> ) -> StaticStorageAddress<DecodeStaticType<AccountId32>, Yes, (), Yes>

Map from all locked “stash” accounts to the controller account.

TWOX-NOTE: SAFE since AccountId is a secure hash.

source

pub fn bonded_root( &self ) -> StaticStorageAddress<DecodeStaticType<AccountId32>, (), (), Yes>

Map from all locked “stash” accounts to the controller account.

TWOX-NOTE: SAFE since AccountId is a secure hash.

source

pub fn min_nominator_bond( &self ) -> StaticStorageAddress<DecodeStaticType<u128>, Yes, Yes, ()>

The minimum active bond to become and maintain the role of a nominator.

source

pub fn min_validator_bond( &self ) -> StaticStorageAddress<DecodeStaticType<u128>, Yes, Yes, ()>

The minimum active bond to become and maintain the role of a validator.

source

pub fn minimum_active_stake( &self ) -> StaticStorageAddress<DecodeStaticType<u128>, Yes, Yes, ()>

The minimum active nominator stake of the last successful election.

source

pub fn min_commission( &self ) -> StaticStorageAddress<DecodeStaticType<Perbill>, Yes, Yes, ()>

The minimum amount of commission that validators can set.

If set to 0, no limit exists.

source

pub fn ledger( &self, _0: impl Borrow<AccountId32> ) -> StaticStorageAddress<DecodeStaticType<StakingLedger>, Yes, (), Yes>

Map from all (unlocked) “controller” accounts to the info regarding the staking.

source

pub fn ledger_root( &self ) -> StaticStorageAddress<DecodeStaticType<StakingLedger>, (), (), Yes>

Map from all (unlocked) “controller” accounts to the info regarding the staking.

source

pub fn payee( &self, _0: impl Borrow<AccountId32> ) -> StaticStorageAddress<DecodeStaticType<RewardDestination<AccountId32>>, Yes, Yes, Yes>

Where the reward payment should be made. Keyed by stash.

TWOX-NOTE: SAFE since AccountId is a secure hash.

source

pub fn payee_root( &self ) -> StaticStorageAddress<DecodeStaticType<RewardDestination<AccountId32>>, (), Yes, Yes>

Where the reward payment should be made. Keyed by stash.

TWOX-NOTE: SAFE since AccountId is a secure hash.

source

pub fn validators( &self, _0: impl Borrow<AccountId32> ) -> StaticStorageAddress<DecodeStaticType<ValidatorPrefs>, Yes, Yes, Yes>

The map from (wannabe) validator stash key to the preferences of that validator.

TWOX-NOTE: SAFE since AccountId is a secure hash.

source

pub fn validators_root( &self ) -> StaticStorageAddress<DecodeStaticType<ValidatorPrefs>, (), Yes, Yes>

The map from (wannabe) validator stash key to the preferences of that validator.

TWOX-NOTE: SAFE since AccountId is a secure hash.

source

pub fn counter_for_validators( &self ) -> StaticStorageAddress<DecodeStaticType<u32>, Yes, Yes, ()>

Counter for the related counted storage map

source

pub fn max_validators_count( &self ) -> StaticStorageAddress<DecodeStaticType<u32>, Yes, (), ()>

The maximum validator count before we stop allowing new validators to join.

When this value is not set, no limits are enforced.

source

pub fn nominators( &self, _0: impl Borrow<AccountId32> ) -> StaticStorageAddress<DecodeStaticType<Nominations>, Yes, (), Yes>

The map from nominator stash key to their nomination preferences, namely the validators that they wish to support.

Note that the keys of this storage map might become non-decodable in case the [Config::MaxNominations] configuration is decreased. In this rare case, these nominators are still existent in storage, their key is correct and retrievable (i.e. contains_key indicates that they exist), but their value cannot be decoded. Therefore, the non-decodable nominators will effectively not-exist, until they re-submit their preferences such that it is within the bounds of the newly set Config::MaxNominations.

This implies that ::iter_keys().count() and ::iter().count() might return different values for this map. Moreover, the main ::count() is aligned with the former, namely the number of keys that exist.

Lastly, if any of the nominators become non-decodable, they can be chilled immediately via [Call::chill_other] dispatchable by anyone.

TWOX-NOTE: SAFE since AccountId is a secure hash.

source

pub fn nominators_root( &self ) -> StaticStorageAddress<DecodeStaticType<Nominations>, (), (), Yes>

The map from nominator stash key to their nomination preferences, namely the validators that they wish to support.

Note that the keys of this storage map might become non-decodable in case the [Config::MaxNominations] configuration is decreased. In this rare case, these nominators are still existent in storage, their key is correct and retrievable (i.e. contains_key indicates that they exist), but their value cannot be decoded. Therefore, the non-decodable nominators will effectively not-exist, until they re-submit their preferences such that it is within the bounds of the newly set Config::MaxNominations.

This implies that ::iter_keys().count() and ::iter().count() might return different values for this map. Moreover, the main ::count() is aligned with the former, namely the number of keys that exist.

Lastly, if any of the nominators become non-decodable, they can be chilled immediately via [Call::chill_other] dispatchable by anyone.

TWOX-NOTE: SAFE since AccountId is a secure hash.

source

pub fn counter_for_nominators( &self ) -> StaticStorageAddress<DecodeStaticType<u32>, Yes, Yes, ()>

Counter for the related counted storage map

source

pub fn max_nominators_count( &self ) -> StaticStorageAddress<DecodeStaticType<u32>, Yes, (), ()>

The maximum nominator count before we stop allowing new validators to join.

When this value is not set, no limits are enforced.

source

pub fn current_era( &self ) -> StaticStorageAddress<DecodeStaticType<u32>, Yes, (), ()>

The current era index.

This is the latest planned era, depending on how the Session pallet queues the validator set, it might be active or not.

source

pub fn active_era( &self ) -> StaticStorageAddress<DecodeStaticType<ActiveEraInfo>, Yes, (), ()>

The active era information, it holds index and start.

The active era is the era being currently rewarded. Validator set of this era must be equal to [SessionInterface::validators].

source

pub fn eras_start_session_index( &self, _0: impl Borrow<u32> ) -> StaticStorageAddress<DecodeStaticType<u32>, Yes, (), Yes>

The session index at which the era start for the last HISTORY_DEPTH eras.

Note: This tracks the starting session (i.e. session index when era start being active) for the eras in [CurrentEra - HISTORY_DEPTH, CurrentEra].

source

pub fn eras_start_session_index_root( &self ) -> StaticStorageAddress<DecodeStaticType<u32>, (), (), Yes>

The session index at which the era start for the last HISTORY_DEPTH eras.

Note: This tracks the starting session (i.e. session index when era start being active) for the eras in [CurrentEra - HISTORY_DEPTH, CurrentEra].

source

pub fn eras_stakers( &self, _0: impl Borrow<u32>, _1: impl Borrow<AccountId32> ) -> StaticStorageAddress<DecodeStaticType<Exposure<AccountId32, u128>>, Yes, Yes, Yes>

Exposure of validator at era.

This is keyed first by the era index to allow bulk deletion and then the stash account.

Is it removed after HISTORY_DEPTH eras. If stakers hasn’t been set or has been removed then empty exposure is returned.

source

pub fn eras_stakers_root( &self ) -> StaticStorageAddress<DecodeStaticType<Exposure<AccountId32, u128>>, (), Yes, Yes>

Exposure of validator at era.

This is keyed first by the era index to allow bulk deletion and then the stash account.

Is it removed after HISTORY_DEPTH eras. If stakers hasn’t been set or has been removed then empty exposure is returned.

source

pub fn eras_stakers_clipped( &self, _0: impl Borrow<u32>, _1: impl Borrow<AccountId32> ) -> StaticStorageAddress<DecodeStaticType<Exposure<AccountId32, u128>>, Yes, Yes, Yes>

Clipped Exposure of validator at era.

This is similar to [ErasStakers] but number of nominators exposed is reduced to the T::MaxNominatorRewardedPerValidator biggest stakers. (Note: the field total and own of the exposure remains unchanged). This is used to limit the i/o cost for the nominator payout.

This is keyed fist by the era index to allow bulk deletion and then the stash account.

Is it removed after HISTORY_DEPTH eras. If stakers hasn’t been set or has been removed then empty exposure is returned.

source

pub fn eras_stakers_clipped_root( &self ) -> StaticStorageAddress<DecodeStaticType<Exposure<AccountId32, u128>>, (), Yes, Yes>

Clipped Exposure of validator at era.

This is similar to [ErasStakers] but number of nominators exposed is reduced to the T::MaxNominatorRewardedPerValidator biggest stakers. (Note: the field total and own of the exposure remains unchanged). This is used to limit the i/o cost for the nominator payout.

This is keyed fist by the era index to allow bulk deletion and then the stash account.

Is it removed after HISTORY_DEPTH eras. If stakers hasn’t been set or has been removed then empty exposure is returned.

source

pub fn eras_validator_prefs( &self, _0: impl Borrow<u32>, _1: impl Borrow<AccountId32> ) -> StaticStorageAddress<DecodeStaticType<ValidatorPrefs>, Yes, Yes, Yes>

Similar to ErasStakers, this holds the preferences of validators.

This is keyed first by the era index to allow bulk deletion and then the stash account.

Is it removed after HISTORY_DEPTH eras.

source

pub fn eras_validator_prefs_root( &self ) -> StaticStorageAddress<DecodeStaticType<ValidatorPrefs>, (), Yes, Yes>

Similar to ErasStakers, this holds the preferences of validators.

This is keyed first by the era index to allow bulk deletion and then the stash account.

Is it removed after HISTORY_DEPTH eras.

source

pub fn eras_validator_reward( &self, _0: impl Borrow<u32> ) -> StaticStorageAddress<DecodeStaticType<u128>, Yes, (), Yes>

The total validator era payout for the last HISTORY_DEPTH eras.

Eras that haven’t finished yet or has been removed doesn’t have reward.

source

pub fn eras_validator_reward_root( &self ) -> StaticStorageAddress<DecodeStaticType<u128>, (), (), Yes>

The total validator era payout for the last HISTORY_DEPTH eras.

Eras that haven’t finished yet or has been removed doesn’t have reward.

source

pub fn eras_reward_points( &self, _0: impl Borrow<u32> ) -> StaticStorageAddress<DecodeStaticType<EraRewardPoints<AccountId32>>, Yes, Yes, Yes>

Rewards for the last HISTORY_DEPTH eras. If reward hasn’t been set or has been removed then 0 reward is returned.

source

pub fn eras_reward_points_root( &self ) -> StaticStorageAddress<DecodeStaticType<EraRewardPoints<AccountId32>>, (), Yes, Yes>

Rewards for the last HISTORY_DEPTH eras. If reward hasn’t been set or has been removed then 0 reward is returned.

source

pub fn era_val_burned( &self ) -> StaticStorageAddress<DecodeStaticType<u128>, Yes, Yes, ()>

The amount of VAL burned during this era.

source

pub fn eras_total_stake( &self, _0: impl Borrow<u32> ) -> StaticStorageAddress<DecodeStaticType<u128>, Yes, Yes, Yes>

The total amount staked for the last HISTORY_DEPTH eras. If total hasn’t been set or has been removed then 0 stake is returned.

source

pub fn eras_total_stake_root( &self ) -> StaticStorageAddress<DecodeStaticType<u128>, (), Yes, Yes>

The total amount staked for the last HISTORY_DEPTH eras. If total hasn’t been set or has been removed then 0 stake is returned.

source

pub fn force_era( &self ) -> StaticStorageAddress<DecodeStaticType<Forcing>, Yes, Yes, ()>

Mode of era forcing.

source

pub fn slash_reward_fraction( &self ) -> StaticStorageAddress<DecodeStaticType<Perbill>, Yes, Yes, ()>

The percentage of the slash that is distributed to reporters.

The rest of the slashed value is handled by the Slash.

source

pub fn canceled_slash_payout( &self ) -> StaticStorageAddress<DecodeStaticType<u128>, Yes, Yes, ()>

The amount of currency given to reporters of a slash event which was canceled by extraordinary circumstances (e.g. governance).

source

pub fn unapplied_slashes( &self, _0: impl Borrow<u32> ) -> StaticStorageAddress<DecodeStaticType<Vec<UnappliedSlash<AccountId32, u128>>>, Yes, Yes, Yes>

All unapplied slashes that are queued for later.

source

pub fn unapplied_slashes_root( &self ) -> StaticStorageAddress<DecodeStaticType<Vec<UnappliedSlash<AccountId32, u128>>>, (), Yes, Yes>

All unapplied slashes that are queued for later.

source

pub fn bonded_eras( &self ) -> StaticStorageAddress<DecodeStaticType<Vec<(u32, u32)>>, Yes, Yes, ()>

A mapping from still-bonded eras to the first session index of that era.

Must contains information for eras for the range: [active_era - bounding_duration; active_era]

source

pub fn validator_slash_in_era( &self, _0: impl Borrow<u32>, _1: impl Borrow<AccountId32> ) -> StaticStorageAddress<DecodeStaticType<(Perbill, u128)>, Yes, (), Yes>

All slashing events on validators, mapped by era to the highest slash proportion and slash value of the era.

source

pub fn validator_slash_in_era_root( &self ) -> StaticStorageAddress<DecodeStaticType<(Perbill, u128)>, (), (), Yes>

All slashing events on validators, mapped by era to the highest slash proportion and slash value of the era.

source

pub fn nominator_slash_in_era( &self, _0: impl Borrow<u32>, _1: impl Borrow<AccountId32> ) -> StaticStorageAddress<DecodeStaticType<u128>, Yes, (), Yes>

All slashing events on nominators, mapped by era to the highest slash value of the era.

source

pub fn nominator_slash_in_era_root( &self ) -> StaticStorageAddress<DecodeStaticType<u128>, (), (), Yes>

All slashing events on nominators, mapped by era to the highest slash value of the era.

source

pub fn slashing_spans( &self, _0: impl Borrow<AccountId32> ) -> StaticStorageAddress<DecodeStaticType<SlashingSpans>, Yes, (), Yes>

Slashing spans for stash accounts.

source

pub fn slashing_spans_root( &self ) -> StaticStorageAddress<DecodeStaticType<SlashingSpans>, (), (), Yes>

Slashing spans for stash accounts.

source

pub fn span_slash( &self, _0: impl Borrow<AccountId32>, _1: impl Borrow<u32> ) -> StaticStorageAddress<DecodeStaticType<SpanRecord<u128>>, Yes, Yes, Yes>

Records information about the maximum slash of a stash within a slashing span, as well as how much reward has been paid out.

source

pub fn span_slash_root( &self ) -> StaticStorageAddress<DecodeStaticType<SpanRecord<u128>>, (), Yes, Yes>

Records information about the maximum slash of a stash within a slashing span, as well as how much reward has been paid out.

source

pub fn current_planned_session( &self ) -> StaticStorageAddress<DecodeStaticType<u32>, Yes, Yes, ()>

The last planned session scheduled by the session pallet.

This is basically in sync with the call to [pallet_session::SessionManager::new_session].

source

pub fn offending_validators( &self ) -> StaticStorageAddress<DecodeStaticType<Vec<(u32, bool)>>, Yes, Yes, ()>

Indices of validators that have offended in the active era and whether they are currently disabled.

This value should be a superset of disabled validators since not all offences lead to the validator being disabled (if there was no slash). This is needed to track the percentage of validators that have offended in the current era, ensuring a new era is forced if OffendingValidatorsThreshold is reached. The vec is always kept sorted so that we can find whether a given validator has previously offended using binary search. It gets cleared when the era ends.

source

pub fn chill_threshold( &self ) -> StaticStorageAddress<DecodeStaticType<Percent>, Yes, (), ()>

The threshold for when users can start calling chill_other for other validators / nominators. The threshold is compared to the actual number of validators / nominators (CountFor*) in the system compared to the configured max (Max*Count).

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> CheckedConversion for T

§

fn checked_from<T>(t: T) -> Option<Self>where Self: TryFrom<T>,

Convert from a value of T into an equivalent instance of Option<Self>. Read more
§

fn checked_into<T>(self) -> Option<T>where Self: TryInto<T>,

Consume self to return Some equivalent value of Option<T>. Read more
§

impl<T> Conv for T

§

fn conv<T>(self) -> Twhere Self: Into<T>,

Converts self into T using Into<T>. Read more
§

impl<T> Downcast for Twhere T: Any,

§

fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>

Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.
§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
§

fn as_any(&self) -> &(dyn Any + 'static)

Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.
§

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.
§

impl<T> DowncastSync for Twhere T: Any + Send + Sync,

§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Sync + Send + 'static>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.
§

impl<T> FmtForward for T

§

fn fmt_binary(self) -> FmtBinary<Self>where Self: Binary,

Causes self to use its Binary implementation when Debug-formatted.
§

fn fmt_display(self) -> FmtDisplay<Self>where Self: Display,

Causes self to use its Display implementation when Debug-formatted.
§

fn fmt_lower_exp(self) -> FmtLowerExp<Self>where Self: LowerExp,

Causes self to use its LowerExp implementation when Debug-formatted.
§

fn fmt_lower_hex(self) -> FmtLowerHex<Self>where Self: LowerHex,

Causes self to use its LowerHex implementation when Debug-formatted.
§

fn fmt_octal(self) -> FmtOctal<Self>where Self: Octal,

Causes self to use its Octal implementation when Debug-formatted.
§

fn fmt_pointer(self) -> FmtPointer<Self>where Self: Pointer,

Causes self to use its Pointer implementation when Debug-formatted.
§

fn fmt_upper_exp(self) -> FmtUpperExp<Self>where Self: UpperExp,

Causes self to use its UpperExp implementation when Debug-formatted.
§

fn fmt_upper_hex(self) -> FmtUpperHex<Self>where Self: UpperHex,

Causes self to use its UpperHex implementation when Debug-formatted.
§

fn fmt_list(self) -> FmtList<Self>where &'a Self: for<'a> IntoIterator,

Formats each item in a sequence. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for Twhere U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T> IsType<T> for T

§

fn from_ref(t: &T) -> &T

Cast reference.
§

fn into_ref(&self) -> &T

Cast reference.
§

fn from_mut(t: &mut T) -> &mut T

Cast mutable reference.
§

fn into_mut(&mut self) -> &mut T

Cast mutable reference.
§

impl<T, Outer> IsWrappedBy<Outer> for Twhere Outer: AsRef<T> + AsMut<T> + From<T>, T: From<Outer>,

§

fn from_ref(outer: &Outer) -> &T

Get a reference to the inner from the outer.

§

fn from_mut(outer: &mut Outer) -> &mut T

Get a mutable reference to the inner from the outer.

§

impl<T> Pipe for Twhere T: ?Sized,

§

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere Self: Sized,

Pipes by value. This is generally the method you want to use. Read more
§

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere R: 'a,

Borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere R: 'a,

Mutably borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> Rwhere Self: Borrow<B>, B: 'a + ?Sized, R: 'a,

Borrows self, then passes self.borrow() into the pipe function. Read more
§

fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R ) -> Rwhere Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.borrow_mut() into the pipe function. Read more
§

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> Rwhere Self: AsRef<U>, U: 'a + ?Sized, R: 'a,

Borrows self, then passes self.as_ref() into the pipe function.
§

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> Rwhere Self: AsMut<U>, U: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.as_mut() into the pipe function.
§

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> Rwhere Self: Deref<Target = T>, T: 'a + ?Sized, R: 'a,

Borrows self, then passes self.deref() into the pipe function.
§

fn pipe_deref_mut<'a, T, R>( &'a mut self, func: impl FnOnce(&'a mut T) -> R ) -> Rwhere Self: DerefMut<Target = T> + Deref, T: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.deref_mut() into the pipe function.
§

impl<T> Pointable for T

§

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<A> PureOrWrapped<A> for A

source§

fn is_pure(&self) -> bool

Not any data is wrapped.
source§

fn is_wrapped_regular(&self) -> bool

The entity is a wrapped Regular.
source§

fn is_wrapped(&self) -> bool

The entity is wrapped.
source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
§

impl<T> SaturatedConversion for T

§

fn saturated_from<T>(t: T) -> Selfwhere Self: UniqueSaturatedFrom<T>,

Convert from a value of T into an equivalent instance of Self. Read more
§

fn saturated_into<T>(self) -> Twhere Self: UniqueSaturatedInto<T>,

Consume self to return an equivalent value of T. Read more
§

impl<T> Tap for T

§

fn tap(self, func: impl FnOnce(&Self)) -> Self

Immutable access to a value. Read more
§

fn tap_mut(self, func: impl FnOnce(&mut Self)) -> Self

Mutable access to a value. Read more
§

fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Selfwhere Self: Borrow<B>, B: ?Sized,

Immutable access to the Borrow<B> of a value. Read more
§

fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere Self: BorrowMut<B>, B: ?Sized,

Mutable access to the BorrowMut<B> of a value. Read more
§

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Selfwhere Self: AsRef<R>, R: ?Sized,

Immutable access to the AsRef<R> view of a value. Read more
§

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere Self: AsMut<R>, R: ?Sized,

Mutable access to the AsMut<R> view of a value. Read more
§

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Selfwhere Self: Deref<Target = T>, T: ?Sized,

Immutable access to the Deref::Target of a value. Read more
§

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere Self: DerefMut<Target = T> + Deref, T: ?Sized,

Mutable access to the Deref::Target of a value. Read more
§

fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls .tap() only in debug builds, and is erased in release builds.
§

fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls .tap_mut() only in debug builds, and is erased in release builds.
§

fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Selfwhere Self: Borrow<B>, B: ?Sized,

Calls .tap_borrow() only in debug builds, and is erased in release builds.
§

fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Selfwhere Self: BorrowMut<B>, B: ?Sized,

Calls .tap_borrow_mut() only in debug builds, and is erased in release builds.
§

fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Selfwhere Self: AsRef<R>, R: ?Sized,

Calls .tap_ref() only in debug builds, and is erased in release builds.
§

fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Selfwhere Self: AsMut<R>, R: ?Sized,

Calls .tap_ref_mut() only in debug builds, and is erased in release builds.
§

fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Selfwhere Self: Deref<Target = T>, T: ?Sized,

Calls .tap_deref() only in debug builds, and is erased in release builds.
§

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Selfwhere Self: DerefMut<Target = T> + Deref, T: ?Sized,

Calls .tap_deref_mut() only in debug builds, and is erased in release builds.
§

impl<T> TryConv for T

§

fn try_conv<T>(self) -> Result<T, Self::Error>where Self: TryInto<T>,

Attempts to convert self into T using TryInto<T>. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<S, T> UncheckedInto<T> for Swhere T: UncheckedFrom<S>,

§

fn unchecked_into(self) -> T

The counterpart to unchecked_from.
§

impl<T, S> UniqueSaturatedInto<T> for Swhere T: Bounded, S: TryInto<T>,

§

fn unique_saturated_into(self) -> T

Consume self to return an equivalent value of T.
§

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

§

fn vzip(self) -> V

source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
§

impl<T> JsonSchemaMaybe for T

§

impl<T> MaybeRefUnwindSafe for Twhere T: RefUnwindSafe,

§

impl<T> MaybeSend for Twhere T: Send,