Enum Keep 

pub enum Keep {
    Exact,
    F32,
    F16,
    Bf16,
    Int8Rows,
    Int8RowsRotated,
}

How a chip keeps the values it stores between steps — a cache’s rows, a recurrent memory: as the meaning computes them, rounded to the nearest of a narrower float, or a row at a time as int8 codes under one binary16 scale (max / 127), the row first turned by a Walsh–Hadamard transform where it is Int8RowsRotated.

Variants

Exact

F32

F16

Bf16

Int8Rows

Int8RowsRotated

Implementations

impl Keep

pub fn bound(self) -> Bound

The bound a value kept this way keeps. A float: half an ulp of its significand of the value, and its smallest normal where a chip flushes what lies below it. A row of int8 codes: half a level of the row’s scale, the scale rounded to binary16 (a relative 2⁻¹¹, which can push a code past ±127 to be clamped), and a scale that underflows binary16; its block is the row as stored — turned, for a rotated row, whose error the inverse turn averages.

pub fn keep(self, v: f64) -> Option<f64>

v as this way keeps it, to the nearest, ties to even; None for a format that keeps a row at a time.

Trait Implementations

impl Clone for Keep

fn clone(&self) -> Keep

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Keep

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

Formats the value using the given formatter.

impl PartialEq for Keep

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

impl Eq for Keep

impl StructuralPartialEq for Keep