Enum AffOp 

pub enum AffOp {
    None,
    Add,
    Sub,
    Mul,
}

The index-arithmetic shape folded into a fused MicroOp::ArrLoadAffine. The computed 1-based index is (frame[a] OP frame[b]).wrapping_add(c) for a two-slot op, or frame[a].wrapping_add(c) for AffOp::None (a single slot plus a constant). The op wraps with the kernel’s exact i64 semantics so the load is bit-identical to the un-fused index arithmetic + ArrLoad.

Variants

None

No second slot: idx = frame[a] + c (the w + 1 shape).

Add

idx = (frame[a] + frame[b]) + c (the i*n + j + 1 tail).

Sub

idx = (frame[a] - frame[b]) + c (the w - wi + 1 shape).

Mul

idx = (frame[a] * frame[b]) + c.

Implementations

impl AffOp

pub fn eval(self, a: i64, b: i64, c: i64) -> i64

Compute the 1-based index with the kernel’s wrapping i64 semantics.

Trait Implementations

impl Clone for AffOp

fn clone(&self) -> AffOp

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AffOp

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

Formats the value using the given formatter.

impl PartialEq for AffOp

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

impl Eq for AffOp

impl StructuralPartialEq for AffOp