Struct RecGroup 

pub struct RecGroup { /* private fields */ }

Represents a recursive type group in a WebAssembly module.

Implementations

impl RecGroup

pub fn is_explicit_rec_group(&self) -> bool

Is this an explicit recursion group?

pub fn types(&self) -> impl ExactSizeIterator

Returns the list of subtypes in the recursive type group.

pub fn into_types(self) -> impl ExactSizeIterator

Returns an owning iterator of all subtypes in this recursion group.

pub fn into_types_and_offsets(self) -> impl ExactSizeIterator

Returns an owning iterator of all subtypes in this recursion group, along with their offset.

Trait Implementations

impl Clone for RecGroup

fn clone(&self) -> RecGroup

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RecGroup

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

Formats the value using the given formatter.

impl<'a> FromReader<'a> for RecGroup

fn from_reader( reader: &mut BinaryReader<'a>, ) -> Result<RecGroup, BinaryReaderError>

Attempts to read Self from the provided binary reader, returning an error if it is unable to do so.

impl Hash for RecGroup

fn hash<H>(&self, hasher: &mut H)

where H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for RecGroup

fn cmp(&self, other: &RecGroup) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for RecGroup

fn eq(&self, other: &RecGroup) -> 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 PartialOrd for RecGroup

fn partial_cmp(&self, other: &RecGroup) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Eq for RecGroup