Struct soroban_env_host::fees::FeeConfiguration
source · pub struct FeeConfiguration {
pub fee_per_instruction_increment: i64,
pub fee_per_read_entry: i64,
pub fee_per_write_entry: i64,
pub fee_per_read_1kb: i64,
pub fee_per_write_1kb: i64,
pub fee_per_historical_1kb: i64,
pub fee_per_contract_event_1kb: i64,
pub fee_per_transaction_size_1kb: i64,
}
Expand description
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_instruction_increment: i64
Fee per INSTRUCTIONS_INCREMENT=10000
instructions.
fee_per_read_entry: i64
Fee per 1 entry read from ledger.
fee_per_write_entry: i64
Fee per 1 entry written to ledger.
fee_per_read_1kb: i64
Fee per 1KB read from ledger.
fee_per_write_1kb: i64
Fee per 1KB written to ledger. This has to be computed via
compute_write_fee_per_1kb
.
fee_per_historical_1kb: i64
Fee per 1KB written to history (the history write size is based on
transaction size and TX_BASE_RESULT_SIZE
).
fee_per_contract_event_1kb: i64
Fee per 1KB of contract events written.
fee_per_transaction_size_1kb: i64
Fee per 1KB of transaction size.
Auto Trait Implementations§
impl RefUnwindSafe for FeeConfiguration
impl Send for FeeConfiguration
impl Sync for FeeConfiguration
impl Unpin for FeeConfiguration
impl UnwindSafe for FeeConfiguration
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
Mutably borrows from an owned value. Read more
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>
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn 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
.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
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
.§fn as_any(&self) -> &(dyn Any + 'static)
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.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
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.