pub enum Call<T: Config<I>, I: 'static = ()> {
    bid {
        value: <<T as Config<I>>::Currency as Currency<<T as Config>::AccountId>>::Balance,
    },
    unbid {
        pos: u32,
    },
    vouch {
        who: <<T as Config>::Lookup as StaticLookup>::Source,
        value: <<T as Config<I>>::Currency as Currency<<T as Config>::AccountId>>::Balance,
        tip: <<T as Config<I>>::Currency as Currency<<T as Config>::AccountId>>::Balance,
    },
    unvouch {
        pos: u32,
    },
    vote {
        candidate: <<T as Config>::Lookup as StaticLookup>::Source,
        approve: bool,
    },
    defender_vote {
        approve: bool,
    },
    payout {},
    found {
        founder: <<T as Config>::Lookup as StaticLookup>::Source,
        max_members: u32,
        rules: Vec<u8>,
    },
    unfound {},
    judge_suspended_member {
        who: <<T as Config>::Lookup as StaticLookup>::Source,
        forgive: bool,
    },
    judge_suspended_candidate {
        who: <<T as Config>::Lookup as StaticLookup>::Source,
        judgement: Judgement,
    },
    set_max_members {
        max: u32,
    },
    // some variants omitted
}
Expand description

Contains one variant per dispatchable that can be called by an extrinsic.

Variants§

§

bid

Fields

§value: <<T as Config<I>>::Currency as Currency<<T as Config>::AccountId>>::Balance

A user outside of the society can make a bid for entry.

Payment: CandidateDeposit will be reserved for making a bid. It is returned when the bid becomes a member, or if the bid calls unbid.

The dispatch origin for this call must be Signed.

Parameters:

  • value: A one time payment the bid would like to receive when joining the society.

Key: B (len of bids), C (len of candidates), M (len of members), X (balance reserve)

  • Storage Reads:
    • One storage read to check for suspended candidate. O(1)
    • One storage read to check for suspended member. O(1)
    • One storage read to retrieve all current bids. O(B)
    • One storage read to retrieve all current candidates. O(C)
    • One storage read to retrieve all members. O(M)
  • Storage Writes:
    • One storage mutate to add a new bid to the vector O(B) (TODO: possible optimization w/ read)
    • Up to one storage removal if bid.len() > MAX_BID_COUNT. O(1)
  • Notable Computation:
    • O(B + C + log M) search to check user is not already a part of society.
    • O(log B) search to insert the new bid sorted.
  • External Pallet Operations:
    • One balance reserve operation. O(X)
    • Up to one balance unreserve operation if bids.len() > MAX_BID_COUNT.
  • Events:
    • One event for new bid.
    • Up to one event for AutoUnbid if bid.len() > MAX_BID_COUNT.

Total Complexity: O(M + B + C + logM + logB + X)

§

unbid

Fields

§pos: u32

A bidder can remove their bid for entry into society. By doing so, they will have their candidate deposit returned or they will unvouch their voucher.

Payment: The bid deposit is unreserved if the user made a bid.

The dispatch origin for this call must be Signed and a bidder.

Parameters:

  • pos: Position in the Bids vector of the bid who wants to unbid.

Key: B (len of bids), X (balance unreserve)

  • One storage read and write to retrieve and update the bids. O(B)
  • Either one unreserve balance action O(X) or one vouching storage removal. O(1)
  • One event.

Total Complexity: O(B + X)

§

vouch

Fields

§who: <<T as Config>::Lookup as StaticLookup>::Source
§value: <<T as Config<I>>::Currency as Currency<<T as Config>::AccountId>>::Balance
§tip: <<T as Config<I>>::Currency as Currency<<T as Config>::AccountId>>::Balance

As a member, vouch for someone to join society by placing a bid on their behalf.

There is no deposit required to vouch for a new bid, but a member can only vouch for one bid at a time. If the bid becomes a suspended candidate and ultimately rejected by the suspension judgement origin, the member will be banned from vouching again.

As a vouching member, you can claim a tip if the candidate is accepted. This tip will be paid as a portion of the reward the member will receive for joining the society.

The dispatch origin for this call must be Signed and a member.

Parameters:

  • who: The user who you would like to vouch for.
  • value: The total reward to be paid between you and the candidate if they become a member in the society.
  • tip: Your cut of the total value payout when the candidate is inducted into the society. Tips larger than value will be saturated upon payout.

Key: B (len of bids), C (len of candidates), M (len of members)

  • Storage Reads:
    • One storage read to retrieve all members. O(M)
    • One storage read to check member is not already vouching. O(1)
    • One storage read to check for suspended candidate. O(1)
    • One storage read to check for suspended member. O(1)
    • One storage read to retrieve all current bids. O(B)
    • One storage read to retrieve all current candidates. O(C)
  • Storage Writes:
    • One storage write to insert vouching status to the member. O(1)
    • One storage mutate to add a new bid to the vector O(B) (TODO: possible optimization w/ read)
    • Up to one storage removal if bid.len() > MAX_BID_COUNT. O(1)
  • Notable Computation:
    • O(log M) search to check sender is a member.
    • O(B + C + log M) search to check user is not already a part of society.
    • O(log B) search to insert the new bid sorted.
  • External Pallet Operations:
    • One balance reserve operation. O(X)
    • Up to one balance unreserve operation if bids.len() > MAX_BID_COUNT.
  • Events:
    • One event for vouch.
    • Up to one event for AutoUnbid if bid.len() > MAX_BID_COUNT.

Total Complexity: O(M + B + C + logM + logB + X)

§

unvouch

Fields

§pos: u32

As a vouching member, unvouch a bid. This only works while vouched user is only a bidder (and not a candidate).

The dispatch origin for this call must be Signed and a vouching member.

Parameters:

  • pos: Position in the Bids vector of the bid who should be unvouched.

Key: B (len of bids)

  • One storage read O(1) to check the signer is a vouching member.
  • One storage mutate to retrieve and update the bids. O(B)
  • One vouching storage removal. O(1)
  • One event.

Total Complexity: O(B)

§

vote

Fields

§candidate: <<T as Config>::Lookup as StaticLookup>::Source
§approve: bool

As a member, vote on a candidate.

The dispatch origin for this call must be Signed and a member.

Parameters:

  • candidate: The candidate that the member would like to bid on.
  • approve: A boolean which says if the candidate should be approved (true) or rejected (false).

Key: C (len of candidates), M (len of members)

  • One storage read O(M) and O(log M) search to check user is a member.
  • One account lookup.
  • One storage read O(C) and O(C) search to check that user is a candidate.
  • One storage write to add vote to votes. O(1)
  • One event.

Total Complexity: O(M + logM + C)

§

defender_vote

Fields

§approve: bool

As a member, vote on the defender.

The dispatch origin for this call must be Signed and a member.

Parameters:

  • approve: A boolean which says if the candidate should be approved (true) or rejected (false).

  • Key: M (len of members)
  • One storage read O(M) and O(log M) search to check user is a member.
  • One storage write to add vote to votes. O(1)
  • One event.

Total Complexity: O(M + logM)

§

payout

Fields

Transfer the first matured payout for the sender and remove it from the records.

NOTE: This extrinsic needs to be called multiple times to claim multiple matured payouts.

Payment: The member will receive a payment equal to their first matured payout to their free balance.

The dispatch origin for this call must be Signed and a member with payouts remaining.

Key: M (len of members), P (number of payouts for a particular member)

  • One storage read O(M) and O(log M) search to check signer is a member.
  • One storage read O(P) to get all payouts for a member.
  • One storage read O(1) to get the current block number.
  • One currency transfer call. O(X)
  • One storage write or removal to update the member’s payouts. O(P)

Total Complexity: O(M + logM + P + X)

§

found

Fields

§founder: <<T as Config>::Lookup as StaticLookup>::Source
§max_members: u32
§rules: Vec<u8>

Found the society.

This is done as a discrete action in order to allow for the pallet to be included into a running chain and can only be done once.

The dispatch origin for this call must be from the FounderSetOrigin.

Parameters:

  • founder - The first member and head of the newly founded society.
  • max_members - The initial max number of members for the society.
  • rules - The rules of this society concerning membership.

  • Two storage mutates to set Head and Founder. O(1)
  • One storage write to add the first member to society. O(1)
  • One event.

Total Complexity: O(1)

§

unfound

Fields

Annul the founding of the society.

The dispatch origin for this call must be Signed, and the signing account must be both the Founder and the Head. This implies that it may only be done when there is one member.

  • Two storage reads O(1).
  • Four storage removals O(1).
  • One event.

Total Complexity: O(1)

§

judge_suspended_member

Fields

§who: <<T as Config>::Lookup as StaticLookup>::Source
§forgive: bool

Allow suspension judgement origin to make judgement on a suspended member.

If a suspended member is forgiven, we simply add them back as a member, not affecting any of the existing storage items for that member.

If a suspended member is rejected, remove all associated storage items, including their payouts, and remove any vouched bids they currently have.

The dispatch origin for this call must be from the SuspensionJudgementOrigin.

Parameters:

  • who - The suspended member to be judged.
  • forgive - A boolean representing whether the suspension judgement origin forgives (true) or rejects (false) a suspended member.

Key: B (len of bids), M (len of members)

  • One storage read to check who is a suspended member. O(1)
  • Up to one storage write O(M) with O(log M) binary search to add a member back to society.
  • Up to 3 storage removals O(1) to clean up a removed member.
  • Up to one storage write O(B) with O(B) search to remove vouched bid from bids.
  • Up to one additional event if unvouch takes place.
  • One storage removal. O(1)
  • One event for the judgement.

Total Complexity: O(M + logM + B)

§

judge_suspended_candidate

Fields

§who: <<T as Config>::Lookup as StaticLookup>::Source
§judgement: Judgement

Allow suspended judgement origin to make judgement on a suspended candidate.

If the judgement is Approve, we add them to society as a member with the appropriate payment for joining society.

If the judgement is Reject, we either slash the deposit of the bid, giving it back to the society treasury, or we ban the voucher from vouching again.

If the judgement is Rebid, we put the candidate back in the bid pool and let them go through the induction process again.

The dispatch origin for this call must be from the SuspensionJudgementOrigin.

Parameters:

  • who - The suspended candidate to be judged.
  • judgement - Approve, Reject, or Rebid.

Key: B (len of bids), M (len of members), X (balance action)

  • One storage read to check who is a suspended candidate.
  • One storage removal of the suspended candidate.
  • Approve Logic
    • One storage read to get the available pot to pay users with. O(1)
    • One storage write to update the available pot. O(1)
    • One storage read to get the current block number. O(1)
    • One storage read to get all members. O(M)
    • Up to one unreserve currency action.
    • Up to two new storage writes to payouts.
    • Up to one storage write with O(log M) binary search to add a member to society.
  • Reject Logic
    • Up to one repatriate reserved currency action. O(X)
    • Up to one storage write to ban the vouching member from vouching again.
  • Rebid Logic
    • Storage mutate with O(log B) binary search to place the user back into bids.
  • Up to one additional event if unvouch takes place.
  • One storage removal.
  • One event for the judgement.

Total Complexity: O(M + logM + B + X)

§

set_max_members

Fields

§max: u32

Allows root origin to change the maximum number of members in society. Max membership count must be greater than 1.

The dispatch origin for this call must be from ROOT.

Parameters:

  • max - The maximum number of members for the society.

  • One storage write to update the max. O(1)
  • One event.

Total Complexity: O(1)

Implementations§

source§

impl<T: Config<I>, I: 'static> Call<T, I>

source

pub fn new_call_variant_bid( value: <<T as Config<I>>::Currency as Currency<<T as Config>::AccountId>>::Balance ) -> Self

Create a call with the variant bid.

source

pub fn new_call_variant_unbid(pos: u32) -> Self

Create a call with the variant unbid.

source

pub fn new_call_variant_vouch( who: <<T as Config>::Lookup as StaticLookup>::Source, value: <<T as Config<I>>::Currency as Currency<<T as Config>::AccountId>>::Balance, tip: <<T as Config<I>>::Currency as Currency<<T as Config>::AccountId>>::Balance ) -> Self

Create a call with the variant vouch.

source

pub fn new_call_variant_unvouch(pos: u32) -> Self

Create a call with the variant unvouch.

source

pub fn new_call_variant_vote( candidate: <<T as Config>::Lookup as StaticLookup>::Source, approve: bool ) -> Self

Create a call with the variant vote.

source

pub fn new_call_variant_defender_vote(approve: bool) -> Self

Create a call with the variant defender_vote.

source

pub fn new_call_variant_payout() -> Self

Create a call with the variant payout.

source

pub fn new_call_variant_found( founder: <<T as Config>::Lookup as StaticLookup>::Source, max_members: u32, rules: Vec<u8> ) -> Self

Create a call with the variant found.

source

pub fn new_call_variant_unfound() -> Self

Create a call with the variant unfound.

source

pub fn new_call_variant_judge_suspended_member( who: <<T as Config>::Lookup as StaticLookup>::Source, forgive: bool ) -> Self

Create a call with the variant judge_suspended_member.

source

pub fn new_call_variant_judge_suspended_candidate( who: <<T as Config>::Lookup as StaticLookup>::Source, judgement: Judgement ) -> Self

Create a call with the variant judge_suspended_candidate.

source

pub fn new_call_variant_set_max_members(max: u32) -> Self

Create a call with the variant set_max_members.

Trait Implementations§

source§

impl<T: Config<I>, I: 'static> Clone for Call<T, I>

source§

fn clone(&self) -> Self

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl<T: Config<I>, I: 'static> Debug for Call<T, I>

source§

fn fmt(&self, fmt: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<T: Config<I>, I: 'static> Decode for Call<T, I>

source§

fn decode<__CodecInputEdqy: Input>( __codec_input_edqy: &mut __CodecInputEdqy ) -> Result<Self, Error>

Attempt to deserialise the value from input.
source§

fn skip<I>(input: &mut I) -> Result<(), Error>where I: Input,

Attempt to skip the encoded value from input. Read more
source§

fn encoded_fixed_size() -> Option<usize>

Returns the fixed encoded size of the type. Read more
source§

impl<T: Config<I>, I: 'static> Encode for Call<T, I>

source§

fn encode_to<__CodecOutputEdqy: Output + ?Sized>( &self, __codec_dest_edqy: &mut __CodecOutputEdqy )

Convert self to a slice and append it to the destination.
source§

fn size_hint(&self) -> usize

If possible give a hint of expected size of the encoding. Read more
source§

fn encode(&self) -> Vec<u8, Global>

Convert self to an owned vector.
source§

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.
source§

fn encoded_size(&self) -> usize

Calculates the encoded size. Read more
source§

impl<T: Config<I>, I: 'static> GetCallName for Call<T, I>

source§

fn get_call_name(&self) -> &'static str

Return the function name of the Call.
source§

fn get_call_names() -> &'static [&'static str]

Return all function names.
source§

impl<T: Config<I>, I: 'static> GetDispatchInfo for Call<T, I>

source§

fn get_dispatch_info(&self) -> DispatchInfo

👎Deprecated: Trait has moved to frame_support::dispatch
source§

impl<T: Config<I>, I: 'static> GetDispatchInfo for Call<T, I>

source§

fn get_dispatch_info(&self) -> DispatchInfo

Return a DispatchInfo, containing relevant information of this dispatch. Read more
source§

impl<T: Config<I>, I: 'static> PartialEq<Call<T, I>> for Call<T, I>

source§

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl<T, I> TypeInfo for Call<T, I>where PhantomData<(T, I)>: TypeInfo + 'static, <<T as Config<I>>::Currency as Currency<<T as Config>::AccountId>>::Balance: TypeInfo + 'static, <<T as Config>::Lookup as StaticLookup>::Source: TypeInfo + 'static, T: Config<I> + 'static, I: 'static,

§

type Identity = Call<T, I>

The type identifying for which type info is provided. Read more
source§

fn type_info() -> Type

Returns the static type identifier for Self.
source§

impl<T: Config<I>, I: 'static> UnfilteredDispatchable for Call<T, I>

§

type RuntimeOrigin = <T as Config>::RuntimeOrigin

The origin type of the runtime, (i.e. frame_system::Config::RuntimeOrigin).
source§

fn dispatch_bypass_filter( self, origin: Self::RuntimeOrigin ) -> DispatchResultWithPostInfo

Dispatch this call but do not check the filter in origin.
source§

impl<T: Config<I>, I: 'static> EncodeLike<Call<T, I>> for Call<T, I>

source§

impl<T: Config<I>, I: 'static> Eq for Call<T, I>

Auto Trait Implementations§

§

impl<T, I> RefUnwindSafe for Call<T, I>where I: RefUnwindSafe, T: RefUnwindSafe, <<T as Config<I>>::Currency as Currency<<T as Config>::AccountId>>::Balance: RefUnwindSafe, <<T as Config>::Lookup as StaticLookup>::Source: RefUnwindSafe,

§

impl<T, I> Send for Call<T, I>where I: Send, T: Send, <<T as Config<I>>::Currency as Currency<<T as Config>::AccountId>>::Balance: Send, <<T as Config>::Lookup as StaticLookup>::Source: Send,

§

impl<T, I> Sync for Call<T, I>where I: Sync, T: Sync, <<T as Config<I>>::Currency as Currency<<T as Config>::AccountId>>::Balance: Sync, <<T as Config>::Lookup as StaticLookup>::Source: Sync,

§

impl<T, I> Unpin for Call<T, I>where I: Unpin, T: Unpin, <<T as Config<I>>::Currency as Currency<<T as Config>::AccountId>>::Balance: Unpin, <<T as Config>::Lookup as StaticLookup>::Source: Unpin,

§

impl<T, I> UnwindSafe for Call<T, I>where I: UnwindSafe, T: UnwindSafe, <<T as Config<I>>::Currency as Currency<<T as Config>::AccountId>>::Balance: UnwindSafe, <<T as Config>::Lookup as StaticLookup>::Source: UnwindSafe,

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,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> CheckedConversion for T

source§

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
source§

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

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

impl<T> Conv for T

source§

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

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

impl<T> DecodeAll for Twhere T: Decode,

source§

fn decode_all(input: &mut &[u8]) -> Result<T, Error>

Decode Self and consume all of the given input data. Read more
source§

impl<T> DecodeLimit for Twhere T: Decode,

source§

fn decode_all_with_depth_limit( limit: u32, input: &mut &[u8] ) -> Result<T, Error>

Decode Self and consume all of the given input data. Read more
source§

fn decode_with_depth_limit<I>(limit: u32, input: &mut I) -> Result<T, Error>where I: Input,

Decode Self with the given maximum recursion depth and advance input by the number of bytes consumed. Read more
source§

impl<T> Downcast for Twhere T: Any,

source§

fn into_any(self: Box<T, Global>) -> Box<dyn Any, 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.
source§

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

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

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.
source§

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.
source§

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

source§

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

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

impl<T> DynClone for Twhere T: Clone,

source§

fn __clone_box(&self, _: Private) -> *mut ()

source§

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> FmtForward for T

source§

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Hashable for Twhere T: Codec,

source§

fn blake2_128(&self) -> [u8; 16]

source§

fn blake2_256(&self) -> [u8; 32]

source§

fn blake2_128_concat(&self) -> Vec<u8, Global>

source§

fn twox_128(&self) -> [u8; 16]

source§

fn twox_256(&self) -> [u8; 32]

source§

fn twox_64_concat(&self) -> Vec<u8, Global>

source§

fn identity(&self) -> Vec<u8, Global>

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>,

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.

source§

impl<T> IsType<T> for T

source§

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

Cast reference.
source§

fn into_ref(&self) -> &T

Cast reference.
source§

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

Cast mutable reference.
source§

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

Cast mutable reference.
source§

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

source§

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

Get a reference to the inner from the outer.

source§

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

Get a mutable reference to the inner from the outer.

source§

impl<T> KeyedVec for Twhere T: Codec,

source§

fn to_keyed_vec(&self, prepend_key: &[u8]) -> Vec<u8, Global>

Return an encoding of Self prepended by given slice.
source§

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

source§

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
source§

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
source§

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
source§

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
source§

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
source§

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.
source§

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.
source§

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.
source§

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.
source§

impl<T> Pointable for T

source§

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

The alignment of pointer.
§

type Init = T

The type for initializers.
source§

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

Initializes a with the given initializer. Read more
source§

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

Dereferences the given pointer. Read more
source§

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

Mutably dereferences the given pointer. Read more
source§

unsafe fn drop(ptr: usize)

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

impl<T> Same<T> for T

§

type Output = T

Should always be Self
source§

impl<T> SaturatedConversion for T

source§

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

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

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

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

impl<T> Tap for T

source§

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

Immutable access to a value. Read more
source§

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

Mutable access to a value. Read more
source§

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
source§

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
source§

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
source§

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
source§

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
source§

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
source§

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

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

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

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

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.
source§

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.
source§

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.
source§

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.
source§

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.
source§

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.
source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T> TryConv for T

source§

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.
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.
source§

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

Performs the conversion.
source§

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

source§

fn unchecked_into(self) -> T

The counterpart to unchecked_from.
source§

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

source§

fn unique_saturated_into(self) -> T

Consume self to return an equivalent value of T.
source§

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

source§

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
source§

impl<S> Codec for Swhere S: Decode + Encode,

source§

impl<T> EncodeLike<&&T> for Twhere T: Encode,

source§

impl<T> EncodeLike<&T> for Twhere T: Encode,

source§

impl<T> EncodeLike<&mut T> for Twhere T: Encode,

source§

impl<T> EncodeLike<Arc<T>> for Twhere T: Encode,

source§

impl<T> EncodeLike<Box<T, Global>> for Twhere T: Encode,

source§

impl<'a, T> EncodeLike<Cow<'a, T>> for Twhere T: ToOwned + Encode,

source§

impl<T> EncodeLike<Rc<T>> for Twhere T: Encode,

source§

impl<S> FullCodec for Swhere S: Decode + FullEncode,

source§

impl<S> FullEncode for Swhere S: Encode + EncodeLike<S>,

source§

impl<T> MaybeDebug for Twhere T: Debug,

source§

impl<T> MaybeDebug for Twhere T: Debug,

source§

impl<T> MaybeRefUnwindSafe for Twhere T: RefUnwindSafe,

source§

impl<T> Member for Twhere T: Send + Sync + Debug + Eq + PartialEq<T> + Clone + 'static,

source§

impl<T> Parameter for Twhere T: Codec + EncodeLike<T> + Clone + Eq + Debug + TypeInfo,

source§

impl<T> StaticTypeInfo for Twhere T: TypeInfo + 'static,