Data.PrimitiveArray.FillTables

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.

Documentation

class UpperTriS m stack where

Methods

upperTriS :: stack -> m ()

Instances

(Monad m, MPrimArrayOps arr Subword e, Stack m Subword (:. xs (MutArr m (arr Subword e)))) => UpperTriS m (:. xs (MutArr m (arr Subword e)))

TODO Insert check that all extends are the same!

class Stack m sh xs where

Defines how a single index in a stack of arrays + evaluation functions is handled.

Methods

writeStack :: xs -> sh -> m ()

Instances

Monad m => Stack m sh Z

(PrimMonad m, Stack m Subword xs, MPrimArrayOps arr Subword e) => Stack m Subword (:. xs (MutArr m (arr Subword e), Subword -> m e))