Safe Haskell | None |
---|
Operations to fill primitive arrays. Arrays are combined just like indices
using Z
and '(:.)'. This allows filling an unlimited number of tables.
TODO make explicit in which order the tables are filled.
- class UpperTriS m stack where
- upperTriS :: stack -> m ()
- class Stack m sh xs where
- writeStack :: xs -> sh -> m ()
Documentation
class Stack m sh xs whereSource
Defines how a single index in a stack of arrays + evaluation functions is handled.
writeStack :: xs -> sh -> m ()Source