| Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
| Name: ghc-random-prof | Distribution: openSUSE Tumbleweed |
| Version: 1.2.1.2 | Vendor: openSUSE |
| Release: 1.5 | Build date: Sun Feb 4 17:26:32 2024 |
| Group: Unspecified | Build host: reproducible |
| Size: 3350816 | Source RPM: ghc-random-1.2.1.2-1.5.src.rpm |
| Packager: https://bugs.opensuse.org | |
| Url: https://hackage.haskell.org/package/random | |
| Summary: Haskell random profiling library | |
This package provides the Haskell random profiling library.
BSD-3-Clause
* Sun Feb 04 2024 Peter Simons <psimons@suse.com>
- Update random to version 1.2.1.2.
Upstream has not updated the file "CHANGELOG.md" since the last
release.
* Sat Sep 30 2023 Peter Simons <psimons@suse.com>
- Update random to version 1.2.1.1 revision 1.
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.
* Mon May 09 2022 Peter Simons <psimons@suse.com>
- Update random to version 1.2.1.1.
Upstream has not updated the file "CHANGELOG.md" since the last
release.
* Mon Sep 20 2021 psimons@suse.com
- Update random to version 1.2.1.
[#] 1.2.1
* Fix support for ghc-9.2 [#99](https://github.com/haskell/random/pull/99)
* Fix performance regression for ghc-9.0 [#101](https://github.com/haskell/random/pull/101)
* Add `uniformEnumM` and `uniformEnumRM`
* Add `initStdGen` [#103](https://github.com/haskell/random/pull/103)
* Add `globalStdGen` [#117](https://github.com/haskell/random/pull/117)
* Add `runStateGenST_`
* Ensure that default implementation of `ShortByteString` generation uses
unpinned memory. [#116](https://github.com/haskell/random/pull/116)
* Fix [#54](https://github.com/haskell/random/issues/54) with
[#68](https://github.com/haskell/random/pull/68) - if exactly one value in the
range of floating point is infinite, then `uniformRM`/`randomR` returns that
value.
* Add default implementation of `uniformM` that uses `Generic`
[#70](https://github.com/haskell/random/pull/70)
* `Random` instance for `CBool` [#77](https://github.com/haskell/random/pull/77)
* Addition of `TGen` and `TGenM` [#95](https://github.com/haskell/random/pull/95)
* Addition of tuple instances for `Random` up to 7-tuple
[#72](https://github.com/haskell/random/pull/72)
* Thu Jul 15 2021 psimons@suse.com
- Update random to version 1.2.0 revision 6.
Upstream has revised the Cabal build instructions on Hackage.
* Sat Jul 10 2021 psimons@suse.com
- Update random to version 1.2.0 revision 5.
[#] 1.2.0
1. Breaking change which mostly maintains backwards compatibility, see
"Breaking Changes" below.
2. Support for monadic generators e.g. [mwc-random](https://hackage.haskell.org/package/mwc-random).
3. Monadic adapters for pure generators (providing a uniform monadic
interface to pure and monadic generators).
4. Faster in all cases except one by more than x18 (N.B. x18 not 18%) and
some cases (depending on the type) faster by more than x1000 - see
below for benchmarks.
5. Passes a large number of random number test suites:
* [dieharder](http://webhome.phy.duke.edu/~rgb/General/dieharder.php "venerable")
* [TestU01 (SmallCrush, Crush, BigCrush)](http://simul.iro.umontreal.ca/testu01/tu01.html "venerable")
* [PractRand](http://pracrand.sourceforge.net/ "active")
* [gjrand](http://gjrand.sourceforge.net/ "active")
* See [random-quality](https://github.com/tweag/random-quality)
for details on how to do this yourself.
6. Better quality split as judged by these
[tests](https://www.cambridge.org/core/journals/journal-of-functional-programming/article/evaluation-of-splittable-pseudorandom-generators/3EBAA9F14939C5BB5560E32D1A132637). Again
see [random-quality](https://github.com/tweag/random-quality) for
details on how to do this yourself.
7. Unbiased generation of ranges.
8. Updated tests and benchmarks.
9. [Continuous integration](https://travis-ci.org/github/haskell/random).
[#]## Breaking Changes
Version 1.2.0 introduces these breaking changes:
* requires `base >= 4.8` (GHC-7.10)
* `StdGen` is no longer an instance of `Read`
* `randomIO` and `randomRIO` were extracted from the `Random` class into
separate functions
In addition, there may be import clashes with new functions, e.g. `uniform` and
`uniformR`.
[#]## Deprecations
Version 1.2.0 introduces `genWord64`, `genWord32` and similar methods to the
`RandomGen` class. The significantly slower method `next` and its companion
`genRange` are now deprecated.
[#]## Issues Addressed
Issue Number | Description | Comment
- -------------|-------------|--------
[25](https://github.com/haskell/random/issues/25) | The seeds generated by split are not independent | Fixed: changed algorithm to SplitMix, which provides a robust split operation
[26](https://github.com/haskell/random/issues/26) | Add Random instances for tuples | Addressed: added `Uniform` instances for up to 6-tuples
[44](https://github.com/haskell/random/issues/44) | Add Random instance for Natural | Addressed: added UniformRange instance for Natural
[51](https://github.com/haskell/random/issues/51) | Very low throughput | Fixed: see benchmarks below
[53](https://github.com/haskell/random/issues/53) | incorrect distribution of randomR for floating-point numbers | (\*)
[55](https://github.com/haskell/random/issues/55) | System/Random.hs:43:1: warning: [-Wtabs] | Fixed: No more tabs
[58](https://github.com/haskell/random/issues/58) | Why does random for Float and Double produce exactly 24 or 53 bits? | (\*)
[59](https://github.com/haskell/random/issues/59) | read :: StdGen fails for strings longer than 6 | Addressed: StdGen is no longer an instance of Read
[#]### Comments
(\*) 1.2 samples more bits but does not sample every `Float` or
`Double`. There are methods to do this but they have some downsides;
see [here](https://github.com/idontgetoutmuch/random/issues/105) for a
fuller discussion.
[#]# Benchmarks
Here are some benchmarks run on a 3.1 GHz Intel Core i7. The full
benchmarks can be run using e.g. `stack bench`. The benchmarks are
measured in milliseconds per 100,000 generations. In some cases, the
performance is over x1000 times better; the minimum performance
increase for the types listed below is more than x36.
Name | 1.1 Mean | 1.2 Mean
- -----------|----------|----------
Float | 27.819 | 0.305
Double | 50.644 | 0.328
Integer | 42.332 | 0.332
Word | 40.739 | 0.027
Int | 43.847 | 0.028
Char | 17.009 | 0.462
Bool | 17.542 | 0.027
* Thu Dec 17 2020 Ondřej Súkup <mimi.vx@gmail.com>
- disable %{ix86} build
* Mon Aug 31 2020 psimons@suse.com
- Update random to version 1.1 revision 1.
Upstream has revised the Cabal build instructions on Hackage.
* Tue Aug 18 2020 Peter Simons <psimons@suse.com>
- Replace %setup -q with the more modern %autosetup macro.
/usr/lib64/ghc-9.8.2/lib/random-1.2.1.2/System/Random.p_hi /usr/lib64/ghc-9.8.2/lib/random-1.2.1.2/System/Random/GFinite.p_hi /usr/lib64/ghc-9.8.2/lib/random-1.2.1.2/System/Random/Internal.p_hi /usr/lib64/ghc-9.8.2/lib/random-1.2.1.2/System/Random/Stateful.p_hi /usr/lib64/ghc-9.8.2/lib/random-1.2.1.2/libHSrandom-1.2.1.2-1BjvbR7PW3y33EzpDmVxhd_p.a
Generated by rpm2html 1.8.1
Fabrice Bellet, Tue Oct 29 00:05:56 2024