Enum MemoryGrowCost

pub enum MemoryGrowCost {
    Free,
    Linear(NonZero<u32>),
}

Dynamic costs for memory growth.

Variants

Free

Skip per page charge.

Note

This makes sense when the amount of pages that a module is allowed to use is limited to a rather small number by static validation. In that case it is viable to benchmark the costs of memory.grow as the worst case (growing to to the maximum number of pages).

Linear(NonZero<u32>)

Charge the specified amount for each page that the memory is grown by.

Trait Implementations

impl Clone for MemoryGrowCost

fn clone(&self) -> MemoryGrowCost

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for MemoryGrowCost

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl PartialEq for MemoryGrowCost

fn eq(&self, other: &MemoryGrowCost) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for MemoryGrowCost

impl Eq for MemoryGrowCost

impl StructuralPartialEq for MemoryGrowCost