Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Properly test C reductions | Tom Smeding | 2024-06-03 |
| | |||
* | Cleanup of shape functions | Tom Smeding | 2024-06-03 |
| | |||
* | Rename *ToSNat to *LengthSNat | Tom Smeding | 2024-06-03 |
| | | | | For consistency with existing functions | ||
* | rrank, rtoOrthotope | Tom Smeding | 2024-06-03 |
| | |||
* | Move sh*Tail to main ox-arrays | Tom Smeding | 2024-06-03 |
| | |||
* | *asXArrayPrim -> *toXArrayPrim | Tom Smeding | 2024-06-03 |
| | | | | This name makes much more sense in combination with *fromXArrayPrim. | ||
* | Test permInverse | Tom Smeding | 2024-06-03 |
| | |||
* | Some more generators for tests | Tom Smeding | 2024-06-03 |
| | |||
* | Separate permCheckPermutation from permInverse | Tom Smeding | 2024-06-03 |
| | |||
* | Introduce PermR type synonym | Tom Smeding | 2024-06-03 |
| | |||
* | Rename permutations of shaped sized lists | Mikolaj Konarski | 2024-06-01 |
| | |||
* | Add StrictData in Nested.Mixed | Tom Smeding | 2024-05-31 |
| | |||
* | Rename some commuting lemmas to better names | Tom Smeding | 2024-05-31 |
| | |||
* | Fix comment in Nested.Shape | Tom Smeding | 2024-05-31 |
| | |||
* | Make the sized lists strict again | Mikolaj Konarski | 2024-05-31 |
| | |||
* | Clearer module purposes | Tom Smeding | 2024-05-30 |
| | | | | Thanks Mikolaj for discussion | ||
* | Refactor Nested (modules, function names) | Tom Smeding | 2024-05-30 |
| | |||
* | Fix wrongly ported X.cast | Tom Smeding | 2024-05-30 |
| | |||
* | Clean up extensions | Tom Smeding | 2024-05-30 |
| | |||
* | Refactor Mixed (modules, regular function names) | Tom Smeding | 2024-05-30 |
| | |||
* | applyPerm* functions | Tom Smeding | 2024-05-28 |
| | |||
* | Also add permToList | Tom Smeding | 2024-05-28 |
| | |||
* | Add permFromList | Tom Smeding | 2024-05-28 |
| | |||
* | invertPermutation: Provide Permutation evidence | Tom Smeding | 2024-05-28 |
| | |||
* | Add invertPermutation | Tom Smeding | 2024-05-28 |
| | |||
* | Remove unused cluttering singleton functions | Tom Smeding | 2024-05-28 |
| | |||
* | Add some HList instances | Tom Smeding | 2024-05-27 |
| | |||
* | Record the dependency on arith_lists.h for recompilation checking | Tom Smeding | 2024-05-27 |
| | |||
* | Export NumElt and FloatElt publicly | Tom Smeding | 2024-05-27 |
| | |||
* | Re-add KnownNatList for convenience with transpose functions | Tom Smeding | 2024-05-27 |
| | |||
* | Fast (C) Floating ops | Tom Smeding | 2024-05-27 |
| | |||
* | Fast Fractional ops via C code | Tom Smeding | 2024-05-26 |
| | |||
* | Cleanup | Tom Smeding | 2024-05-26 |
| | |||
* | Use fast C ops for X.sumFull | Tom Smeding | 2024-05-26 |
| | |||
* | Fix bug in rerank workaround | Tom Smeding | 2024-05-26 |
| | |||
* | Refactor C interface to pass operation as enum | Tom Smeding | 2024-05-26 |
| | | | | | This is hmatrix style, less proliferation of functions as the number of ops increases | ||
* | 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 |
| | |||
* | Add utility function | Tom Smeding | 2024-05-23 |
| | |||
* | fromList1Prim | Tom Smeding | 2024-05-23 |
| | |||
* | Bugfix in wrapper for C reduce op | 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 bug in X.reshapePartial | Tom Smeding | 2024-05-22 |
| | | | | Thanks Mikolaj! | ||
* | 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. |