1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
Source: haskell-mersenne-random-pure64
Section: haskell
Priority: extra
Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
Uploaders: Joachim Breitner <nomeata@debian.org>
Build-Depends: debhelper (>= 9)
, cdbs
, haskell-devscripts (>= 0.9)
, ghc
, ghc-prof
, libghc-random-dev
, libghc-random-dev
, libghc-random-prof
Build-Depends-Indep: ghc-doc
, libghc-random-doc
Standards-Version: 3.9.4
Homepage: http://hackage.haskell.org/package/mersenne-random-pure64
Vcs-Darcs: http://darcs.debian.org/pkg-haskell/haskell-mersenne-random-pure64
Vcs-Browser: http://darcs.debian.org/cgi-bin/darcsweb.cgi?r=pkg-haskell/haskell-mersenne-random-pure64
Package: libghc-mersenne-random-pure64-dev
Architecture: any
Depends: ${haskell:Depends}
, ${shlibs:Depends}
, ${misc:Depends}
Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Provides: ${haskell:Provides}
Description: Fast pure pseudorandom number generator${haskell:ShortBlurb}
The Mersenne twister is a pseudorandom number generator developed by Makoto
Matsumoto and Takuji Nishimura that is based on a matrix linear recurrence
over a finite binary field. It provides for fast generation of very high
quality pseudorandom numbers.
.
This library provides a purely functional binding to the 64 bit classic
mersenne twister, along with instances of RandomGen, so the generator can be
used with System.Random. The generator should typically be a few times faster
than the default StdGen (but a tad slower than the impure 'mersenne-random'
library based on SIMD instructions and destructive state updates.
.
${haskell:Blurb}
Package: libghc-mersenne-random-pure64-prof
Architecture: any
Depends: ${haskell:Depends}
, ${misc:Depends}
Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Provides: ${haskell:Provides}
Description: Fast pure pseudorandom number generator${haskell:ShortBlurb}
The Mersenne twister is a pseudorandom number generator developed by Makoto
Matsumoto and Takuji Nishimura that is based on a matrix linear recurrence
over a finite binary field. It provides for fast generation of very high
quality pseudorandom numbers.
.
This library provides a purely functional binding to the 64 bit classic
mersenne twister, along with instances of RandomGen, so the generator can be
used with System.Random. The generator should typically be a few times faster
than the default StdGen (but a tad slower than the impure 'mersenne-random'
library based on SIMD instructions and destructive state updates.
.
${haskell:Blurb}
Package: libghc-mersenne-random-pure64-doc
Section: doc
Architecture: all
Depends: ${misc:Depends}, ${haskell:Depends}
Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Description: Fast pure pseudorandom number generator${haskell:ShortBlurb}
The Mersenne twister is a pseudorandom number generator developed by Makoto
Matsumoto and Takuji Nishimura that is based on a matrix linear recurrence
over a finite binary field. It provides for fast generation of very high
quality pseudorandom numbers.
.
This library provides a purely functional binding to the 64 bit classic
mersenne twister, along with instances of RandomGen, so the generator can be
used with System.Random. The generator should typically be a few times faster
than the default StdGen (but a tad slower than the impure 'mersenne-random'
library based on SIMD instructions and destructive state updates.
.
${haskell:Blurb}
|