I've written a pseudorandom number generator for arbitrarily large integers, as well as a number of other utilities for pseudorandom numbers. Features:
* Everything is a lazy seq * Gaussian (mean 0, variance 1) - pseudorandom doubles * Arbitrarily large pseudorandom uniformly distributed integers on [L, U) * Lazy seq transforms from integer pseudorandom number generators to uniformly distributed bytes, longs, doubles (on [0, 1)) It's available for download as a Git repository at http://www.cs.berkeley.edu/~mhoemmen/gits/clojure-prng.git I'm releasing the code under a modified BSD license ("use as you like but give attribution and don't sue me if it breaks something"). Please let me know if you find any bugs as I've only done some informal tests. In particular, feel free to feed it into some serious PRNG test suite. mfh --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
