pub struct RentFeeConfiguration {
pub fee_per_write_1kb: i64,
pub fee_per_write_entry: i64,
pub persistent_rent_rate_denominator: i64,
pub temporary_rent_rate_denominator: i64,
}
Expand description
Rent fee-related network configuration.
This should be normally loaded from the ledger, with exception of the
fee_per_write_1kb
, that has to be computed via compute_write_fee_per_1kb
function.
Fields§
§fee_per_write_1kb: i64
Fee per 1KB written to ledger.
This is the same field as in FeeConfiguration
and it has to be
computed via compute_write_fee_per_1kb
.
fee_per_write_entry: i64
Fee per 1 entry written to ledger.
This is the same field as in FeeConfiguration
.
persistent_rent_rate_denominator: i64
Denominator for the total rent fee for persistent storage.
This can be thought of as the number of ledgers of rent that costs as
much, as writing the entry for the first time (i.e. if the value is
1000
, then we would charge the entry write fee for every 1000 ledgers
of rent).
temporary_rent_rate_denominator: i64
Denominator for the total rent fee for temporary storage.
This has the same semantics as persistent_rent_rate_denominator
.
Trait Implementations§
Source§impl Debug for RentFeeConfiguration
impl Debug for RentFeeConfiguration
Source§impl Default for RentFeeConfiguration
impl Default for RentFeeConfiguration
Source§fn default() -> RentFeeConfiguration
fn default() -> RentFeeConfiguration
Source§impl PartialEq for RentFeeConfiguration
impl PartialEq for RentFeeConfiguration
impl Eq for RentFeeConfiguration
impl StructuralPartialEq for RentFeeConfiguration
Auto Trait Implementations§
impl Freeze for RentFeeConfiguration
impl RefUnwindSafe for RentFeeConfiguration
impl Send for RentFeeConfiguration
impl Sync for RentFeeConfiguration
impl Unpin for RentFeeConfiguration
impl UnwindSafe for RentFeeConfiguration
Blanket Implementations§
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
Source§impl<T, U, V, W, E, C> Compare<(T, U, V, W)> for C
impl<T, U, V, W, E, C> Compare<(T, U, V, W)> for C
type Error = E
fn compare( &self, a: &(T, U, V, W), b: &(T, U, V, W), ) -> Result<Ordering, <C as Compare<(T, U, V, W)>>::Error>
Source§impl<T, U, V, W, X, E, C> Compare<(T, U, V, W, X)> for C
impl<T, U, V, W, X, E, C> Compare<(T, U, V, W, X)> for C
type Error = E
fn compare( &self, a: &(T, U, V, W, X), b: &(T, U, V, W, X), ) -> Result<Ordering, <C as Compare<(T, U, V, W, X)>>::Error>
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
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>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
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)
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.Source§fn 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.Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
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
key
and return true
if they are equal.