2021-10-26 12:13:59 +02:00
|
|
|
$NetBSD: distinfo,v 1.8 2021/10/26 10:15:03 nia Exp $
|
2014-05-27 23:33:50 +02:00
|
|
|
|
2021-10-26 12:13:59 +02:00
|
|
|
BLAKE2s (unordered-containers-0.2.13.0.tar.gz) = 1ab38b3ec6ae19a5d264cdafe1b02a54c263df9d98ab7ceeb1a91876d58f7cce
|
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.
2021-04-23 08:28:04 +02:00
|
|
|
SHA512 (unordered-containers-0.2.13.0.tar.gz) = f32d6e91ba7ef54cc24562e26e8bda147e43b954966bae3f9850b0c57438e5d8af43f7a49106980d1197ff674eca7bb9a50c8895deb0e45588ec123664c6c47d
|
|
|
|
Size (unordered-containers-0.2.13.0.tar.gz) = 53379 bytes
|