systile 1.0.0

Matmul-native data structures & algorithms: 17 structures (holographic memory, semiring graphs, automata, attention, DFT, Viterbi, k-NN, Bloom, sort, scan, …) whose core operation reduces to a dense matmul, built on a TPU-style tiled tensor with a systolic reference engine.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68

//! Element-wise maps and binary combinators over the logical region.
//!
//! These operate only on logical elements; padding is regenerated as
//! `T::default()` so it can never leak into a result. On hardware these map to
//! the vector unit, which is why they preserve tiling exactly.

use crate::error::{LatticeError, Result};
use crate::lattice::PaddedTileLattice;

impl<T: Clone + Default> PaddedTileLattice<T> {
    /// Apply `f` to every logical element, returning a new lattice of the same shape.
    pub fn map<U, F>(&self, mut f: F) -> PaddedTileLattice<U>
    where
        U: Clone + Default,
        F: FnMut(&T) -> U,
    {
        let mut out = PaddedTileLattice::<U>::zeroed(self.rows(), self.cols(), *self.geometry())
            .expect("shape is preserved, so geometry stays valid");
        for row in 0..self.rows() {
            for col in 0..self.cols() {
                let mapped = f(self.get(row, col).unwrap());
                out.set(row, col, mapped).unwrap();
            }
        }
        out
    }

    /// Apply `f` to every logical element in place.
    pub fn map_in_place<F>(&mut self, mut f: F)
    where
        F: FnMut(&T) -> T,
    {
        for row in 0..self.rows() {
            for col in 0..self.cols() {
                let mapped = f(self.get(row, col).unwrap());
                self.set(row, col, mapped).unwrap();
            }
        }
    }

    /// Combine two lattices element-wise with `f`. Both must share shape and geometry.
    pub fn zip_with<F>(
        &self,
        other: &PaddedTileLattice<T>,
        mut f: F,
    ) -> Result<PaddedTileLattice<T>>
    where
        F: FnMut(&T, &T) -> T,
    {
        if self.geometry() != other.geometry() {
            return Err(LatticeError::GeometryMismatch);
        }
        if self.rows() != other.rows() || self.cols() != other.cols() {
            return Err(LatticeError::ContractionMismatch {
                lhs_cols: self.cols(),
                rhs_rows: other.rows(),
            });
        }
        let mut out = PaddedTileLattice::<T>::zeroed(self.rows(), self.cols(), *self.geometry())?;
        for row in 0..self.rows() {
            for col in 0..self.cols() {
                let combined = f(self.get(row, col).unwrap(), other.get(row, col).unwrap());
                out.set(row, col, combined)?;
            }
        }
        Ok(out)
    }
}