Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
Name: ghc-unordered-containers | Distribution: SUSE Linux Enterprise 15 |
Version: 0.2.20 | Vendor: SUSE LLC <https://www.suse.com/> |
Release: 150500.3.3.1 | Build date: Tue Jan 30 10:54:32 2024 |
Group: Unspecified | Build host: xinomavro |
Size: 1335882 | Source RPM: ghc-unordered-containers-0.2.20-150500.3.3.1.src.rpm |
Packager: https://www.suse.com/ | |
Url: https://hackage.haskell.org/package/unordered-containers | |
Summary: Efficient hashing-based container types |
Efficient hashing-based container types. The containers have been optimized for performance critical use, both in terms of large data quantities and high speed. The declared cost of each operation is either worst-case or amortized, but remains valid even if structures are shared. /Security/ This package currently provides no defenses against hash collision attacks such as HashDoS. Users who need to store input from untrusted sources are advised to use 'Data.Map' or 'Data.Set' from the 'containers' package instead.
BSD-3-Clause
* Thu Jan 11 2024 [email protected] - Update unordered-containers to version 0.2.20 revision 1. [#]# [0.2.20] - January 2024 * [Allow `template-haskell-2.21`](https://github.com/haskell-unordered-containers/unordered-containers/pull/484) * [Rename confusing variables](https://github.com/haskell-unordered-containers/unordered-containers/pull/479) * [Deal with introduction of `Prelude.foldl'`](https://github.com/haskell-unordered-containers/unordered-containers/pull/480) * [Remove redundant `Hashable` constraints](https://github.com/haskell-unordered-containers/unordered-containers/pull/478) from `intersection.*` and `union.*`. * Various optimizations and cleanups: [#458](https://github.com/haskell-unordered-containers/unordered-containers/pull/458), [#469](https://github.com/haskell-unordered-containers/unordered-containers/pull/469), [#404](https://github.com/haskell-unordered-containers/unordered-containers/pull/404), [#460](https://github.com/haskell-unordered-containers/unordered-containers/pull/460), [#456](https://github.com/haskell-unordered-containers/unordered-containers/pull/456), [#433](https://github.com/haskell-unordered-containers/unordered-containers/pull/433) * Add invariant tests: [#444](https://github.com/haskell-unordered-containers/unordered-containers/pull/444), [#455](https://github.com/haskell-unordered-containers/unordered-containers/pull/455) * [Improve test case generation](https://github.com/haskell-unordered-containers/unordered-containers/pull/442) * [Improve test failure reporting](https://github.com/haskell-unordered-containers/unordered-containers/pull/440) * Sun Apr 24 2022 [email protected] - Update unordered-containers to version 0.2.19.1. [#]# [0.2.19.1] – April 2022 * [Fix bug in `intersection[With[Key]]`](https://github.com/haskell-unordered-containers/unordered-containers/pull/427) * [Improve docs of bit twiddling functions](https://github.com/haskell-unordered-containers/unordered-containers/pull/396) [0.2.19.1]: https://github.com/haskell-unordered-containers/unordered-containers/compare/v0.2.19.0...v0.2.19.1 [#]# [0.2.19.0] – April 2022 * [Make intersections much faster](https://github.com/haskell-unordered-containers/unordered-containers/pull/406) * [Fix undefined behaviour on 32-bit platforms](https://github.com/haskell-unordered-containers/unordered-containers/pull/413) * Speed up some array-appending operations: [#407](https://github.com/haskell-unordered-containers/unordered-containers/pull/407), [#409](https://github.com/haskell-unordered-containers/unordered-containers/pull/409) * [Use MathJax format for complexity annotations](https://github.com/haskell-unordered-containers/unordered-containers/pull/411) [0.2.19.0]: https://github.com/haskell-unordered-containers/unordered-containers/compare/v0.2.18.0...v0.2.19.0 [#]# [0.2.18.0] * [Fix strictness properties of `Strict.mapMaybe[WithKey]`](https://github.com/haskell-unordered-containers/unordered-containers/pull/385) * [Fix strictness properties of `Strict.alterFEager`](https://github.com/haskell-unordered-containers/unordered-containers/pull/384) * [Fix space leaks in `union[With[Key]]`](https://github.com/haskell-unordered-containers/unordered-containers/pull/380) * [Fix space leak in `Lazy.fromListWith`](https://github.com/haskell-unordered-containers/unordered-containers/pull/386) * [Speed up `difference*` and `intersection*` with `unsafeInsert`](https://github.com/haskell-unordered-containers/unordered-containers/pull/372) * [`unionArrayBy`: Find next 1-bits with `countTrailingZeros`](https://github.com/haskell-unordered-containers/unordered-containers/pull/395) - This speeds up `union*` for sparsely filled nodes, while penalizing `union` operations on densely filled nodes. * [Reduce reboxing in internal array operations](https://github.com/haskell-unordered-containers/unordered-containers/pull/377) * [Reduce code size of array operations in `union*`](https://github.com/haskell-unordered-containers/unordered-containers/pull/376) [0.2.18.0]: https://github.com/haskell-unordered-containers/unordered-containers/compare/v0.2.17.0...v0.2.18.0 * Sun Mar 06 2022 [email protected] - Update unordered-containers to version 0.2.17.0. [#]# [0.2.17.0] * [Define `dataCast1` for `HashMap`](https://github.com/haskell-unordered-containers/unordered-containers/pull/345) * [Add `Lift` instances for Template Haskell](https://github.com/haskell-unordered-containers/unordered-containers/pull/343) * [Add definitions for `stimes`](https://github.com/haskell-unordered-containers/unordered-containers/pull/340) * [Expose internal constructors for `HashSet`, `Array` and `MArray`](https://github.com/haskell-unordered-containers/unordered-containers/pull/347) * [Tweak internal `Array.insertM` function](https://github.com/haskell-unordered-containers/unordered-containers/pull/359) * [Drop support for GHC 8.0](https://github.com/haskell-unordered-containers/unordered-containers/pull/354) * [Drop support for `hashable < 1.2.5`](https://github.com/haskell-unordered-containers/unordered-containers/pull/355) * Various cleanup and documentation improvements [0.2.17.0]: https://github.com/haskell-unordered-containers/unordered-containers/compare/v0.2.16.0...v0.2.17.0 * Mon Dec 06 2021 [email protected] - Update unordered-containers to version 0.2.16.0. [#]# [0.2.16.0] * [Increase maximum branching factor from 16 to 32](https://github.com/haskell-unordered-containers/unordered-containers/pull/317) * [Tweak `union.goDifferentHash`](https://github.com/haskell-unordered-containers/unordered-containers/pull/277) * [Fix debug mode bounds check in `cloneM`](https://github.com/haskell-unordered-containers/unordered-containers/pull/331) * [Remove some old internal compatibility code](https://github.com/haskell-unordered-containers/unordered-containers/pull/334) [0.2.16.0]: https://github.com/haskell-unordered-containers/unordered-containers/compare/v0.2.15.0...v0.2.16.0 * Wed Nov 10 2021 [email protected] - Update unordered-containers to version 0.2.15.0. [#]# [0.2.15.0] * [Add security advisory regarding hash collision attacks](https://github.com/haskell-unordered-containers/unordered-containers/pull/320) * [Add support for hashable 1.4](https://github.com/haskell-unordered-containers/unordered-containers/pull/324) * [Drop support for GHC < 8](https://github.com/haskell-unordered-containers/unordered-containers/pull/323) [0.2.15.0]: https://github.com/haskell-unordered-containers/unordered-containers/compare/v0.2.14.0...v0.2.15.0 * Sat May 22 2021 [email protected] - Update unordered-containers to version 0.2.14.0. [#]# [0.2.14.0] * [Add `HashMap.mapKeys`.](https://github.com/haskell-unordered-containers/unordered-containers/pull/308) Thanks, Marco Perone! * [Add instances for `NFData1` and `NFData2`.](https://github.com/haskell-unordered-containers/unordered-containers/pull/314) Thanks, Isaac Elliott and Oleg Grenrus! * [Fix `@since`-annotation for `compose`.](https://github.com/haskell-unordered-containers/unordered-containers/pull/303) Thanks, @Mathnerd314! [0.2.14.0]: https://github.com/haskell-unordered-containers/unordered-containers/compare/v0.2.13.0...v0.2.14.0 * Thu Dec 17 2020 [email protected] - disable %{ix86} build * Tue Oct 06 2020 [email protected] - Update unordered-containers to version 0.2.13.0. Upstream has edited the change log file since the last release in a non-trivial way, i.e. they did more than just add a new entry at the top. You can review the file at: http://hackage.haskell.org/package/unordered-containers-0.2.13.0/src/CHANGES.md * Tue Aug 18 2020 [email protected] - Replace %setup -q with the more modern %autosetup macro. * Wed Aug 05 2020 [email protected] - Update unordered-containers to version 0.2.12.0. [#]# [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[.Strict].alterF`: Skip key deletion for absent keys. ([#288]) * Remove custom `unsafeShift{L,R}` definitions. ([#281]) * Various other documentation improvements. [0.2.12.0]: https://github.com/haskell-unordered-containers/unordered-containers/compare/v0.2.11.0...v0.2.12.0 [#267]: https://github.com/haskell-unordered-containers/unordered-containers/pull/267 [#281]: https://github.com/haskell-unordered-containers/unordered-containers/pull/281 [#282]: https://github.com/haskell-unordered-containers/unordered-containers/pull/282 [#283]: https://github.com/haskell-unordered-containers/unordered-containers/pull/283 [#288]: https://github.com/haskell-unordered-containers/unordered-containers/pull/288 * Thu Jun 18 2020 [email protected] - Update unordered-containers to version 0.2.11.0. [#]# 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. [#232]: https://github.com/haskell-unordered-containers/unordered-containers/issues/232 [#254]: https://github.com/haskell-unordered-containers/unordered-containers/issues/254 * Tue Jun 16 2020 [email protected] - Re-generate file with latest version of spec-cleaner. * Fri Nov 08 2019 [email protected] - Drop obsolete group attributes. * Tue Jun 11 2019 [email protected] - Update Cabal file for more accurate build dependencies. * Sat Jan 19 2019 [email protected] - Update unordered-containers to version 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. * Sat Oct 20 2018 [email protected] - Use https URL to refer to bugs.opensuse.org. * Wed Jul 18 2018 [email protected] - Cosmetic: replace tabs with blanks, strip trailing white space, and update copyright headers with spec-cleaner. * Mon May 14 2018 [email protected] - Update unordered-containers to version 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) * 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. * Thu Aug 03 2017 [email protected] - Updated with latest spec-cleaner version 0.9.8-8-geadfbbf. * Mon Mar 27 2017 [email protected] - Update to version 0.2.8.0 with cabal2obs. * Sun Jan 08 2017 [email protected] - Update to version 0.2.7.2 with cabal2obs. * Sun Jul 10 2016 [email protected] - Update to version 0.2.7.1 revision 0 with cabal2obs. * Fri Jun 10 2016 [email protected] - update to 0.2.7.1 - remove useless _service * Fix linker error related to popcnt. * Sat Feb 20 2016 [email protected] - update to 0.2.7.0 * support criterion-1.1 * Add unionWithKey for hash maps. * Tue Feb 16 2016 [email protected] - update to 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. * Tue Apr 14 2015 [email protected] - update to 0.2.5.1 * no changelog
/usr/lib64/ghc-8.10.7/unordered-containers-0.2.20 /usr/lib64/ghc-8.10.7/unordered-containers-0.2.20/libHSunordered-containers-0.2.20-HklsaqmbfhphRcLDSbMTC-ghc8.10.7.so /usr/share/licenses/ghc-unordered-containers /usr/share/licenses/ghc-unordered-containers/LICENSE
Generated by rpm2html 1.8.1
Fabrice Bellet, Tue Jul 9 19:51:39 2024