pub struct Pallet<T>(_);
Expand description
The pallet implementing the on-chain logic.
Implementations
sourceimpl<T: Config> Pallet<T>
impl<T: Config> Pallet<T>
sourcepub fn signed_submissions() -> SignedSubmissions<T>
pub fn signed_submissions() -> SignedSubmissions<T>
Self
accessor for SignedSubmission<T>
.
sourcepub fn finalize_signed_phase() -> bool
pub fn finalize_signed_phase() -> bool
Finish the signed phase. Process the signed submissions from best to worse until a valid one is found, rewarding the best one and slashing the invalid ones along the way.
Returns true if we have a good solution in the signed phase.
This drains the SignedSubmissions
, potentially storing the best valid one in
QueuedSolution
.
This is a self-weighing function, it automatically registers its weight internally when being called.
sourcepub fn finalize_signed_phase_accept_solution(
ready_solution: ReadySolution<T>,
who: &T::AccountId,
deposit: BalanceOf<T>,
call_fee: BalanceOf<T>
)
pub fn finalize_signed_phase_accept_solution(
ready_solution: ReadySolution<T>,
who: &T::AccountId,
deposit: BalanceOf<T>,
call_fee: BalanceOf<T>
)
Helper function for the case where a solution is accepted in the signed phase.
Extracted to facilitate with weight calculation.
Infallible
sourcepub fn finalize_signed_phase_reject_solution(
who: &T::AccountId,
deposit: BalanceOf<T>
)
pub fn finalize_signed_phase_reject_solution(
who: &T::AccountId,
deposit: BalanceOf<T>
)
Helper function for the case where a solution is accepted in the rejected phase.
Extracted to facilitate with weight calculation.
Infallible
sourcepub fn solution_weight_of(
raw_solution: &RawSolution<SolutionOf<T::MinerConfig>>,
size: SolutionOrSnapshotSize
) -> Weight
pub fn solution_weight_of(
raw_solution: &RawSolution<SolutionOf<T::MinerConfig>>,
size: SolutionOrSnapshotSize
) -> Weight
The weight of the given raw solution.
sourcepub fn deposit_for(
raw_solution: &RawSolution<SolutionOf<T::MinerConfig>>,
size: SolutionOrSnapshotSize
) -> BalanceOf<T>
pub fn deposit_for(
raw_solution: &RawSolution<SolutionOf<T::MinerConfig>>,
size: SolutionOrSnapshotSize
) -> BalanceOf<T>
Collect a sufficient deposit to store this solution.
The deposit is composed of 3 main elements:
- base deposit, fixed for all submissions.
- a per-byte deposit, for renting the state usage.
- a per-weight deposit, for the potential weight usage in an upcoming on_initialize
sourceimpl<T: Config> Pallet<T>
impl<T: Config> Pallet<T>
sourcepub fn mine_solution(
) -> Result<(RawSolution<SolutionOf<T::MinerConfig>>, SolutionOrSnapshotSize), MinerError>
pub fn mine_solution(
) -> Result<(RawSolution<SolutionOf<T::MinerConfig>>, SolutionOrSnapshotSize), MinerError>
Mine a new npos solution.
The Npos Solver type, S
, must have the same AccountId and Error type as the
crate::Config::Solver
in order to create a unified return type.
sourcepub fn restore_or_compute_then_maybe_submit() -> Result<(), MinerError>
pub fn restore_or_compute_then_maybe_submit() -> Result<(), MinerError>
Attempt to restore a solution from cache. Otherwise, compute it fresh. Either way, submit if our call’s score is greater than that of the cached solution.
sourcepub fn mine_check_save_submit() -> Result<(), MinerError>
pub fn mine_check_save_submit() -> Result<(), MinerError>
Mine a new solution, cache it, and submit it back to the chain as an unsigned transaction.
sourcepub fn mine_checked_call() -> Result<Call<T>, MinerError>
pub fn mine_checked_call() -> Result<Call<T>, MinerError>
Mine a new solution as a call. Performs all checks.
pub fn basic_checks(
raw_solution: &RawSolution<SolutionOf<T::MinerConfig>>,
solution_type: &str
) -> Result<(), MinerError>
sourcepub fn mine_and_check(
) -> Result<(RawSolution<SolutionOf<T::MinerConfig>>, SolutionOrSnapshotSize), MinerError>
pub fn mine_and_check(
) -> Result<(RawSolution<SolutionOf<T::MinerConfig>>, SolutionOrSnapshotSize), MinerError>
Mine a new npos solution, with all the relevant checks to make sure that it will be accepted to the chain.
If you want an unchecked solution, use Pallet::mine_solution
.
If you want a checked solution and submit it at the same time, use
Pallet::mine_check_save_submit
.
sourcepub fn ensure_offchain_repeat_frequency(
now: T::BlockNumber
) -> Result<(), MinerError>
pub fn ensure_offchain_repeat_frequency(
now: T::BlockNumber
) -> Result<(), MinerError>
Checks if an execution of the offchain worker is permitted at the given block number, or not.
This makes sure that
- we don’t run on previous blocks in case of a re-org
- we don’t run twice within a window of length
T::OffchainRepeat
.
Returns Ok(())
if offchain worker limit is respected, Err(reason)
otherwise. If Ok()
is returned, now
is written in storage and will be used in further calls as the baseline.
sourcepub fn unsigned_pre_dispatch_checks(
raw_solution: &RawSolution<SolutionOf<T::MinerConfig>>
) -> DispatchResult
pub fn unsigned_pre_dispatch_checks(
raw_solution: &RawSolution<SolutionOf<T::MinerConfig>>
) -> DispatchResult
Do the basics checks that MUST happen during the validation and pre-dispatch of an unsigned transaction.
Can optionally also be called during dispatch, if needed.
NOTE: Ideally, these tests should move more and more outside of this and more to the miner’s code, so that we do less and less storage reads here.
sourceimpl<T: Config> Pallet<T>
impl<T: Config> Pallet<T>
sourcepub fn submit_unsigned(
origin: OriginFor<T>,
raw_solution: Box<RawSolution<SolutionOf<T::MinerConfig>>>,
witness: SolutionOrSnapshotSize
) -> DispatchResult
pub fn submit_unsigned(
origin: OriginFor<T>,
raw_solution: Box<RawSolution<SolutionOf<T::MinerConfig>>>,
witness: SolutionOrSnapshotSize
) -> DispatchResult
Submit a solution for the unsigned phase.
The dispatch origin fo this call must be none.
This submission is checked on the fly. Moreover, this unsigned solution is only validated when submitted to the pool from the local node. Effectively, this means that only active validators can submit this transaction when authoring a block (similar to an inherent).
To prevent any incorrect solution (and thus wasted time/weight), this transaction will panic if the solution submitted by the validator is invalid in any way, effectively putting their authoring reward at risk.
No deposit or reward is associated with this submission.
sourcepub fn set_minimum_untrusted_score(
origin: OriginFor<T>,
maybe_next_score: Option<ElectionScore>
) -> DispatchResult
pub fn set_minimum_untrusted_score(
origin: OriginFor<T>,
maybe_next_score: Option<ElectionScore>
) -> DispatchResult
Set a new value for MinimumUntrustedScore
.
Dispatch origin must be aligned with T::ForceOrigin
.
This check can be turned off by setting the value to None
.
sourcepub fn set_emergency_election_result(
origin: OriginFor<T>,
supports: Supports<T::AccountId>
) -> DispatchResult
pub fn set_emergency_election_result(
origin: OriginFor<T>,
supports: Supports<T::AccountId>
) -> DispatchResult
Set a solution in the queue, to be handed out to the client of this pallet in the next
call to ElectionProvider::elect
.
This can only be set by T::ForceOrigin
, and only when the phase is Emergency
.
The solution is not checked for any feasibility and is assumed to be trustworthy, as any feasibility check itself can in principle cause the election process to fail (due to memory/weight constrains).
sourcepub fn submit(
origin: OriginFor<T>,
raw_solution: Box<RawSolution<SolutionOf<T::MinerConfig>>>
) -> DispatchResult
pub fn submit(
origin: OriginFor<T>,
raw_solution: Box<RawSolution<SolutionOf<T::MinerConfig>>>
) -> DispatchResult
Submit a solution for the signed phase.
The dispatch origin fo this call must be signed.
The solution is potentially queued, based on the claimed score and processed at the end of the signed phase.
A deposit is reserved and recorded for the solution. Based on the outcome, the solution might be rewarded, slashed, or get all or a part of the deposit back.
sourcepub fn governance_fallback(
origin: OriginFor<T>,
maybe_max_voters: Option<u32>,
maybe_max_targets: Option<u32>
) -> DispatchResult
pub fn governance_fallback(
origin: OriginFor<T>,
maybe_max_voters: Option<u32>,
maybe_max_targets: Option<u32>
) -> DispatchResult
Trigger the governance fallback.
This can only be called when Phase::Emergency
is enabled, as an alternative to
calling Call::set_emergency_election_result
.
sourceimpl<T: Config> Pallet<T>
impl<T: Config> Pallet<T>
sourcepub fn current_phase() -> Phase<T::BlockNumber>
pub fn current_phase() -> Phase<T::BlockNumber>
Current phase.
sourceimpl<T: Config> Pallet<T>
impl<T: Config> Pallet<T>
sourcepub fn queued_solution() -> Option<ReadySolution<T>>
pub fn queued_solution() -> Option<ReadySolution<T>>
Current best solution, signed or unsigned, queued to be returned upon elect
.
sourceimpl<T: Config> Pallet<T>
impl<T: Config> Pallet<T>
sourcepub fn snapshot() -> Option<RoundSnapshot<T>>
pub fn snapshot() -> Option<RoundSnapshot<T>>
Snapshot data of the round.
This is created at the beginning of the signed phase and cleared upon calling elect
.
sourceimpl<T: Config> Pallet<T>
impl<T: Config> Pallet<T>
sourcepub fn desired_targets() -> Option<u32>
pub fn desired_targets() -> Option<u32>
Desired number of targets to elect for this round.
Only exists when Snapshot
is present.
sourceimpl<T: Config> Pallet<T>
impl<T: Config> Pallet<T>
sourcepub fn snapshot_metadata() -> Option<SolutionOrSnapshotSize>
pub fn snapshot_metadata() -> Option<SolutionOrSnapshotSize>
The metadata of the RoundSnapshot
Only exists when Snapshot
is present.
sourceimpl<T: Config> Pallet<T>
impl<T: Config> Pallet<T>
sourcepub fn minimum_untrusted_score() -> Option<ElectionScore>
pub fn minimum_untrusted_score() -> Option<ElectionScore>
The minimum score that each ‘untrusted’ solution must attain in order to be considered feasible.
Can be set via set_minimum_untrusted_score
.
sourceimpl<T: Config> Pallet<T>
impl<T: Config> Pallet<T>
sourcepub fn create_snapshot() -> Result<(), ElectionError<T>>
pub fn create_snapshot() -> Result<(), ElectionError<T>>
Creates the snapshot. Writes new data to:
Returns Ok(())
if operation is okay.
This is a self-weighing function, it will register its own extra weight as
DispatchClass::Mandatory
with the system pallet.
sourcepub fn kill_snapshot()
pub fn kill_snapshot()
Kill everything created by Pallet::create_snapshot
.
sourcepub fn feasibility_check(
raw_solution: RawSolution<SolutionOf<T::MinerConfig>>,
compute: ElectionCompute
) -> Result<ReadySolution<T>, FeasibilityError>
pub fn feasibility_check(
raw_solution: RawSolution<SolutionOf<T::MinerConfig>>,
compute: ElectionCompute
) -> Result<ReadySolution<T>, FeasibilityError>
Checks the feasibility of a solution.
Trait Implementations
sourceimpl<T: Config> Benchmarking for Pallet<T>where
T: Config,
impl<T: Config> Benchmarking for Pallet<T>where
T: Config,
sourcefn benchmarks(extra: bool) -> Vec<BenchmarkMetadata> ⓘ
fn benchmarks(extra: bool) -> Vec<BenchmarkMetadata> ⓘ
sourcefn run_benchmark(
extrinsic: &[u8],
c: &[(BenchmarkParameter, u32)],
whitelist: &[TrackedStorageKey],
verify: bool,
internal_repeats: u32
) -> Result<Vec<BenchmarkResult>, BenchmarkError>
fn run_benchmark(
extrinsic: &[u8],
c: &[(BenchmarkParameter, u32)],
whitelist: &[TrackedStorageKey],
verify: bool,
internal_repeats: u32
) -> Result<Vec<BenchmarkResult>, BenchmarkError>
sourceimpl<T: Config> ElectionProvider for Pallet<T>
impl<T: Config> ElectionProvider for Pallet<T>
sourceimpl<T: Config> ElectionProviderBase for Pallet<T>
impl<T: Config> ElectionProviderBase for Pallet<T>
type BlockNumber = <T as Config>::BlockNumber
type BlockNumber = <T as Config>::BlockNumber
type Error = ElectionError<T>
type Error = ElectionError<T>
type MaxWinners = <T as Config>::MaxWinners
type MaxWinners = <T as Config>::MaxWinners
type DataProvider = <T as Config>::DataProvider
type DataProvider = <T as Config>::DataProvider
sourcefn desired_targets_checked() -> Result<u32, &'static str>
fn desired_targets_checked() -> Result<u32, &'static str>
Self::DataProvider::desired_targets()
ensuring the value never exceeds
Self::MaxWinners
. Read moresourceimpl<T: Config> GetStorageVersion for Pallet<T>
impl<T: Config> GetStorageVersion for Pallet<T>
sourcefn current_storage_version() -> StorageVersion
fn current_storage_version() -> StorageVersion
sourcefn on_chain_storage_version() -> StorageVersion
fn on_chain_storage_version() -> StorageVersion
sourceimpl<T: Config> Hooks<<T as Config>::BlockNumber> for Pallet<T>
impl<T: Config> Hooks<<T as Config>::BlockNumber> for Pallet<T>
sourcefn on_initialize(now: T::BlockNumber) -> Weight
fn on_initialize(now: T::BlockNumber) -> Weight
sourcefn offchain_worker(now: T::BlockNumber)
fn offchain_worker(now: T::BlockNumber)
sourcefn integrity_test()
fn integrity_test()
sourcefn on_finalize(_n: BlockNumber)
fn on_finalize(_n: BlockNumber)
sourcefn on_idle(_n: BlockNumber, _remaining_weight: Weight) -> Weight
fn on_idle(_n: BlockNumber, _remaining_weight: Weight) -> Weight
on_finalize
).
Implement to have something happen using the remaining weight.
Will not fire if the remaining weight is 0.
Return the weight used, the hook will subtract it from current weight used
and pass the result to the next on_idle
hook if it exists. Read moresourcefn on_runtime_upgrade() -> Weight
fn on_runtime_upgrade() -> Weight
sourcefn try_state(_n: BlockNumber) -> Result<(), &'static str>
fn try_state(_n: BlockNumber) -> Result<(), &'static str>
sourceimpl<T: Config> IntegrityTest for Pallet<T>
impl<T: Config> IntegrityTest for Pallet<T>
sourcefn integrity_test()
fn integrity_test()
sourceimpl<T: Config> OffchainWorker<<T as Config>::BlockNumber> for Pallet<T>
impl<T: Config> OffchainWorker<<T as Config>::BlockNumber> for Pallet<T>
sourcefn offchain_worker(n: <T as Config>::BlockNumber)
fn offchain_worker(n: <T as Config>::BlockNumber)
sourceimpl<T: Config> OnFinalize<<T as Config>::BlockNumber> for Pallet<T>
impl<T: Config> OnFinalize<<T as Config>::BlockNumber> for Pallet<T>
sourcefn on_finalize(n: <T as Config>::BlockNumber)
fn on_finalize(n: <T as Config>::BlockNumber)
sourceimpl<T: Config> OnGenesis for Pallet<T>
impl<T: Config> OnGenesis for Pallet<T>
sourcefn on_genesis()
fn on_genesis()
sourceimpl<T: Config> OnIdle<<T as Config>::BlockNumber> for Pallet<T>
impl<T: Config> OnIdle<<T as Config>::BlockNumber> for Pallet<T>
sourcefn on_idle(n: <T as Config>::BlockNumber, remaining_weight: Weight) -> Weight
fn on_idle(n: <T as Config>::BlockNumber, remaining_weight: Weight) -> Weight
remaining_weight
to make sure it is high enough to allow for
your pallet’s extra computation. Read moresourceimpl<T: Config> OnInitialize<<T as Config>::BlockNumber> for Pallet<T>
impl<T: Config> OnInitialize<<T as Config>::BlockNumber> for Pallet<T>
sourcefn on_initialize(n: <T as Config>::BlockNumber) -> Weight
fn on_initialize(n: <T as Config>::BlockNumber) -> Weight
sourceimpl<T: Config> OnRuntimeUpgrade for Pallet<T>
impl<T: Config> OnRuntimeUpgrade for Pallet<T>
sourcefn on_runtime_upgrade() -> Weight
fn on_runtime_upgrade() -> Weight
sourcefn pre_upgrade() -> Result<Vec<u8>, &'static str>
fn pre_upgrade() -> Result<Vec<u8>, &'static str>
sourceimpl<T: Config> PalletInfoAccess for Pallet<T>
impl<T: Config> PalletInfoAccess for Pallet<T>
sourcefn module_name() -> &'static str
fn module_name() -> &'static str
sourcefn crate_version() -> CrateVersion
fn crate_version() -> CrateVersion
sourceimpl<T: Config> PalletsInfoAccess for Pallet<T>
impl<T: Config> PalletsInfoAccess for Pallet<T>
sourceimpl<T: Config> StorageInfoTrait for Pallet<T>
impl<T: Config> StorageInfoTrait for Pallet<T>
fn storage_info() -> Vec<StorageInfo> ⓘ
sourceimpl<T: Config> TryState<<T as Config>::BlockNumber> for Pallet<T>
impl<T: Config> TryState<<T as Config>::BlockNumber> for Pallet<T>
sourcefn try_state(
n: <T as Config>::BlockNumber,
_s: TryStateSelect
) -> Result<(), &'static str>
fn try_state(
n: <T as Config>::BlockNumber,
_s: TryStateSelect
) -> Result<(), &'static str>
sourceimpl<T: Config> ValidateUnsigned for Pallet<T>
impl<T: Config> ValidateUnsigned for Pallet<T>
sourcefn validate_unsigned(
source: TransactionSource,
call: &Self::Call
) -> TransactionValidity
fn validate_unsigned(
source: TransactionSource,
call: &Self::Call
) -> TransactionValidity
sourcefn pre_dispatch(call: &Self::Call) -> Result<(), TransactionValidityError>
fn pre_dispatch(call: &Self::Call) -> Result<(), TransactionValidityError>
sourceimpl<T: Config> WhitelistedStorageKeys for Pallet<T>
impl<T: Config> WhitelistedStorageKeys for Pallet<T>
sourcefn whitelisted_storage_keys() -> Vec<TrackedStorageKey> ⓘ
fn whitelisted_storage_keys() -> Vec<TrackedStorageKey> ⓘ
Vec<TrackedStorageKey>
indicating the storage keys that
should be whitelisted during benchmarking. This means that those keys
will be excluded from the benchmarking performance calculation. Read moreimpl<T> Eq for Pallet<T>
Auto Trait Implementations
impl<T> RefUnwindSafe for Pallet<T>where
T: RefUnwindSafe,
impl<T> Send for Pallet<T>where
T: Send,
impl<T> Sync for Pallet<T>where
T: Sync,
impl<T> Unpin for Pallet<T>where
T: Unpin,
impl<T> UnwindSafe for Pallet<T>where
T: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
sourceimpl<T> CheckedConversion for T
impl<T> CheckedConversion for T
sourcefn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
sourcefn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
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
. Read morefn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read morefn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read morefn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read moresourceimpl<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,
sourcefn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
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
sourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
sourceimpl<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>,
sourceimpl<T> PalletVersionToStorageVersionHelper for Twhere
T: GetStorageVersion + PalletInfoAccess,
impl<T> PalletVersionToStorageVersionHelper for Twhere
T: GetStorageVersion + PalletInfoAccess,
fn migrate(db_weight: &RuntimeDbWeight) -> Weight
impl<T> Pointable for T
impl<T> Pointable for T
sourceimpl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
sourcefn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
sourcefn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
T
. Read moreimpl<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>
self
from the equivalent element of its
superset. Read morefn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset
but without any property checks. Always succeeds.fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self
to the equivalent element of its superset.sourceimpl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
sourcefn unchecked_into(self) -> T
fn unchecked_into(self) -> T
unchecked_from
.sourceimpl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
impl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
sourcefn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T
.