Struct RegisterSet 

pub(crate) struct RegisterSet(ArrayVec<RegisterId, NUM_REGISTERS>);

Identify a set of RegisterIds

This could be done compactly as a u8 bitfield for storage purposes, but in our program generator this is never stored long-term. Instead, we want something the optimizer can reason about as effectively as possible, and we want to optimize for an index() implementation that doesn’t branch. This uses a fixed-capacity array of registers in-set, always sorted.

Tuple Fields

0: ArrayVec<RegisterId, NUM_REGISTERS>

Implementations

impl RegisterSet

pub(crate) fn len(&self) -> usize

Number of registers still contained in this set

pub(crate) fn contains(&self, id: RegisterId) -> bool

Test if a register is contained in the set.

pub(crate) fn from_filter<P: FnMut(RegisterId) -> bool>(predicate: P) -> Self

Build a new RegisterSet from each register for which a predicate function returns true.

pub(crate) fn index(&self, index: usize) -> RegisterId

Return a particular register within this set, counting from R0 to R7.

The supplied index must be less than the Self::len() of this set. Panics if the index is out of range.

Trait Implementations

impl Clone for RegisterSet

fn clone(&self) -> RegisterSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RegisterSet

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

Formats the value using the given formatter.

impl Default for RegisterSet

fn default() -> RegisterSet

Returns the “default value” for a type.

impl PartialEq for RegisterSet

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

impl StructuralPartialEq for RegisterSet