CVS log for pkgsrc/devel/hs-unordered-containers/buildlink3.mk

Up to [cvs.NetBSD.org] / pkgsrc / devel / hs-unordered-containers

Request diff between arbitrary revisions

Keyword substitution: kv
Default branch: MAIN

recursive revbump after patching lang/ghc910

Bump all Haskell packages after switching the default compiler.

Recursive revbump after changing the default Haskell compiler

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

Revbump all Haskell after updating lang/ghc96

Bump Haskell packages after updating lang/ghc94

revbump all the Haskell packages after modifying the runtime system of lang/ghc94

Bump all Haskell packages after enabling "split sections" in mk/haskell.mk

revbump after changing the default Haskell compiler

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!

Bump packages that depends on GHC

*: Bump PKGREVISION for ghc-9.0.1

Update to unordered-containers-0.2.13.0

0.2.13.0
* Add HashMap.compose. Thanks Alexandre Esteves.

0.2.12.0
* Add HashMap.isSubmapOf[By] and HashSet.isSubsetOf. Thanks Sven
  Keidel. (#282)
* Expose internal modules. (#283)
* Documentation improvements in Data.HashSet, including a
  beginner-friendly introduction. Thanks Matt Renaud. (#267)
* HashMap.alterF: Skip key deletion for absent keys. (#288)
* Remove custom unsafeShift{L,R} definitions. (#281)
* Various other documentation improvements.

0.2.11.0
* Add HashMap.findWithDefault (soft-deprecates
  HashMap.lookupDefault). Thanks, Matt Renaud.
* Add HashMap.fromListWithKey. Thanks, Josef Svenningsson.
* Add more folding functions and use them in Foldable
  instances. Thanks, David Feuer.
* Add HashMap.!?, a flipped version of lookup. Thanks, Matt Renaud.
* Add a Bifoldable instance for HashMap. Thanks, Joseph Sible.
* Add a HasCallStack constraint to (!). Thanks, Roman Cheplyaka.

Bug fixes
* Fix a space leak affecting updates on keys with hash
  collisions. Thanks, Neil Mitchell. (#254)
* Get rid of some silly thunks that could be left lying
  around. (#232). Thanks, David Feuer.

Other changes
* Speed up the Hashable instances for HashMap and HashSet. Thanks,
  Edward Amsden.
* Remove a dependency cycle hack from the benchmark suite. Thanks,
  Andrew Martin.
* Improve documentation. Thanks, Tristan McLeay, Li-yao Xia, Gareth
  Smith, Simon Jakobi, Sergey Vinokurov, and likely others.

Update to unordered-containers 0.2.10.0

0.2.10.0
* Add HashMap.alterF.
* Add HashMap.keysSet.
* Make HashMap.Strict.traverseWithKey force the results before
  installing them in the map.

0.2.9.0
* Add Ord/Ord1/Ord2 instances. (Thanks, Oleg Grenrus)
* Use SmallArray# instead of Array# for GHC versions 7.10 and
  above. (Thanks, Dmitry Ivanov)
* Adjust for Semigroup => Monoid proposal implementation. (Thanks,
  Ryan Scott)

Bug fixes
* Fix a strictness bug in fromListWith.
* Enable eager blackholing for pre-8.2 GHC versions to work around a
  runtime system bug. (Thanks, Ben Gamari)
* Avoid sketchy reimplementation of ST when compiling with recent GHC.

Other changes
* Remove support for GHC versions before 7.8. (Thanks, Dmitry Ivanov)
* Add internal documentaton. (Thanks, Johan Tibell)

0.2.8.0
* Add Eq1/2, Show1/2, Read1 instances with base-4.9
* Eq (HashSet a) doesn't require Hashable a anymore, only Eq a.
* Add Hashable1/2 with hashable-1.2.6.0
* Add differenceWith function.

0.2.7.2
* Don't use -fregs-graphs
* Fix benchmark compilation on stack.

0.2.7.1
* Fix linker error related to popcnt.
* Haddock improvements.
* Fix benchmark compilation when downloaded from Hackage.

0.2.7.0
* Support criterion 1.1
* Add unionWithKey for hash maps.

0.2.6.0
* Mark several modules as Trustworthy.
* Add Hashable instances for HashMap and HashSet.
* Add mapMaybe, mapMaybeWithKey, update, alter, and
  intersectionWithKey.
* Add roles.
* Add Hashable and Semigroup instances.

Bump PKGREVISION for hs-text-1.2.2.0 || hs-hashable-1.2.3.3

Bump PKGREVISION for hs-text-1.2.1.3

Update to 0.2.5.1

Changes from
https://github.com/tibbe/unordered-containers/blob/master/CHANGES.md
## 0.2.5.1 (2014-10-11)

 * Support base-4.8

Bump PKGREVISION for hs-hashable-1.2.3.2

Bump PKGREVISION for hs-text-1.2.1.1

Bump PKGREVISION for hs-text-1.2.0.3

Bump PKGREVISION for hs-text-1.2.0.2 || hs-hashable-1.2.3.0

Bump PKGREVISION for hs-text-1.2.0.0

make it clear what package depend on

discussed with wiz@.

Update to 0.2.5.0

Changes from https://github.com/tibbe/unordered-containers
0.2.5.0
 - Test Read/Show instances
 - Read instances
 - Proper Show instance for HashMap
 - IsList instances for GHC ≥ 7.8

Import unordered-containers-0.2.4.0 as devel/hs-unordered-containers,
packaged for wip by pho.

Efficient hashing-based container types. The containers have been
optimized for performance critical use, both in terms of large data
quantities and high speed.