Navigation:
Browse pkgsrc
(this page)| 2024-05-09 03:32:57 by Masatake Daimon | Files touched by this commit (1137) |
Log message: Recursive revbump after changing the default Haskell compiler |
| 2024-04-30 01:10:55 by Masatake Daimon | Files touched by this commit (4) |
Log message:
devel/hs-unordered-containers: Update to 0.2.20
[0.2.20] - January 2024
Allow template-haskell-2.21
Rename confusing variables
Deal with introduction of Prelude.foldl'
Remove redundant Hashable constraints from intersection.* and union.*.
Various optimizations and cleanups: #458, #469, #404, #460, #456, #433
Add invariant tests: #444, #455
Improve test case generation
Improve test failure reporting
|
| 2023-11-02 07:37:49 by Masatake Daimon | Files touched by this commit (1141) |
Log message: Revbump all Haskell after updating lang/ghc96 |
| 2023-10-28 21:24:36 by Masatake Daimon | Files touched by this commit (1) |
Log message: devel/hs-unordered-containers: Fix build with GHC 9.6 |
| 2023-10-09 06:55:01 by Masatake Daimon | Files touched by this commit (988) |
Log message: Bump Haskell packages after updating lang/ghc94 |
| 2023-01-25 17:41:24 by Masatake Daimon | Files touched by this commit (2) |
Log message: devel/hs-unordered-containers: Fix build with GHC 9.4 |
| 2022-08-18 21:16:59 by Thomas Klausner | Files touched by this commit (2) |
Log message: ## [0.2.19.1] – April 2022 * [Fix bug in `intersection[With[Key]]`] * [Improve docs of bit twiddling functions] ## [0.2.19.0] – April 2022 * [Make intersections much faster] * [Fix undefined behaviour on 32-bit platforms] * Speed up some array-appending operations: [#407] * [Use MathJax format for complexity annotations] ## [0.2.18.0] * [Fix strictness properties of `Strict.mapMaybe[WithKey]`] * [Fix strictness properties of `Strict.alterFEager`] * [Fix space leaks in `union[With[Key]]`] * [Fix space leak in `Lazy.fromListWith`] * [Speed up `difference*` and `intersection*` with `unsafeInsert`] * [`unionArrayBy`: Find next 1-bits with `countTrailingZeros`] - This speeds up `union*` for sparsely filled nodes, while penalizing `union` \ operations on densely filled nodes. * [Reduce reboxing in internal array operations] * [Reduce code size of array operations in `union*`] ## [0.2.17.0] * [Define `dataCast1` for `HashMap`] * [Add `Lift` instances for Template Haskell] * [Add definitions for `stimes`] * [Expose internal constructors for `HashSet`, `Array` and `MArray`] * [Tweak internal `Array.insertM` function] * [Drop support for GHC 8.0] * [Drop support for `hashable < 1.2.5`] * Various cleanup and documentation improvements |
| 2022-02-26 04:58:36 by Masatake Daimon | Files touched by this commit (872) |
Log message: Bump all Haskell packages after enabling "split sections" in mk/haskell.mk |
| 2022-02-12 09:51:00 by Masatake Daimon | Files touched by this commit (575) |
Log message: revbump after changing the default Haskell compiler |
| 2022-02-11 14:43:57 by Masatake Daimon | Files touched by this commit (4) |
Log message: Update to unordered-containers-0.2.16.0 0.2.16.0 * Increase maximum branching factor from 16 to 32 * Tweak union.goDifferentHash * Fix debug mode bounds check in cloneM * Remove some old internal compatibility code 0.2.15.0 * Add security advisory regarding hash collision attacks * Add support for hashable 1.4 * Drop support for GHC < 8 0.2.14.0 * Add HashMap.mapKeys. Thanks, Marco Perone! * Add instances for NFData1 and NFData2. Thanks, Isaac Elliott and Oleg Grenrus! * Fix @since-annotation for compose. Thanks, @Mathnerd314! |
New packages: