haskell-dice-entropy-conduit 1.0.0.1-6build1 source package in Ubuntu
Changelog
haskell-dice-entropy-conduit (1.0.0.1-6build1) eoan; urgency=medium * Rebuild against new GHC abi. -- Gianfranco Costamagna <email address hidden> Thu, 08 Aug 2019 14:57:16 +0200
Upload details
- Uploaded by:
- Gianfranco Costamagna
- Uploaded to:
- Eoan
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Focal | release | universe | misc |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
haskell-dice-entropy-conduit_1.0.0.1.orig.tar.gz | 12.8 KiB | 3ad040fc346586b96311ed44016e785815b075372e26890853666fcfa5eabc07 |
haskell-dice-entropy-conduit_1.0.0.1-6build1.debian.tar.xz | 2.7 KiB | 8a32801a9bbcd6e0438b71c3925a9391afe9d6a84e644aa8b246078b7f18c3e5 |
haskell-dice-entropy-conduit_1.0.0.1-6build1.dsc | 2.6 KiB | 1935ca3d37ec129ea6e43e1881a82ffd23b85d1aa6cf70bb0a8a184a87660e9a |
Available diffs
Binary packages built by this source
- libghc-dice-entropy-conduit-dev: No summary available for libghc-dice-entropy-conduit-dev in ubuntu eoan.
No description available for libghc-
dice-entropy- conduit- dev in ubuntu eoan.
- libghc-dice-entropy-conduit-doc: secure n-sided dice rolls and random sampling; documentation
Haskll library providing cryptographically secure n-sided dice rolls,
and random sampling within a given range. The technique of rejection
sampling is used to obtain the random data. The number of random
bits used is close to the optimal bound, information-theoretically
speaking.
.
This package provides the documentation for a library for the Haskell
programming language.
See http://www.haskell. org/ for more information on Haskell.
- libghc-dice-entropy-conduit-prof: secure n-sided dice rolls and random sampling; profiling libraries
Haskll library providing cryptographically secure n-sided dice rolls,
and random sampling within a given range. The technique of rejection
sampling is used to obtain the random data. The number of random
bits used is close to the optimal bound, information-theoretically
speaking.
.
This package provides a library for the Haskell programming language, compiled
for profiling. See http://www.haskell. org/ for more information on Haskell.