| Commit message (Collapse) | Author | Age | ||
|---|---|---|---|---|
| ... | ||||
| * | Move Arith, XArray and Convert | Mikolaj Konarski | 2025-05-14 | |
| | | ||||
| * | Rename the three main public tensor API modules | Mikolaj Konarski | 2025-05-14 | |
| | | ||||
| * | Add .stylish-haskell.yaml that matches Tom's preferences | Mikolaj Konarski | 2025-05-14 | |
| | | | | | | to be automatically applied at buffer save or periodically applied with find -not -path '*/\.git/*' -name "*.hs" -type f| xargs stylish-haskell -i | |||
| * | Split and uniformly rename Shape modules | Mikolaj Konarski | 2025-05-14 | |
| | | ||||
| * | Appease GHC 9.10.2 | Tom Smeding | 2025-05-13 | |
| | | ||||
| * | Revert some stylistic changes | Tom Smeding | 2025-05-13 | |
| | | | | | https://x.com/comerijn/status/1257804634833420292 | |||
| * | Fix some of the warnings GHC 9.12.2 now produces | Mikolaj Konarski | 2025-05-13 | |
| | | ||||
| * | Apply some suggestions from hlint | Mikolaj Konarski | 2025-05-13 | |
| | | ||||
| * | Let stylish-haskell sort things | Mikolaj Konarski | 2025-05-13 | |
| | | ||||
| * | Add a couple of new zip operations that obviously make sense | Mikolaj Konarski | 2025-05-13 | |
| | | ||||
| * | Generalise list{x,s}Zip{,With} from Const to f | Tom Smeding | 2025-05-12 | |
| | | ||||
| * | Let's not add commented redundant needless errors | Tom Smeding | 2025-05-12 | |
| | | ||||
| * | Add zip and zipWith for sized lists | Mikolaj Konarski | 2025-05-11 | |
| | | ||||
| * | Fill in missing Head and HEAD | Mikolaj Konarski | 2025-05-11 | |
| | | ||||
| * | Cargo-cult NFData for all sized list types | Mikolaj Konarski | 2025-05-11 | |
| | | ||||
| * | Define fooLength and/or fooRank whenever not yet defined | Mikolaj Konarski | 2025-05-11 | |
| | | ||||
| * | Fix the Show instance for Shaped | Mikolaj Konarski | 2025-04-26 | |
| | | ||||
| * | Refactor the clever replicate-aware Show instances | Tom Smeding | 2025-04-26 | |
| | | ||||
| * | Do away with ShowVia{ToListLinear,Primitive}, were unused | Tom Smeding | 2025-04-26 | |
| | | ||||
| * | Show concisely arrays replicated from a single element (scalar or not) | Mikolaj Konarski | 2025-04-26 | |
| | | ||||
| * | Add mstrideTree and StrideTree | Mikolaj Konarski | 2025-04-25 | |
| | | ||||
| * | Improve an error message | Tom Smeding | 2025-03-25 | |
| | | ||||
| * | Compatibility liftVEltwise1 (TODO remove) | Tom Smeding | 2025-03-20 | |
| | | ||||
| * | Some re-exports for compatibility | Tom Smeding | 2025-03-20 | |
| | | ||||
| * | Separate arith routines into a library | Tom Smeding | 2025-03-20 | |
| | | | | | The point is that this separate library does not depend on orthotope. | |||
| * | Arith statistics collection from C | Tom Smeding | 2025-03-18 | |
| | | ||||
| * | arith: Don't FFI-import unused dotprod_*_strided ops | Tom Smeding | 2025-03-18 | |
| | | ||||
| * | Optimise reductions and dotprod with more vectorisation | Tom Smeding | 2025-03-14 | |
| | | | | | | | | | | Turns out that if you don't supply -ffast-math, the C compiler will faithfully reproduce your linear reduction order, which is rather disastrous for parallelisation with vector units. This changes the summation order, so numerical results might differ slightly. To wit: the test suite needed adjustment. | |||
| * | arith: Correct rank arguments to C wrapper functions | Tom Smeding | 2025-03-13 | |
| | | ||||
| * | Export IntElt | Tom Smeding | 2025-03-13 | |
| | | ||||
| * | Rename arithPromote* to lift* (unrelated to arith ops, really) | Tom Smeding | 2025-03-13 | |
| | | ||||
| * | Add atan2 | Tom Smeding | 2025-03-13 | |
| | | ||||
| * | Implement quot/rem | Tom Smeding | 2025-03-13 | |
| | | ||||
| * | Remove redundant constraints on arith instances | Tom Smeding | 2025-03-12 | |
| | | ||||
| * | Slight cleanup of arith instances for Mixed/Ranked/Shaped | Tom Smeding | 2025-03-12 | |
| | | | | | Reformulate error messages; add NumElt superclass to FloatElt | |||
| * | Binary ops without normalisation | Tom Smeding | 2025-03-12 | |
| | | | | | | | | | | Before: > sum(*) Double [1e6] stride 1; -1: OK > 68.9 ms ± 4.7 ms After: > sum(*) Double [1e6] stride 1; -1: OK > 1.44 ms ± 50 μs | |||
| * | More consistent equality functions on shapes | Tom Smeding | 2025-03-11 | |
| | | ||||
| * | arith: Unary float ops on strided arrays without normalisation | Tom Smeding | 2025-03-05 | |
| | | ||||
| * | All arrays are Eq and Ord (they compare shape first, then values) | Tom Smeding | 2025-02-18 | |
| | | | | | | This comparison policy is lifted straight from orthotope (and indeed the instances are all just auto-derived). | |||
| * | Less pointless standalone Ord instances | Tom Smeding | 2025-02-18 | |
| | | ||||
| * | arith: Fix unary op stride bugs | Tom Smeding | 2025-02-18 | |
| | | ||||
| * | Fix a typo in an error message | Mikolaj Konarski | 2025-02-17 | |
| | | ||||
| * | arith: Only strided unary int ops | Tom Smeding | 2025-02-16 | |
| | | | | | | This should have negligible overhead and will save a whole bunch of C code duplication when the FUnops are also converted to strided form. | |||
| * | arith: Unary int ops on strided arrays without normalisation | Tom Smeding | 2025-02-16 | |
| | | ||||
| * | arith: Fix cover calculation in stridesDense | Tom Smeding | 2025-02-16 | |
| | | | | | | The calculation was incorrect for windowed arrays (as produced by RS.window) | |||
| * | Remove 'type data' for now (GHC 9.10 breaks) | Tom Smeding | 2025-02-15 | |
| | | ||||
| * | mcastSafe, castCastable | Tom Smeding | 2025-02-01 | |
| | | ||||
| * | Eliminate the lame shaped fromInteger implementation | Mikolaj Konarski | 2025-01-24 | |
| | | ||||
| * | Export IShX from Nested | Mikolaj Konarski | 2025-01-09 | |
| | | ||||
| * | Export ListX from Nested | Mikolaj Konarski | 2025-01-07 | |
| | | ||||
