John Benediktsson 04af5f2ffb hash-sets: faster implementation based on hashtables.		2013-03-07 21:43:17 -08:00
..
data	random.data: make constants available to random.data.	2012-08-04 19:17:56 -07:00
dummy	make random-32* the protocol again, add a random-32 word that doesn't scale the returned bits	2009-09-30 15:56:02 -05:00
mersenne-twister	use radix literals	2011-11-23 19:03:40 -08:00
sfmt	use radix literals	2011-11-23 19:03:40 -08:00
unix	random.unix: roll back type assertions	2011-11-16 17:29:46 -08:00
windows	Move win32-handle to windows.handles and update using lists to avoid pulling in the io backend where not necessary	2010-09-16 15:40:36 -05:00
authors.txt	Add missing meta-data	2008-09-23 16:11:59 -05:00
random-docs.factor	random: Add random-integers and random-units words.	2012-06-20 21:42:15 -07:00
random-tests.factor	random: Bump up the random unit tests from 50k to 500k. At 50k, pareto doesn't have enough samples to get the right std. At 500k, it should never fail again..	2012-08-16 14:14:08 -07:00
random.factor	hash-sets: faster implementation based on hashtables.	2013-03-07 21:43:17 -08:00
summary.txt	Add missing meta-data	2008-09-23 16:11:59 -05:00