| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | Speed up sumFull from 36ms to 82 microseconds | Mikolaj Konarski | 7 days |
| | | |||
| * | Save some VS.concat by using toVectorListT | Mikolaj Konarski | 7 days |
| | | |||
| * | Let X.fromListOuterSN and ravelOuterN take NonEmpty | Mikolaj Konarski | 9 days |
| | | |||
| * | Simplify and slightly speed up internal fromList functions | Mikolaj Konarski | 10 days |
| | | |||
| * | Use shxDropSSX instead of shxSplitApp, etc. | Mikolaj Konarski | 10 days |
| | | |||
| * | Add pragmas to functions that -fprof-late-overloaded-calls reports | Mikolaj Konarski | 2025-12-27 |
| | | | | | | | | as breaking the chain of specialization (but it's currently broken, so these may be false positives, but these pragmas may be handy in the future anyway and they can't do much harm in theory and in practice they are right now neutral performance-wise). | ||
| * | Make it clear that ravelOuterN is called just once | Mikolaj Konarski | 2025-12-21 |
| | | |||
| * | Clone ListX into ListH | Mikolaj Konarski | 2025-12-16 |
| | | |||
| * | XArray: Fix doc comment on ravelOuterN | Tom Smeding | 2025-12-06 |
| | | |||
| * | Improve runtime and streaming of fromListOuter | Mikolaj Konarski | 2025-12-05 |
| | | |||
| * | Expose the unfolding of the indexing operations | Mikolaj Konarski | 2025-12-01 |
| | | |||
| * | Optimize X.index, but measurements unconclusive | Mikolaj Konarski | 2025-11-27 |
| | | |||
| * | Provide explicit-length versions of fromList functions | Tom Smeding | 2025-11-17 |
| | | |||
| * | README: Document array buffer sharing policy | Tom Smeding | 2025-11-15 |
| | | |||
| * | XArray: Further optimise toListOuter | Tom Smeding | 2025-11-15 |
| | | | | | Again, thanks Mikolaj | ||
| * | XArray: Optimise toListOuter | Tom Smeding | 2025-11-15 |
| | | | | | Thanks Mikolaj! | ||
| * | Compatibility with GHC 9.6 | Tom Smeding | 2025-10-02 |
| | | |||
| * | Flip some index/shape-related functions | Tom Smeding | 2025-06-29 |
| | | | | | | This ensures that the argument order consistently puts the main thing being operated on at the end, and supporting singletons at the start. | ||
| * | Run stylish-haskell | Mikolaj Konarski | 2025-05-17 |
| | | |||
| * | Merge both Lemmas modules | Mikolaj Konarski | 2025-05-17 |
| | | |||
| * | Move modules Permutation and Types | Mikolaj Konarski | 2025-05-16 |
| | | |||
| * | Shape/index function rename | Tom Smeding | 2025-05-16 |
| | | |||
| * | Move Data.Array.Arith to Data.Array.Strided.Orthotope | Tom Smeding | 2025-05-15 |
| | | |||
| * | Move Arith, XArray and Convert | Mikolaj Konarski | 2025-05-14 |
