Enum noble_collective::Call [−][src]
Dispatchable calls.
Each variant of this enum maps to a dispatchable function from the associated module.
Variants
set_members(Vec<T::AccountId>, Option<T::AccountId>, MemberCount)
Set the collective’s membership.
new_members
: The new member list. Be nice to the chain and provide it sorted.prime
: The prime member whose vote sets the default.old_count
: The upper bound for the previous number of members in storage. Used for weight estimation.
Requires root origin.
NOTE: Does not enforce the expected MaxMembers
limit on the amount of members, but
the weight estimations rely on it to estimate dispatchable weight.
Weight
O(MP + N)
where:M
old-members-count (code- and governance-bounded)N
new-members-count (code- and governance-bounded)P
proposals-count (code-bounded)
- DB:
- 1 storage mutation (codec
O(M)
read,O(N)
write) for reading and writing the members - 1 storage read (codec
O(P)
) for reading the proposals P
storage mutations (codecO(M)
) for updating the votes for each proposal- 1 storage write (codec
O(1)
) for deleting the oldprime
and setting the new one
- 1 storage mutation (codec
Dispatch a proposal from a member using the Member
origin.
Origin must be a member of the collective.
Weight
O(M + P)
whereM
members-count (code-bounded) andP
complexity of dispatchingproposal
- DB: 1 read (codec
O(M)
) + DB access ofproposal
- 1 event
propose(MemberCount, Box<<T as Config<I>>::Proposal>, u32)
Add a new proposal to either be voted on or executed directly.
Requires the sender to be member.
threshold
determines whether proposal
is executed directly (threshold < 2
)
or put up for voting.
Weight
O(B + M + P1)
orO(B + M + P2)
where:B
isproposal
size in bytes (length-fee-bounded)M
is members-count (code- and governance-bounded)- branching is influenced by
threshold
where:P1
is proposal execution complexity (threshold < 2
)P2
is proposals-count (code-bounded) (threshold >= 2
)
- DB:
- 1 storage read
is_member
(codecO(M)
) - 1 storage read
ProposalOf::contains_key
(codecO(1)
) - DB accesses influenced by
threshold
:- EITHER storage accesses done by
proposal
(threshold < 2
) - OR proposal insertion (
threshold <= 2
)- 1 storage mutation
Proposals
(codecO(P2)
) - 1 storage mutation
ProposalCount
(codecO(1)
) - 1 storage write
ProposalOf
(codecO(B)
) - 1 storage write
Voting
(codecO(M)
)
- 1 storage mutation
- EITHER storage accesses done by
- 1 event
- 1 storage read
vote(T::Hash, ProposalIndex, bool)
Add an aye or nay vote for the sender to the given proposal.
Requires the sender to be a member.
Transaction fees will be waived if the member is voting on any particular proposal for the first time and the call is successful. Subsequent vote changes will charge a fee.
Weight
O(M)
whereM
is members-count (code- and governance-bounded)- DB:
- 1 storage read
Members
(codecO(M)
) - 1 storage mutation
Voting
(codecO(M)
)
- 1 storage read
- 1 event
close(T::Hash, ProposalIndex, Weight, u32)
Close a vote that is either approved, disapproved or whose voting period has ended.
May be called by any signed account in order to finish voting and close the proposal.
If called before the end of the voting period it will only close the vote if it is has enough votes to be approved or disapproved.
If called after the end of the voting period abstentions are counted as rejections unless there is a prime member set and the prime member cast an approval.
If the close operation completes successfully with disapproval, the transaction fee will be waived. Otherwise execution of the approved operation will be charged to the caller.
proposal_weight_bound
: The maximum amount of weight consumed by executing the closed proposal.length_bound
: The upper bound for the length of the proposal in storage. Checked viastorage::read
so it issize_of::<u32>() == 4
larger than the pure length.
Weight
O(B + M + P1 + P2)
where:B
isproposal
size in bytes (length-fee-bounded)M
is members-count (code- and governance-bounded)P1
is the complexity ofproposal
preimage.P2
is proposal-count (code-bounded)
- DB:
- 2 storage reads (
Members
: codecO(M)
,Prime
: codecO(1)
) - 3 mutations (
Voting
: codecO(M)
,ProposalOf
: codecO(B)
,Proposals
: codecO(P2)
) - any mutations done while executing
proposal
(P1
) - up to 3 events
disapprove_proposal(T::Hash)
Disapprove a proposal, close, and remove it from the system, regardless of its current state.
Must be called by the Root origin.
Parameters:
proposal_hash
: The hash of the proposal that should be disapproved.
Complexity: O(P) where P is the number of max proposals DB Weight:
- Reads: Proposals
- Writes: Voting, Proposals, ProposalOf
Trait Implementations
impl<T: Config<I>, I: Instance> Clone for Call<T, I>
[src]
fn clone(&self) -> Self
[src]
pub fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<T: Config<I>, I: Instance> Debug for Call<T, I>
[src]
impl<T: Config<I>, I: Instance> Decode for Call<T, I> where
Vec<T::AccountId>: Decode,
Vec<T::AccountId>: Decode,
Option<T::AccountId>: Decode,
Option<T::AccountId>: Decode,
Box<<T as Config<I>>::Proposal>: Decode,
Box<<T as Config<I>>::Proposal>: Decode,
Box<<T as Config<I>>::Proposal>: Decode,
Box<<T as Config<I>>::Proposal>: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
[src]
Vec<T::AccountId>: Decode,
Vec<T::AccountId>: Decode,
Option<T::AccountId>: Decode,
Option<T::AccountId>: Decode,
Box<<T as Config<I>>::Proposal>: Decode,
Box<<T as Config<I>>::Proposal>: Decode,
Box<<T as Config<I>>::Proposal>: Decode,
Box<<T as Config<I>>::Proposal>: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
fn decode<__CodecInputEdqy: Input>(
__codec_input_edqy: &mut __CodecInputEdqy
) -> Result<Self, Error>
[src]
__codec_input_edqy: &mut __CodecInputEdqy
) -> Result<Self, Error>
pub fn skip<I>(input: &mut I) -> Result<(), Error> where
I: Input,
[src]
I: Input,
pub fn encoded_fixed_size() -> Option<usize>
[src]
impl<T: Config<I>, I: Instance> Encode for Call<T, I> where
Vec<T::AccountId>: Encode,
Vec<T::AccountId>: Encode,
Option<T::AccountId>: Encode,
Option<T::AccountId>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
[src]
Vec<T::AccountId>: Encode,
Vec<T::AccountId>: Encode,
Option<T::AccountId>: Encode,
Option<T::AccountId>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
fn encode_to<__CodecOutputEdqy: Output + ?Sized>(
&self,
__codec_dest_edqy: &mut __CodecOutputEdqy
)
[src]
&self,
__codec_dest_edqy: &mut __CodecOutputEdqy
)
pub fn size_hint(&self) -> usize
[src]
pub fn encode(&self) -> Vec<u8, Global>
[src]
pub fn using_encoded<R, F>(&self, f: F) -> R where
F: FnOnce(&[u8]) -> R,
[src]
F: FnOnce(&[u8]) -> R,
pub fn encoded_size(&self) -> usize
[src]
impl<T: Config<I>, I: Instance> EncodeLike<Call<T, I>> for Call<T, I> where
Vec<T::AccountId>: Encode,
Vec<T::AccountId>: Encode,
Option<T::AccountId>: Encode,
Option<T::AccountId>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
[src]
Vec<T::AccountId>: Encode,
Vec<T::AccountId>: Encode,
Option<T::AccountId>: Encode,
Option<T::AccountId>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
Box<<T as Config<I>>::Proposal>: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
impl<T: Config<I>, I: Instance> Eq for Call<T, I>
[src]
impl<T: Config<I>, I: Instance> GetCallName for Call<T, I>
[src]
fn get_call_name(&self) -> &'static str
[src]
fn get_call_names() -> &'static [&'static str]
[src]
impl<T: Config<I>, I: Instance> GetDispatchInfo for Call<T, I>
[src]
fn get_dispatch_info(&self) -> DispatchInfo
[src]
impl<T: Config<I>, I: Instance> PartialEq<Call<T, I>> for Call<T, I>
[src]
impl<T: Config<I>, I: Instance> UnfilteredDispatchable for Call<T, I>
[src]
type Origin = <T as Config>::Origin
The origin type of the runtime, (i.e. fabric_system::Config::Origin
).
fn dispatch_bypass_filter(
self,
_origin: Self::Origin
) -> DispatchResultWithPostInfo
[src]
self,
_origin: Self::Origin
) -> DispatchResultWithPostInfo
Auto Trait Implementations
impl<T, I> RefUnwindSafe for Call<T, I> where
I: RefUnwindSafe,
T: RefUnwindSafe,
<T as Config>::AccountId: RefUnwindSafe,
<T as Config>::Hash: RefUnwindSafe,
<T as Config<I>>::Proposal: RefUnwindSafe,
I: RefUnwindSafe,
T: RefUnwindSafe,
<T as Config>::AccountId: RefUnwindSafe,
<T as Config>::Hash: RefUnwindSafe,
<T as Config<I>>::Proposal: RefUnwindSafe,
impl<T, I> Send for Call<T, I> where
I: Send,
T: Send,
<T as Config<I>>::Proposal: Send,
I: Send,
T: Send,
<T as Config<I>>::Proposal: Send,
impl<T, I> Sync for Call<T, I> where
I: Sync,
T: Sync,
<T as Config<I>>::Proposal: Sync,
I: Sync,
T: Sync,
<T as Config<I>>::Proposal: Sync,
impl<T, I> Unpin for Call<T, I> where
I: Unpin,
T: Unpin,
<T as Config>::AccountId: Unpin,
<T as Config>::Hash: Unpin,
I: Unpin,
T: Unpin,
<T as Config>::AccountId: Unpin,
<T as Config>::Hash: Unpin,
impl<T, I> UnwindSafe for Call<T, I> where
I: UnwindSafe,
T: UnwindSafe,
<T as Config>::AccountId: UnwindSafe,
<T as Config>::Hash: UnwindSafe,
<T as Config<I>>::Proposal: UnwindSafe,
I: UnwindSafe,
T: UnwindSafe,
<T as Config>::AccountId: UnwindSafe,
<T as Config>::Hash: UnwindSafe,
<T as Config<I>>::Proposal: UnwindSafe,
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,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> CheckedConversion for T
[src]
pub fn checked_from<T>(t: T) -> Option<Self> where
Self: TryFrom<T>,
[src]
Self: TryFrom<T>,
pub fn checked_into<T>(self) -> Option<T> where
Self: TryInto<T>,
[src]
Self: TryInto<T>,
impl<S> Codec for S where
S: Decode + Encode,
[src]
S: Decode + Encode,
impl<T> DecodeAll for T where
T: Decode,
[src]
T: Decode,
impl<T> DecodeLimit for T where
T: Decode,
[src]
T: Decode,
pub fn decode_all_with_depth_limit(limit: u32, input: &[u8]) -> Result<T, Error>
[src]
pub fn decode_with_depth_limit(limit: u32, input: &[u8]) -> Result<T, Error>
[src]
impl<T> Downcast for T where
T: Any,
T: Any,
pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn as_any(&self) -> &(dyn Any + 'static)
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
impl<T> DowncastSync for T where
T: Any + Send + Sync,
T: Any + Send + Sync,
impl<T> DynClone for T where
T: Clone,
[src]
T: Clone,
pub fn __clone_box(&self, Private) -> *mut ()
[src]
impl<'_, '_, T> EncodeLike<&'_ &'_ T> for T where
T: Encode,
[src]
T: Encode,
impl<'_, T> EncodeLike<&'_ T> for T where
T: Encode,
[src]
T: Encode,
impl<'_, T> EncodeLike<&'_ mut T> for T where
T: Encode,
[src]
T: Encode,
impl<T> EncodeLike<Arc<T>> for T where
T: Encode,
[src]
T: Encode,
impl<T> EncodeLike<Box<T, Global>> for T where
T: Encode,
[src]
T: Encode,
impl<'a, T> EncodeLike<Cow<'a, T>> for T where
T: ToOwned + Encode,
[src]
T: ToOwned + Encode,
impl<T> EncodeLike<Rc<T>> for T where
T: Encode,
[src]
T: Encode,
impl<T> From<T> for T
[src]
impl<S> FullCodec for S where
S: Decode + FullEncode,
[src]
S: Decode + FullEncode,
impl<S> FullEncode for S where
S: Encode + EncodeLike<S>,
[src]
S: Encode + EncodeLike<S>,
impl<T> Hashable for T where
T: Codec,
[src]
T: Codec,
pub fn blake2_128(&self) -> [u8; 16]
[src]
pub fn blake2_256(&self) -> [u8; 32]
[src]
pub fn blake2_128_concat(&self) -> Vec<u8, Global>
[src]
pub fn twox_128(&self) -> [u8; 16]
[src]
pub fn twox_256(&self) -> [u8; 32]
[src]
pub fn twox_64_concat(&self) -> Vec<u8, Global>
[src]
pub fn identity(&self) -> Vec<u8, Global>
[src]
impl<T> Instrument for T
[src]
pub fn instrument(self, span: Span) -> Instrumented<Self>
[src]
pub fn in_current_span(self) -> Instrumented<Self>
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> IsType<T> for T
[src]
pub fn from_ref(t: &T) -> &T
[src]
pub fn into_ref(&self) -> &T
[src]
pub fn from_mut(t: &mut T) -> &mut T
[src]
pub fn into_mut(&mut self) -> &mut T
[src]
impl<T, Outer> IsWrappedBy<Outer> for T where
T: From<Outer>,
Outer: AsRef<T> + AsMut<T> + From<T>,
[src]
T: From<Outer>,
Outer: AsRef<T> + AsMut<T> + From<T>,
pub fn from_ref(outer: &Outer) -> &T
[src]
Get a reference to the inner from the outer.
pub fn from_mut(outer: &mut Outer) -> &mut T
[src]
Get a mutable reference to the inner from the outer.
impl<T> KeyedVec for T where
T: Codec,
[src]
T: Codec,
impl<T> MaybeDebug for T where
T: Debug,
T: Debug,
impl<T> MaybeDebug for T where
T: Debug,
T: Debug,
impl<T> MaybeRefUnwindSafe for T where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Member for T where
T: 'static + Send + Sync + Debug + Eq + PartialEq<T> + Clone,
[src]
T: 'static + Send + Sync + Debug + Eq + PartialEq<T> + Clone,
impl<T> Parameter for T where
T: Codec + EncodeLike<T> + Clone + Eq + Debug,
[src]
T: Codec + EncodeLike<T> + Clone + Eq + Debug,
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<T> SaturatedConversion for T
pub fn saturated_from<T>(t: T) -> Self where
Self: UniqueSaturatedFrom<T>,
Self: UniqueSaturatedFrom<T>,
pub fn saturated_into<T>(self) -> T where
Self: UniqueSaturatedInto<T>,
Self: UniqueSaturatedInto<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
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.
pub 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.
pub 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>,
pub fn unchecked_into(self) -> T
[src]
impl<T, S> UniqueSaturatedInto<T> for S where
T: Bounded,
S: TryInto<T>,
T: Bounded,
S: TryInto<T>,
pub fn unique_saturated_into(self) -> T
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,