aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAge
* Fix some haddock errorsMikolaj Konarski2 days
|
* Remove outdated haddocks about materialising listsMikolaj Konarski2 days
|
* Improve haddocs following the Tom's guidancemvecsReplicateMikolaj Konarski4 days
|
* CPP the TypeAbstractions extension for old GHCsMikolaj Konarski4 days
|
* Get rid of most ListX operationsMikolaj Konarski4 days
|
* Remove ListRMikolaj Konarski4 days
|
* Remove ListSMikolaj Konarski4 days
|
* Follow up the equal-rank-coercibility introductionMikolaj Konarski5 days
|
* Make equal-rank-coercibility part of the interface of ListXTom Smeding5 days
|
* Get rid of ListHMikolaj Konarski5 days
|
* Define a pair of conversions ixxFromIxS'/ixrFromIxS' anologous to ↵Mikolaj Konarski5 days
| | | | ixsFromIxX'/ixsFromIxR'
* Bring ixsFromIxR' backMikolaj Konarski5 days
|
* Justify two unsafeCoerces using partial coerceTom Smeding5 days
|
* Sketch a new CHANGELOG entryMikolaj Konarski7 days
|
* Update the README remark about the implementation of indexesMikolaj Konarski7 days
|
* Apply some hlint hintsMikolaj Konarski7 days
|
* Tweak sized list type synonyms slightlyMikolaj Konarski9 days
|
* Officially describe the data invariant for ListX and the punched holesMikolaj Konarski9 days
|
* Use lazilyConcat for listxAppendMikolaj Konarski9 days
|
* Implement ListX as [] with strict pattern synonymsMikolaj Konarski9 days
|
* Remove copies of length and toList operations that Foldable already providesMikolaj Konarski10 days
| | | | in preparation for deriving Foldable for []
* Remove almost all unsafeCoerceMikolaj Konarski10 days
|
* Make ranked and shaped lists newtypes over mixedMikolaj Konarski10 days
|
* Simplify the index list pattern synonymsMikolaj Konarski10 days
|
* Fix typos/thinkosMikolaj Konarski12 days
|
* Audit remaining uses of KnownNat and SNat patternsMikolaj Konarski12 days
|
* Remove a couple of obsolete/wrong TODOsMikolaj Konarski12 days
|
* Rename TakeLen functions to TakeLenPerm; same for DropMikolaj Konarski12 days
|
* Fill and clean up *TakeIx and *DropIx functionsMikolaj Konarski2026-03-16
|
* Add permId and permShiftNMikolaj Konarski2026-03-15
|
* Odds and endsMikolaj Konarski2026-03-15
|
* Eliminate all QuantifiedConstraints extensions from the codeMikolaj Konarski2026-03-15
|
* Use shxDropSSX instead of shxSplitApp, etc.Mikolaj Konarski2026-03-15
|
* Add pragmas to functions that -fprof-late-overloaded-calls reportsMikolaj Konarski2026-03-15
| | | | | | | 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).
* Remove ixsFromIxR' and simplify ixsFromIxRMikolaj Konarski2026-03-15
|
* Make List?, except ListH, less generalMikolaj Konarski2026-03-15
|
* De-triplicate ix?ToLinearMikolaj Konarski2026-03-15
|
* De-triplicate sh?EnumMikolaj Konarski2026-03-15
|
* Define ix?FromLinear without THMikolaj Konarski2026-03-15
|
* Implement index conversions as unsafeCoerceMikolaj Konarski2026-03-15
| | | | until maybe we make shaped and ranked newtypes over mixed?
* Optimize slightly sh?FromList and sh?ToListmild-tweaks-repackagedMikolaj Konarski2026-03-15
|
* Implement ranked shape conversions as newtype coercesMikolaj Konarski2026-03-15
|
* Make ShR a newtype over ShXMikolaj Konarski2026-03-15
|
* Add the trivial Eq and Ord instances also for StaticShXMikolaj Konarski2026-03-15
|
* Prefer newtype deriving over Generic deriving for simplicityMikolaj Konarski2026-03-15
|
* Temporarily remove the UNPACK, until GHC is fixed not to crash with itMikolaj Konarski2026-03-15
|
* Optimize the representation of ListHMikolaj Konarski2026-03-15
|
* Inline SMayNat in ListHMikolaj Konarski2026-03-15
|
* Clone ListX into ListHMikolaj Konarski2026-03-15
|
* Simplify the signature of fooIndexMikolaj Konarski2026-03-15
|
generated by cgit v1.3 (git 2.53.0) at 2026-04-14 09:26:40 +0200