Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Fast Fractional ops via C code | Tom Smeding | 2024-05-26 |
| | |||
* | Cleanup | Tom Smeding | 2024-05-26 |
| | |||
* | Choose behaviour for rerank of empty array | Tom Smeding | 2024-05-25 |
| | | | | This works around an undocumented runtime error in orthotope. | ||
* | NFData instances | Tom Smeding | 2024-05-25 |
| | |||
* | replicate -> replicateScal; add proper generic replicate | Tom Smeding | 2024-05-25 |
| | |||
* | fromList1Prim | Tom Smeding | 2024-05-23 |
| | |||
* | Fast sum | Tom Smeding | 2024-05-23 |
| | | | | Also fast product, but that's currently unused | ||
* | msumOuter1 | Tom Smeding | 2024-05-23 |
| | |||
* | Use the {r,s}{from,to}Primitive utilities | Tom Smeding | 2024-05-23 |
| | |||
* | Clean up commented-out code | Tom Smeding | 2024-05-23 |
| | |||
* | Fast numeric operations for Num | Tom Smeding | 2024-05-23 |
| | |||
* | Fix typos i nerrors | Tom Smeding | 2024-05-21 |
| | |||
* | Add Ord instances on 0-dimensional arrays | Tom Smeding | 2024-05-21 |
| | | | | | | | | This is very conservative; of course a law-abiding Ord instance can be defined on full multi-dimensional arrays, but such an instance would be lexicographical (anything else is even stranger), and that is potentially unexpected and definitely does not play well with the other numeric classes. | ||
* | Add Eq, Fractional, Floating instances | Tom Smeding | 2024-05-21 |
| | |||
* | Add Float primitive type | Tom Smeding | 2024-05-21 |
| | |||
* | Int32 and CInt instances | Tom Smeding | 2024-05-21 |
| | |||
* | iota | Tom Smeding | 2024-05-20 |
| | |||
* | Some missing operations (rlift2, slift2) | Tom Smeding | 2024-05-20 |
| | |||
* | Better {from,to}List set | Tom Smeding | 2024-05-20 |
| | |||
* | Generalise *rerank to type-changing functions | Tom Smeding | 2024-05-20 |
| | |||
* | Fix type of srerank | Tom Smeding | 2024-05-20 |
| | |||
* | rfromOrthotope | Tom Smeding | 2024-05-20 |
| | |||
* | Make Storable a superclass of PrimElt | Tom Smeding | 2024-05-20 |
| | |||
* | Rerank on primitive arrays | Tom Smeding | 2024-05-20 |
| | |||
* | constant -> replicate | Tom Smeding | 2024-05-20 |
| | |||
* | Some conversions | Tom Smeding | 2024-05-20 |
| | |||
* | Remove forgotten -Wno-unused-imports | Tom Smeding | 2024-05-20 |
| | |||
* | Add TODOs | Tom Smeding | 2024-05-20 |
| | |||
* | mtranspose without rerank | Tom Smeding | 2024-05-20 |
| | |||
* | Make Int64 a legal array element type | Tom Smeding | 2024-05-19 |
| | |||
* | Expose all IsList(toList) functions without constraints | Tom Smeding | 2024-05-19 |
| | | | | Some are Foldable.toList, some are a separate top-level function | ||
* | Update TODOs | Tom Smeding | 2024-05-19 |
| | |||
* | Some IsList instances | Tom Smeding | 2024-05-19 |
| | |||
* | SNat has COMPLETE in ghc 9.8 | Tom Smeding | 2024-05-19 |
| | |||
* | Make sized lists strict | Mikolaj Konarski | 2024-05-19 |
| | |||
* | Fix empty lists displayed as ']' | Mikolaj Konarski | 2024-05-19 |
| | |||
* | WIP IsList instances | Tom Smeding | 2024-05-18 |
| | |||
* | Custom Show instances for list-like output | Tom Smeding | 2024-05-18 |
| | |||
* | Put KnownNat inside ListS; REVERT ME LATER | Tom Smeding | 2024-05-18 |
| | |||
* | Finish singletons refactor? | Tom Smeding | 2024-05-18 |
| | |||
* | More WIP | Tom Smeding | 2024-05-18 |
| | |||
* | More WIP singletonisation | Tom Smeding | 2024-05-17 |
| | |||
* | WIP rewrite to singletons only | Tom Smeding | 2024-05-17 |
| | |||
* | Fix slice typeHEADmaster | Tom Smeding | 2024-05-17 |
| | |||
* | PermutePrefix abbreviation | Tom Smeding | 2024-05-17 |
| | |||
* | Convert arrays <-> XArray | Tom Smeding | 2024-05-16 |
| | |||
* | Fix transpose | Tom Smeding | 2024-05-16 |
| | |||
* | WIP stranspose type | Tom Smeding | 2024-05-15 |
| | |||
* | Consistently n + 1 | Tom Smeding | 2024-05-15 |
| | |||
* | The code compiles with only GHC nats | Tom Smeding | 2024-05-15 |
| |