pub struct ControlFlowCosts {}Expand description
Definition of a cost table for a Wasm control flow opcodes.
Fields§
§block: u32Cost for block opcode.
op_loop: u32Cost for loop opcode.
op_if: u32Cost for if opcode.
op_else: u32Cost for else opcode.
end: u32Cost for end opcode.
br: u32Cost for br opcode.
br_if: u32Cost for br_if opcode.
op_return: u32Cost for return opcode.
call: u32Cost for call opcode.
call_indirect: u32Cost for call_indirect opcode.
drop: u32Cost for drop opcode.
select: u32Cost for select opcode.
br_table: BrTableCostCost for br_table opcode.
Trait Implementations§
source§impl Clone for ControlFlowCosts
impl Clone for ControlFlowCosts
source§fn clone(&self) -> ControlFlowCosts
fn clone(&self) -> ControlFlowCosts
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 DataSize for ControlFlowCosts
impl DataSize for ControlFlowCosts
source§const IS_DYNAMIC: bool = false
const IS_DYNAMIC: bool = false
If
true, the type has a heap size that can vary at runtime, depending on the actual value.source§const STATIC_HEAP_SIZE: usize = 0usize
const STATIC_HEAP_SIZE: usize = 0usize
The amount of space a value of the type always occupies. If
IS_DYNAMIC is false, this is
the total amount of heap memory occupied by the value. Otherwise this is a lower bound.source§fn estimate_heap_size(&self) -> usize
fn estimate_heap_size(&self) -> usize
Estimates the size of heap memory taken up by this value. Read more
source§impl Debug for ControlFlowCosts
impl Debug for ControlFlowCosts
source§impl Default for ControlFlowCosts
impl Default for ControlFlowCosts
source§impl<'de> Deserialize<'de> for ControlFlowCosts
impl<'de> Deserialize<'de> for ControlFlowCosts
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Distribution<ControlFlowCosts> for Standard
impl Distribution<ControlFlowCosts> for Standard
source§fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> ControlFlowCosts
fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> ControlFlowCosts
Generate a random value of
T, using rng as the source of randomness.source§fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T>
fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T>
Create an iterator that generates random values of
T, using rng as
the source of randomness. Read moresource§impl FromBytes for ControlFlowCosts
impl FromBytes for ControlFlowCosts
source§impl PartialEq for ControlFlowCosts
impl PartialEq for ControlFlowCosts
source§fn eq(&self, other: &ControlFlowCosts) -> bool
fn eq(&self, other: &ControlFlowCosts) -> bool
This method tests for
self and other values to be equal, and is used
by ==.source§impl Serialize for ControlFlowCosts
impl Serialize for ControlFlowCosts
source§impl ToBytes for ControlFlowCosts
impl ToBytes for ControlFlowCosts
source§fn serialized_length(&self) -> usize
fn serialized_length(&self) -> usize
Returns the length of the
Vec<u8> which would be returned from a successful call to
to_bytes() or into_bytes(). The data is not actually serialized, so this call is
relatively cheap.impl Copy for ControlFlowCosts
impl Eq for ControlFlowCosts
impl StructuralPartialEq for ControlFlowCosts
Auto Trait Implementations§
impl RefUnwindSafe for ControlFlowCosts
impl Send for ControlFlowCosts
impl Sync for ControlFlowCosts
impl Unpin for ControlFlowCosts
impl UnwindSafe for ControlFlowCosts
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
§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.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§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.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.