Type Alias MaybeUninitializedPlacesDomain

pub type MaybeUninitializedPlacesDomain = MixedBitSet<MovePathIndex>;

There can be many more MovePathIndex than there are locals in a MIR body. We use a mixed bitset to avoid paying too high a memory footprint.

Aliased Type

enum MaybeUninitializedPlacesDomain {
    Small(BitSet<MovePathIndex>),
    Large(ChunkedBitSet<MovePathIndex>),
}

Variants

Small(BitSet<MovePathIndex>)

Large(ChunkedBitSet<MovePathIndex>)

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: 40 bytes

Size for each variant:

• Small: 32 bytes
• Large: 24 bytes

Implementations

impl<T> MixedBitSet<T>

pub fn domain_size(&self) -> usize

impl<T> MixedBitSet<T>

where T: Idx,

pub fn new_empty(domain_size: usize) -> MixedBitSet<T>

pub fn is_empty(&self) -> bool

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

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

pub fn insert_all(&mut self)

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

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

pub fn clear(&mut self)

pub fn union<Rhs>(&mut self, other: &Rhs) -> bool

where MixedBitSet<T>: BitRelations<Rhs>,

Sets self = self | other and returns true if self changed (i.e., if new bits were added).

pub fn subtract<Rhs>(&mut self, other: &Rhs) -> bool

where MixedBitSet<T>: BitRelations<Rhs>,

Sets self = self - other and returns true if self changed. (i.e., if any bits were removed).

pub fn intersect<Rhs>(&mut self, other: &Rhs) -> bool

where MixedBitSet<T>: BitRelations<Rhs>,

Sets self = self & other and return true if self changed. (i.e., if any bits were removed).

Trait Implementations

impl<T> BitRelations<MixedBitSet<T>> for MixedBitSet<T>

where T: Idx,

fn union(&mut self, other: &MixedBitSet<T>) -> bool

fn subtract(&mut self, other: &MixedBitSet<T>) -> bool

fn intersect(&mut self, _other: &MixedBitSet<T>) -> bool

impl<T: Idx> BitSetExt<T> for MixedBitSet<T>

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

impl<T> Clone for MixedBitSet<T>

fn clone_from(&mut self, from: &MixedBitSet<T>)

WARNING: this implementation of clone_from may panic if the two bitsets have different domain sizes. This constraint is not inherent to clone_from, but it works with the existing call sites and allows a faster implementation, which is important because this function is hot.

fn clone(&self) -> MixedBitSet<T>

Returns a copy of the value.

impl<T> Debug for MixedBitSet<T>

where T: Idx,

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

Formats the value using the given formatter.

impl<T, C> DebugWithContext<C> for MixedBitSet<T>

where T: Idx + DebugWithContext<C>,

fn fmt_with(&self, ctxt: &C, f: &mut Formatter<'_>) -> Result

fn fmt_diff_with(&self, old: &Self, ctxt: &C, f: &mut Formatter<'_>) -> Result

Print the difference between self and old.

impl<T: Idx> GenKill<T> for MixedBitSet<T>

fn gen_(&mut self, elem: T)

Inserts elem into the state vector.

fn kill(&mut self, elem: T)

Removes elem from the state vector.

fn gen_all(&mut self, elems: impl IntoIterator<Item = T>)

Calls gen for each element in elems.

fn kill_all(&mut self, elems: impl IntoIterator<Item = T>)

Calls kill for each element in elems.

impl<T: Idx> JoinSemiLattice for MixedBitSet<T>

fn join(&mut self, other: &Self) -> bool

Computes the least upper bound of two elements, storing the result in self and returning true if self has changed.

impl<T> PartialEq for MixedBitSet<T>

where T: PartialEq,

fn eq(&self, other: &MixedBitSet<T>) -> 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<T> Eq for MixedBitSet<T>

where T: Eq,

impl<T> StructuralPartialEq for MixedBitSet<T>