Enum Kind 

pub enum Kind {
    Scalar,
    Aggregate,
    PerItem,
    Array,
    Lazy,
}

How a function is compiled.

Variants

Scalar

Element-wise over its arguments’ aligned cells (ABS, LEFT, n-ary SUM(a, b)).

Aggregate

Collapses the OVER categories: SUM(x OVER Time). The arguments at FnDef::over positions are measures reduced together (joined on their full coordinate); the others are parameters, one value per group (LARGE(x OVER T, 2), NPV(rate, cf OVER T)).

PerItem

Like Kind::Aggregate but one result per item of the (single) OVER category, which the result keeps: RANK(x OVER T).

Array

A list of results laid along the INTO category’s items (the k-th result at its k-th item): SORT(x OVER T INTO Rank).

Lazy

Evaluates only the arguments it needs (IF, IFERROR, …); the compiler lowers it specially.

Implementations

impl Kind

pub fn reduces(self) -> bool

Whether this kind reduces over OVER categories.

Trait Implementations

impl Clone for Kind

fn clone(&self) -> Kind

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Kind

impl Debug for Kind

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

Formats the value using the given formatter.

impl Eq for Kind

impl PartialEq for Kind

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Kind