Struct RegTape 

pub struct RegTape { /* private fields */ }

Low-level tape for use with the Fidget virtual machine (or to be lowered further into machine instructions).

Implementations

impl RegTape

pub fn new<const N: usize>(ssa: &SsaTape) -> Self

Lowers the tape to assembly with a particular register limit

Note that if you also want to simplify the tape, it’s more efficient to use VmData::simplify, which simultaneously simplifies and performs register allocation in a single pass.

pub fn reset(&mut self)

Resets this tape, retaining its allocations

pub fn slot_count(&self) -> usize

Returns the number of unique register and memory locations that are used by this tape.

pub fn len(&self) -> usize

Returns the number of elements in the tape

pub fn is_empty(&self) -> bool

Returns true if the tape contains no elements

pub fn iter(&self) -> impl DoubleEndedIterator<Item = &RegOp>

Returns a front-to-back iterator

This is the opposite of evaluation order; it will visit the root of the tree first, and end at the leaves.

Trait Implementations

impl Clone for RegTape

fn clone(&self) -> RegTape

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for RegTape

fn default() -> RegTape

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for RegTape

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'a> IntoIterator for &'a RegTape

type Item = &'a RegOp

The type of the elements being iterated over.

type IntoIter = Iter<'a, RegOp>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl Serialize for RegTape

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.