Enum pallet_tips::Call [−][src]
pub enum Call<T: Config> { report_awesome(Vec<u8>, T::AccountId), retract_tip(T::Hash), tip_new(Vec<u8>, T::AccountId, BalanceOf<T>), tip(T::Hash, BalanceOf<T>), close_tip(T::Hash), slash_tip(T::Hash), // some variants omitted }
Expand description
Dispatchable calls.
Each variant of this enum maps to a dispatchable function from the associated module.
Variants
Report something reason
that deserves a tip and claim any eventual the finder’s fee.
The dispatch origin for this call must be Signed.
Payment: TipReportDepositBase
will be reserved from the origin account, as well as
DataDepositPerByte
for each byte in reason
.
reason
: The reason for, or the thing that deserves, the tip; generally this will be a UTF-8-encoded URL.who
: The account which should be credited for the tip.
Emits NewTip
if successful.
- Complexity:
O(R)
whereR
length ofreason
.- encoding and hashing of ‘reason’
- DbReads:
Reasons
,Tips
- DbWrites:
Reasons
,Tips
retract_tip(T::Hash)
Retract a prior tip-report from report_awesome
, and cancel the process of tipping.
If successful, the original deposit will be unreserved.
The dispatch origin for this call must be Signed and the tip identified by hash
must have been reported by the signing account through report_awesome
(and not
through tip_new
).
hash
: The identity of the open tip for which a tip value is declared. This is formed as the hash of the tuple of the original tipreason
and the beneficiary account ID.
Emits TipRetracted
if successful.
- Complexity:
O(1)
- Depends on the length of
T::Hash
which is fixed.
- Depends on the length of
- DbReads:
Tips
,origin account
- DbWrites:
Reasons
,Tips
,origin account
Give a tip for something new; no finder’s fee will be taken.
The dispatch origin for this call must be Signed and the signing account must be a
member of the Tippers
set.
reason
: The reason for, or the thing that deserves, the tip; generally this will be a UTF-8-encoded URL.who
: The account which should be credited for the tip.tip_value
: The amount of tip that the sender would like to give. The median tip value of active tippers will be given to thewho
.
Emits NewTip
if successful.
- Complexity:
O(R + T)
whereR
length ofreason
,T
is the number of tippers.O(T)
: decodingTipper
vec of lengthT
T
is charged as upper bound given byContainsLengthBound
. The actual cost depends on the implementation ofT::Tippers
.O(R)
: hashing and encoding of reason of lengthR
- DbReads:
Tippers
,Reasons
- DbWrites:
Reasons
,Tips
Declare a tip value for an already-open tip.
The dispatch origin for this call must be Signed and the signing account must be a
member of the Tippers
set.
hash
: The identity of the open tip for which a tip value is declared. This is formed as the hash of the tuple of the hash of the original tipreason
and the beneficiary account ID.tip_value
: The amount of tip that the sender would like to give. The median tip value of active tippers will be given to thewho
.
Emits TipClosing
if the threshold of tippers has been reached and the countdown period
has started.
-
Complexity:
O(T)
whereT
is the number of tippers. decodingTipper
vec of lengthT
, insert tip and check closing,T
is charged as upper bound given byContainsLengthBound
. The actual cost depends on the implementation ofT::Tippers
.Actually weight could be lower as it depends on how many tips are in
OpenTip
but it is weighted as if almost full i.e of lengthT-1
. -
DbReads:
Tippers
,Tips
-
DbWrites:
Tips
close_tip(T::Hash)
Close and payout a tip.
The dispatch origin for this call must be Signed.
The tip identified by hash
must have finished its countdown period.
hash
: The identity of the open tip for which a tip value is declared. This is formed as the hash of the tuple of the original tipreason
and the beneficiary account ID.
- Complexity:
O(T)
whereT
is the number of tippers. decodingTipper
vec of lengthT
.T
is charged as upper bound given byContainsLengthBound
. The actual cost depends on the implementation ofT::Tippers
. - DbReads:
Tips
,Tippers
,tip finder
- DbWrites:
Reasons
,Tips
,Tippers
,tip finder
slash_tip(T::Hash)
Remove and slash an already-open tip.
May only be called from T::RejectOrigin
.
As a result, the finder is slashed and the deposits are lost.
Emits TipSlashed
if successful.
T
is charged as upper bound given by ContainsLengthBound
.
The actual cost depends on the implementation of T::Tippers
.
Trait Implementations
impl<T: Config> Decode for Call<T> where
T::AccountId: Decode,
T::AccountId: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::AccountId: Decode,
T::AccountId: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
BalanceOf<T>: HasCompact,
BalanceOf<T>: HasCompact,
impl<T: Config> Decode for Call<T> where
T::AccountId: Decode,
T::AccountId: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::AccountId: Decode,
T::AccountId: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
T::Hash: Decode,
BalanceOf<T>: HasCompact,
BalanceOf<T>: HasCompact,
Attempt to deserialise the value from input.
Attempt to skip the encoded value from input. Read more
fn encoded_fixed_size() -> Option<usize>
fn encoded_fixed_size() -> Option<usize>
Returns the fixed encoded size of the type. Read more
impl<T: Config> Encode for Call<T> where
T::AccountId: Encode,
T::AccountId: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::AccountId: Encode,
T::AccountId: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
BalanceOf<T>: HasCompact,
BalanceOf<T>: HasCompact,
impl<T: Config> Encode for Call<T> where
T::AccountId: Encode,
T::AccountId: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::AccountId: Encode,
T::AccountId: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
BalanceOf<T>: HasCompact,
BalanceOf<T>: HasCompact,
Convert self to a slice and append it to the destination.
fn using_encoded<R, F>(&self, f: F) -> R where
F: FnOnce(&[u8]) -> R,
fn using_encoded<R, F>(&self, f: F) -> R where
F: FnOnce(&[u8]) -> R,
Convert self to a slice and then invoke the given closure with it.
fn encoded_size(&self) -> usize
fn encoded_size(&self) -> usize
Calculates the encoded size. Read more
Return the function name of the Call.
Return all function names.
Return a DispatchInfo
, containing relevant information of this dispatch. Read more
Dispatch this call but do not check the filter in origin.
impl<T: Config> EncodeLike<Call<T>> for Call<T> where
T::AccountId: Encode,
T::AccountId: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::AccountId: Encode,
T::AccountId: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
T::Hash: Encode,
BalanceOf<T>: HasCompact,
BalanceOf<T>: HasCompact,
Auto Trait Implementations
impl<T> RefUnwindSafe for Call<T> where
T: RefUnwindSafe,
<T as Config>::AccountId: RefUnwindSafe,
<<T as Config<()>>::Currency as Currency<<T as Config>::AccountId>>::Balance: RefUnwindSafe,
<T as Config>::Hash: RefUnwindSafe,
impl<T> Send for Call<T> where
T: Send,
<<T as Config<()>>::Currency as Currency<<T as Config>::AccountId>>::Balance: Send,
impl<T> Sync for Call<T> where
T: Sync,
<<T as Config<()>>::Currency as Currency<<T as Config>::AccountId>>::Balance: Sync,
impl<T> Unpin for Call<T> where
T: Unpin,
<T as Config>::AccountId: Unpin,
<<T as Config<()>>::Currency as Currency<<T as Config>::AccountId>>::Balance: Unpin,
<T as Config>::Hash: Unpin,
impl<T> UnwindSafe for Call<T> where
T: UnwindSafe,
<T as Config>::AccountId: UnwindSafe,
<<T as Config<()>>::Currency as Currency<<T as Config>::AccountId>>::Balance: UnwindSafe,
<T as Config>::Hash: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
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
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub 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
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub 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. Read more
Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
type Output = T
type Output = T
Should always be Self
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
The counterpart to unchecked_from
.
Consume self to return an equivalent value of T
.
pub fn vzip(self) -> V
impl<'_, '_, T> EncodeLike<&'_ &'_ T> for T where
T: Encode,
impl<'_, T> EncodeLike<&'_ T> for T where
T: Encode,
impl<'_, T> EncodeLike<&'_ mut T> for T where
T: Encode,
impl<T> EncodeLike<Arc<T>> for T where
T: Encode,
impl<T> EncodeLike<Rc<T>> for T where
T: Encode,
impl<T> MaybeDebug for T where
T: Debug,
impl<T> MaybeDebug for T where
T: Debug,