Commit 5a59bf0
Replace hackish generators/shuffle with a fisher-yates implementation
This:
(sort (fn [_] (long)) coll)
Does not work on JDK7 since TimSort is clever enough to detect that the
ordering function is behaving inconsistently, resulting in:
java.lang.IllegalArgumentException:
Comparison method violates its general contract!
Also, this is just a bad idea:
A variant of the above method that has seen some use in languages
that support sorting with user-specified comparison functions is
to shuffle a list by sorting it with a comparison function that
returns random values. However, this is an extremely bad method:
it is very likely to produce highly non-uniform distributions,
which in addition depends heavily on the sorting algorithm used.
http://en.wikipedia.org/wiki/Fisher–Yates_shuffle#Comparison_with_other_shuffling_algorithms
We can't use clojure.core/shuffle since we want whatever shuffling we
do to be repeatable given the same input and same initial state of the
random number generator.
This patch provides an implementation of the fisher-yates shuffle and
then replaces the body of shuffle with a call to said function.
Signed-off-by: Stuart Halloway <stu@thinkrelevance.com>1 parent a73c11e commit 5a59bf0
1 file changed
Lines changed: 16 additions & 1 deletion
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
274 | 274 | | |
275 | 275 | | |
276 | 276 | | |
| 277 | + | |
| 278 | + | |
| 279 | + | |
| 280 | + | |
| 281 | + | |
| 282 | + | |
| 283 | + | |
| 284 | + | |
| 285 | + | |
| 286 | + | |
| 287 | + | |
| 288 | + | |
| 289 | + | |
277 | 290 | | |
278 | 291 | | |
279 | 292 | | |
280 | | - | |
| 293 | + | |
| 294 | + | |
| 295 | + | |
281 | 296 | | |
282 | 297 | | |
283 | 298 | | |
| |||
0 commit comments