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
69
70
71
72
73
74
75
76
77
78

//! Iterators over a lattice in both logical and hardware-tile order.

use crate::lattice::PaddedTileLattice;

impl<T> PaddedTileLattice<T> {
    /// Borrow the contiguous storage slice of one tile by tile coordinate.
    pub fn tile_slice(&self, tile_row: usize, tile_col: usize) -> &[T] {
        let base = self.layout().tile_base(tile_row, tile_col);
        let len = self.geometry().tile_len();
        &self.as_storage_slice()[base..base + len]
    }

    /// Number of storage tiles along the row axis.
    #[inline]
    pub fn tile_rows(&self) -> usize {
        self.shape().padded_rows / self.geometry().sublanes
    }

    /// Number of storage tiles along the column axis.
    #[inline]
    pub fn tile_cols(&self) -> usize {
        self.shape().padded_cols / self.geometry().lanes
    }

    /// Iterate every tile in row-major tile order, yielding
    /// `(tile_row, tile_col, slice)`.
    pub fn iter_tiles(&self) -> TileIter<'_, T> {
        TileIter {
            lattice: self,
            next: 0,
            total: self.num_tiles(),
        }
    }
}

impl<T: Clone> PaddedTileLattice<T> {
    /// Iterate the logical elements in row-major order, yielding `(row, col, value)`.
    pub fn iter_logical(&self) -> impl Iterator<Item = (usize, usize, T)> + '_ {
        let rows = self.rows();
        let cols = self.cols();
        (0..rows).flat_map(move |row| {
            (0..cols).map(move |col| (row, col, self.get(row, col).unwrap().clone()))
        })
    }
}

/// Iterator returned by [`PaddedTileLattice::iter_tiles`].
pub struct TileIter<'a, T> {
    lattice: &'a PaddedTileLattice<T>,
    next: usize,
    total: usize,
}

impl<'a, T> Iterator for TileIter<'a, T> {
    type Item = (usize, usize, &'a [T]);

    fn next(&mut self) -> Option<Self::Item> {
        if self.next >= self.total {
            return None;
        }
        let tiles_per_row = self.lattice.tile_cols();
        let tile_row = self.next / tiles_per_row;
        let tile_col = self.next % tiles_per_row;
        self.next += 1;
        Some((
            tile_row,
            tile_col,
            self.lattice.tile_slice(tile_row, tile_col),
        ))
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        let remaining = self.total - self.next;
        (remaining, Some(remaining))
    }
}

impl<'a, T> ExactSizeIterator for TileIter<'a, T> {}