Enum Instr 

pub enum Instr {
    Load(usize),
    Monad(ScalarMonad),
    Dyad(ScalarDyad),
    Store(usize),
    Let(usize),
    Window(ScalarDyad, usize),
    Scan(ScalarDyad),
}

One step of a kernel: postfix, so operands are already on the stack.

Variants

Load(usize)

Push input k.

Monad(ScalarMonad)

Replace the top of the stack.

Dyad(ScalarDyad)

Replace the top two, left below right.

Store(usize)

Keep the top of the stack as let k, a value the rest of the program reads more than once. It holds its block buffer until the block is finished; nothing pops it.

Let(usize)

Push let k again.

Window(ScalarDyad, usize)

Fold every window of k consecutive items of the top of the stack into one item. The operand stands on the wide axis and the result on the kernel’s own, which is k - 1 items shorter.

Scan(ScalarDyad)

Replace the top of the stack with its running fold: item i becomes the fold of items 0 .. i. Both stand on the same axis.

Trait Implementations

impl Clone for Instr

fn clone(&self) -> Instr

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Instr

impl Debug for Instr

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

Formats the value using the given formatter.

impl Eq for Instr

impl PartialEq for Instr

fn eq(&self, other: &Instr) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Instr