Struct CoroutineSavedLocals

struct CoroutineSavedLocals(DenseBitSet<Local>);

The set of Locals that must be saved across yield points.

CoroutineSavedLocal is indexed in terms of the elements in this set; i.e. CoroutineSavedLocal::new(1) corresponds to the second local included in this set.

Tuple Fields

0: DenseBitSet<Local>

Implementations

impl CoroutineSavedLocals

fn iter_enumerated( &self, ) -> impl '_ + Iterator<Item = (CoroutineSavedLocal, Local)>

Returns an iterator over each CoroutineSavedLocal along with the Local it corresponds to.

fn renumber_bitset( &self, input: &DenseBitSet<Local>, ) -> DenseBitSet<CoroutineSavedLocal>

Transforms a DenseBitSet<Local> that contains only locals saved across yield points to the equivalent DenseBitSet<CoroutineSavedLocal>.

fn get(&self, local: Local) -> Option<CoroutineSavedLocal>

Methods from Deref<Target = DenseBitSet<Local>>

pub fn domain_size(&self) -> usize

Gets the domain size.

pub fn count(&self) -> usize

Count the number of set bits in the set.

pub fn contains(&self, elem: T) -> bool

Returns true if self contains elem.

pub fn superset(&self, other: &DenseBitSet<T>) -> bool

Is self is a (non-strict) superset of other?

pub fn is_empty(&self) -> bool

Is the set empty?

pub fn contains_any(&self, elems: impl RangeBounds<T>) -> bool

Checks whether any bit in the given range is a 1.

pub fn iter(&self) -> BitIter<'_, T>

Iterates over the indices of set bits in a sorted order.

pub fn last_set_in(&self, range: impl RangeBounds<T>) -> Option<T>

Trait Implementations

impl Deref for CoroutineSavedLocals

type Target = DenseBitSet<Local>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 32 bytes