Index index by Group index by Distribution index by Vendor index by creation date index by Name Mirrors Help Search

ghc-unordered-containers-prof-0.2.20-1.3 RPM for riscv64

From OpenSuSE Ports Tumbleweed for riscv64

Name: ghc-unordered-containers-prof Distribution: openSUSE Tumbleweed
Version: 0.2.20 Vendor: openSUSE
Release: 1.3 Build date: Thu Jan 11 07:26:58 2024
Group: Unspecified Build host: reproducible
Size: 10818976 Source RPM: ghc-unordered-containers-0.2.20-1.3.src.rpm
Packager: https://bugs.opensuse.org
Url: https://hackage.haskell.org/package/unordered-containers
Summary: Haskell unordered-containers profiling library
This package provides the Haskell unordered-containers profiling library.

Provides

Requires

License

BSD-3-Clause

Changelog

* Thu Jan 11 2024 Peter Simons <psimons@suse.com>
  - Update unordered-containers to version 0.2.20 revision 1.
    Upstream has revised the Cabal build instructions on Hackage.
* Tue Jan 09 2024 Peter Simons <psimons@suse.com>
  - Update unordered-containers to version 0.2.20.
    [#]# [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)
* Fri Oct 13 2023 Peter Simons <psimons@suse.com>
  - Update unordered-containers to version 0.2.19.1 revision 3.
    Upstream has revised the Cabal build instructions on Hackage.
* Thu Mar 30 2023 Peter Simons <psimons@suse.com>
  - Updated spec file to conform with ghc-rpm-macros-2.5.2.
* Sun Mar 12 2023 Peter Simons <psimons@suse.com>
  - Update unordered-containers to version 0.2.19.1 revision 2.
    Upstream has revised the Cabal build instructions on Hackage.
* Tue Aug 09 2022 Peter Simons <psimons@suse.com>
  - Update unordered-containers to version 0.2.19.1 revision 1.
    Upstream has revised the Cabal build instructions on Hackage.
* Sun Apr 24 2022 Peter Simons <psimons@suse.com>
  - 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 Peter Simons <psimons@suse.com>
  - 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 Peter Simons <psimons@suse.com>
  - 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 psimons@suse.com
  - 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 psimons@suse.com
  - 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

Files

/usr/lib64/ghc-9.8.2/lib/unordered-containers-0.2.20/Data/HashMap/Internal.p_hi
/usr/lib64/ghc-9.8.2/lib/unordered-containers-0.2.20/Data/HashMap/Internal/Array.p_hi
/usr/lib64/ghc-9.8.2/lib/unordered-containers-0.2.20/Data/HashMap/Internal/Debug.p_hi
/usr/lib64/ghc-9.8.2/lib/unordered-containers-0.2.20/Data/HashMap/Internal/List.p_hi
/usr/lib64/ghc-9.8.2/lib/unordered-containers-0.2.20/Data/HashMap/Internal/Strict.p_hi
/usr/lib64/ghc-9.8.2/lib/unordered-containers-0.2.20/Data/HashMap/Lazy.p_hi
/usr/lib64/ghc-9.8.2/lib/unordered-containers-0.2.20/Data/HashMap/Strict.p_hi
/usr/lib64/ghc-9.8.2/lib/unordered-containers-0.2.20/Data/HashSet.p_hi
/usr/lib64/ghc-9.8.2/lib/unordered-containers-0.2.20/Data/HashSet/Internal.p_hi
/usr/lib64/ghc-9.8.2/lib/unordered-containers-0.2.20/libHSunordered-containers-0.2.20-1GvCuIu34zm4sXWrx9nnxu_p.a


Generated by rpm2html 1.8.1

Fabrice Bellet, Tue Apr 30 23:58:22 2024