-
Notifications
You must be signed in to change notification settings - Fork 19
/
Copy pathsplitmix.cabal
235 lines (208 loc) · 6.08 KB
/
splitmix.cabal
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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
cabal-version: >=1.10
name: splitmix
version: 0.1.1
synopsis: Fast Splittable PRNG
description:
Pure Haskell implementation of SplitMix described in
.
Guy L. Steele, Jr., Doug Lea, and Christine H. Flood. 2014.
Fast splittable pseudorandom number generators. In Proceedings
of the 2014 ACM International Conference on Object Oriented
Programming Systems Languages & Applications (OOPSLA '14). ACM,
New York, NY, USA, 453-472. DOI:
<https://doi.org/10.1145/2660193.2660195>
.
The paper describes a new algorithm /SplitMix/ for /splittable/
pseudorandom number generator that is quite fast: 9 64 bit arithmetic/logical
operations per 64 bits generated.
.
/SplitMix/ is tested with two standard statistical test suites (DieHarder and
TestU01, this implementation only using the former) and it appears to be
adequate for "everyday" use, such as Monte Carlo algorithms and randomized
data structures where speed is important.
.
In particular, it __should not be used for cryptographic or security applications__,
because generated sequences of pseudorandom values are too predictable
(the mixing functions are easily inverted, and two successive outputs
suffice to reconstruct the internal state).
license: BSD3
license-file: LICENSE
maintainer: Oleg Grenrus <[email protected]>
bug-reports: https://github.com/haskellari/splitmix/issues
category: System, Random
build-type: Simple
tested-with:
GHC ==8.6.5
|| ==8.8.4
|| ==8.10.4
|| ==9.0.2
|| ==9.2.8
|| ==9.4.8
|| ==9.6.6
|| ==9.8.4
|| ==9.10.1
|| ==9.12.1
extra-source-files:
Changelog.md
make-hugs.sh
README.md
test-hugs.sh
flag optimised-mixer
description: Use JavaScript for mix32
manual: True
default: False
library
default-language: Haskell2010
ghc-options: -Wall
hs-source-dirs: src src-compat
exposed-modules:
System.Random.SplitMix
System.Random.SplitMix32
other-modules:
Data.Bits.Compat
System.Random.SplitMix.Init
-- dump-core
-- build-depends: dump-core
-- ghc-options: -fplugin=DumpCore -fplugin-opt DumpCore:core-html
build-depends:
base >=4.12.0.0 && <4.22
, deepseq >=1.4.4.0 && <1.6
if flag(optimised-mixer)
cpp-options: -DOPTIMISED_MIX32=1
-- We don't want to depend on time, nor unix or Win32 packages
-- because it's valuable that splitmix and QuickCheck doesn't
-- depend on about anything
if impl(ghcjs)
cpp-options: -DSPLITMIX_INIT_GHCJS=1
else
if impl(ghc)
cpp-options: -DSPLITMIX_INIT_C=1
if os(windows)
c-sources: cbits-win/init.c
else
c-sources: cbits-unix/init.c
else
cpp-options: -DSPLITMIX_INIT_COMPAT=1
build-depends: time >=1.2.0.3 && <1.15
source-repository head
type: git
location: https://github.com/haskellari/splitmix.git
benchmark comparison
type: exitcode-stdio-1.0
default-language: Haskell2010
ghc-options: -Wall
hs-source-dirs: bench
main-is: Bench.hs
build-depends:
base
, containers >=0.6.0.1 && <0.8
, criterion >=1.6.0.0 && <1.7
, random
, splitmix
, tf-random >=0.5 && <0.6
benchmark simple-sum
type: exitcode-stdio-1.0
default-language: Haskell2010
ghc-options: -Wall
hs-source-dirs: bench
main-is: SimpleSum.hs
build-depends:
base
, random
, splitmix
benchmark range
type: exitcode-stdio-1.0
default-language: Haskell2010
ghc-options: -Wall
hs-source-dirs: bench src-compat
main-is: Range.hs
other-modules: Data.Bits.Compat
build-depends:
base
, random
, splitmix
test-suite examples
type: exitcode-stdio-1.0
default-language: Haskell2010
ghc-options: -Wall
hs-source-dirs: tests
main-is: Examples.hs
build-depends:
base
, HUnit >=1.6.0.0 && <1.7
, splitmix
test-suite splitmix-tests
type: exitcode-stdio-1.0
default-language: Haskell2010
ghc-options: -Wall
hs-source-dirs: tests
main-is: Tests.hs
other-modules:
MiniQC
Uniformity
build-depends:
base
, containers >=0.4.0.0 && <0.8
, HUnit >=1.6.0.0 && <1.7
, math-functions >=0.3.3.0 && <0.4
, splitmix
, test-framework >=0.8.2.0 && <0.9
, test-framework-hunit >=0.3.0.2 && <0.4
test-suite montecarlo-pi
type: exitcode-stdio-1.0
default-language: Haskell2010
ghc-options: -Wall
hs-source-dirs: tests
main-is: SplitMixPi.hs
build-depends:
base
, splitmix
test-suite montecarlo-pi-32
type: exitcode-stdio-1.0
default-language: Haskell2010
ghc-options: -Wall
hs-source-dirs: tests
main-is: SplitMixPi32.hs
build-depends:
base
, splitmix
test-suite splitmix-dieharder
default-language: Haskell2010
type: exitcode-stdio-1.0
ghc-options: -Wall -threaded -rtsopts
hs-source-dirs: tests
main-is: Dieharder.hs
build-depends:
async >=2.2.1 && <2.3
, base
, bytestring >=0.10.8.2 && <0.13
, deepseq
, process >=1.6.0.0 && <1.7
, random
, splitmix
, tf-random >=0.5 && <0.6
, vector >=0.13.0.0 && <0.14
test-suite splitmix-testu01
if !os(linux)
buildable: False
default-language: Haskell2010
type: exitcode-stdio-1.0
ghc-options: -Wall -threaded -rtsopts
hs-source-dirs: tests
main-is: TestU01.hs
c-sources: tests/cbits/testu01.c
extra-libraries: testu01
build-depends:
base
, base-compat-batteries >=0.10.5 && <0.15
, splitmix
test-suite initialization
default-language: Haskell2010
type: exitcode-stdio-1.0
ghc-options: -Wall -threaded -rtsopts
hs-source-dirs: tests
main-is: Initialization.hs
build-depends:
base
, HUnit >=1.6.0.0 && <1.7
, splitmix