Struct ZipMap 

pub struct ZipMap {
    pub n: usize,
    pub operands: Vec<Symbol>,
    pub types: Vec<Ty>,
    pub term: ZipTerm,
    pub ty: Ty,
    pub out: Symbol,
}

A recognized zip map out[t] = f(A₀[t], A₁[t], …) for t < n: one counted loop storing a term of several arrays into another, every one read at the index it stores at — Black-Scholes over its option columns, any elementwise map over aligned streams. The term’s type is the output’s element type, Int or Real.

Fields

n: usize

operands: Vec<Symbol>

The arrays read, in reading order; ZipTerm::Read(k) is the element of operands[k].

types: Vec<Ty>

Each operand’s element type.

term: ZipTerm

ty: Ty

The term’s type: the element type of out.

out: Symbol

Trait Implementations

impl Clone for ZipMap

fn clone(&self) -> ZipMap

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ZipMap

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

Formats the value using the given formatter.

impl PartialEq for ZipMap

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

impl StructuralPartialEq for ZipMap