pub struct NamespacePricingConfig<T: Config> {
pub deposit_per_byte: <<T as Config>::Currency as Currency<<T as Config>::AccountId>>::Balance,
pub base_fee: <<T as Config>::Currency as Currency<<T as Config>::AccountId>>::Balance,
pub count_midpoint: u32,
pub fee_steepness: Percent,
pub max_fee_multiplier: u32,
}
Fields§
§deposit_per_byte: <<T as Config>::Currency as Currency<<T as Config>::AccountId>>::Balance
Tokens held per byte inserted.
base_fee: <<T as Config>::Currency as Currency<<T as Config>::AccountId>>::Balance
Used as the base fee for the logistic function that calculates the fees based on the amount of namespace entries for a given agent.
count_midpoint: u32
The logistic function’s midpoint. The function is performed over the number of namespace entries the agent has registered. The midpoint determines at how many entries for that agent the price reaches it’s mid-point.
fee_steepness: Percent
How steep the pricing increase is.
max_fee_multiplier: u32
The maximum multiplier for the base fee.
Implementations§
Source§impl<T: Config> NamespacePricingConfig<T>
impl<T: Config> NamespacePricingConfig<T>
Sourcepub fn namespace_fee(
&self,
account_namespace_count: u32,
) -> Result<<<T as Config>::Currency as Currency<<T as Config>::AccountId>>::Balance, DispatchError>
pub fn namespace_fee( &self, account_namespace_count: u32, ) -> Result<<<T as Config>::Currency as Currency<<T as Config>::AccountId>>::Balance, DispatchError>
Calculate namespace cost using sigmoid pricing model.
Sourcepub fn namespace_deposit(
&self,
path: &NamespacePath,
) -> <<T as Config>::Currency as Currency<<T as Config>::AccountId>>::Balance
pub fn namespace_deposit( &self, path: &NamespacePath, ) -> <<T as Config>::Currency as Currency<<T as Config>::AccountId>>::Balance
Calculates the deposit needed to register a namespace. If a path with the agent prefix is provided and contains more segments, the prefix (agent literal and agent name) will be dropped.
Sourcepub fn fee_midpoint(
&self,
) -> <<T as Config>::Currency as Currency<<T as Config>::AccountId>>::Balance
pub fn fee_midpoint( &self, ) -> <<T as Config>::Currency as Currency<<T as Config>::AccountId>>::Balance
The fee midpoint.
Sourcepub fn fee_ceiling(
&self,
) -> <<T as Config>::Currency as Currency<<T as Config>::AccountId>>::Balance
pub fn fee_ceiling( &self, ) -> <<T as Config>::Currency as Currency<<T as Config>::AccountId>>::Balance
The fee theoretical ceiling.
Trait Implementations§
Source§impl<T: Clone + Config> Clone for NamespacePricingConfig<T>
impl<T: Clone + Config> Clone for NamespacePricingConfig<T>
Source§fn clone(&self) -> NamespacePricingConfig<T>
fn clone(&self) -> NamespacePricingConfig<T>
Returns a copy of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl<T: Config> Debug for NamespacePricingConfig<T>
impl<T: Config> Debug for NamespacePricingConfig<T>
Source§impl<T: Config> Decode for NamespacePricingConfig<T>
impl<T: Config> Decode for NamespacePricingConfig<T>
Source§fn decode<__CodecInputEdqy: Input>(
__codec_input_edqy: &mut __CodecInputEdqy,
) -> Result<Self, Error>
fn decode<__CodecInputEdqy: Input>( __codec_input_edqy: &mut __CodecInputEdqy, ) -> Result<Self, Error>
Attempt to deserialise the value from input.
§fn decode_into<I>(
input: &mut I,
dst: &mut MaybeUninit<Self>,
) -> Result<DecodeFinished, Error>where
I: Input,
fn decode_into<I>(
input: &mut I,
dst: &mut MaybeUninit<Self>,
) -> Result<DecodeFinished, Error>where
I: Input,
Attempt to deserialize the value from input into a pre-allocated piece of memory. Read more
§fn skip<I>(input: &mut I) -> Result<(), Error>where
I: Input,
fn skip<I>(input: &mut I) -> Result<(), Error>where
I: 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
Source§impl<T: Config> Encode for NamespacePricingConfig<T>
impl<T: Config> Encode for NamespacePricingConfig<T>
Source§fn size_hint(&self) -> usize
fn size_hint(&self) -> usize
If possible give a hint of expected size of the encoding. Read more
Source§fn encode_to<__CodecOutputEdqy: Output + ?Sized>(
&self,
__codec_dest_edqy: &mut __CodecOutputEdqy,
)
fn encode_to<__CodecOutputEdqy: Output + ?Sized>( &self, __codec_dest_edqy: &mut __CodecOutputEdqy, )
Convert self to a slice and append it to the destination.
§fn using_encoded<R, F>(&self, f: F) -> R
fn using_encoded<R, F>(&self, f: F) -> 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
Source§impl<T: Config> MaxEncodedLen for NamespacePricingConfig<T>
impl<T: Config> MaxEncodedLen for NamespacePricingConfig<T>
Source§fn max_encoded_len() -> usize
fn max_encoded_len() -> usize
Upper bound, in bytes, of the maximum encoded size of this item.
Source§impl<T> TypeInfo for NamespacePricingConfig<T>
impl<T> TypeInfo for NamespacePricingConfig<T>
impl<T: Config> EncodeLike for NamespacePricingConfig<T>
impl<T: Eq + Config> Eq for NamespacePricingConfig<T>
impl<T: Config> StructuralPartialEq for NamespacePricingConfig<T>
Auto Trait Implementations§
impl<T> Freeze for NamespacePricingConfig<T>
impl<T> RefUnwindSafe for NamespacePricingConfig<T>
impl<T> Send for NamespacePricingConfig<T>
impl<T> Sync for NamespacePricingConfig<T>
impl<T> Unpin for NamespacePricingConfig<T>
impl<T> UnwindSafe for NamespacePricingConfig<T>
Blanket Implementations§
§impl<T> AnySync for T
impl<T> AnySync for T
§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
§fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
§fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> DecodeAll for Twhere
T: Decode,
impl<T> DecodeAll for Twhere
T: Decode,
§fn decode_all(input: &mut &[u8]) -> Result<T, Error>
fn decode_all(input: &mut &[u8]) -> Result<T, Error>
Decode
Self
and consume all of the given input data. Read more§impl<T> DecodeLimit for Twhere
T: Decode,
impl<T> DecodeLimit for Twhere
T: Decode,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<T> FullLeaf for T
impl<T> FullLeaf for T
§impl<T> Hashable for Twhere
T: Codec,
impl<T> Hashable for Twhere
T: Codec,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<T> IsType<T> for T
impl<T> IsType<T> for T
§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
§impl<T> KeyedVec for Twhere
T: Codec,
impl<T> KeyedVec for Twhere
T: Codec,
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
Consume self to return an equivalent value of
T
. Read more§impl<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>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
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
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.§impl<T, U> TryIntoKey<U> for Twhere
U: TryFromKey<T>,
impl<T, U> TryIntoKey<U> for Twhere
U: TryFromKey<T>,
type Error = <U as TryFromKey<T>>::Error
fn try_into_key(self) -> Result<U, <U as TryFromKey<T>>::Error>
§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
The counterpart to
unchecked_from
.§impl<T, S> UniqueSaturatedInto<T> for S
impl<T, S> UniqueSaturatedInto<T> for S
§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
Consume self to return an equivalent value of
T
.