prng-isaac 0.0.5

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: fd8d645800d3a280bb5a18a530c4f16ffb90d916
+  data.tar.gz: f5b5184556e7a028239a1f7510cde907d2dae435
+SHA512:
+  metadata.gz: 16898f276eb280b6d476252acf75ccf84dc21f257734e7d0facf13a63cd86bd4ea912930927ddacd4b4953aa0b6e09f5cb31935d11f7be06d8f1c247500cd404
+  data.tar.gz: 717f2707e46c45b6192e4dfa7244d07c2a23a80c93ec9dabd1cf5ada547b0f5e806f769c0dacccf218fc584bcdaf625b73ca869d35c8dced004a668ef5dd6d37

data/COPYING

@@ -0,0 +1,3 @@
+The ISAAC implementation is Public Domain, created by Bob Jenkins.
+
+The ruby wrapping is by Joel VanderWerf, and all wrapping code distinct from the ISAAC code is also public domain.

data/README.md

@@ -0,0 +1,9 @@
+# ISAAC #
+
+A pseudorandom number generator based on http://burtleburtle.net/bob/rand/isaac.html.
+
+Sometimes useful for simulation in place of MT19937 (which ruby's #rand is based on), even though ISAAC's number distribution quality is not as good, because it is faster and the state is lighter, so you can have many of them.
+
+This is useful when you need multiple pseudo-random sequences that are _independent_ and _recreatable_.
+
+If you care about small state and not cryptographic security, use ISAAC4: the state is about 48 bytes rather then 2K.

data/RELEASE-NOTES

@@ -0,0 +1,29 @@
+isaac 0.0.5
+
+* Classes are in PRNG module.
+
+* Added ISAAC4 for simulation (not crypo).
+
+* Add unit tests.
+
+isaac 0.0.4
+
+* Update for ruby 1.9 and 2.0.
+
+isaac 0.0.3
+
+* Based on Bob Jenkins' comments on ruby-talk, use 256-entry state vectors, rather than 16-entry. Also, some benchmarking (bench/bench.rb) verifies that,
+for long sequences, 256-entry state vectors are slightly faster, so even for simulation there is not much reason to use 16-entry vectors, unless you have a large number of sequences.
+
+* Fixed #srand so that it clears the entire state before setting the seed, so
+that an instance can be reset to produce the same sequence. However, #srand no
+longer returns the current state values, since they may differ from the original seed values.
+
+isaac 0.0.2
+
+* First public release
+
+isaac 0.0.1
+
+* Working wrapper around Bob Jenkins' ISAAC code.
+  

data/bench/bench.rb

@@ -0,0 +1,30 @@
+require 'benchmark'
+require 'isaac'
+
+include PRNG
+
+srand(1) # use ruby's prng to seed isaac
+ary = (0..255).map {rand(2**32-1)}
+r = ISAAC.new
+r.srand(ary)
+
+times = Benchmark.measure do
+  1_000_000.times do
+    r.rand32
+  end
+end
+
+puts times
+
+__END__
+
+Times to generate 1_000_000 numbers:
+
+With 256 entry state vectors (crypto):
+  1.860000   0.200000   2.060000 (  2.185345) # 2005 ThinkPad
+  0.780000   0.000000   0.780000 (  0.782771) # 2008 Eee901
+  
+With 16 entry state vectors (ok for simulation):
+  1.900000   0.200000   2.100000 (  2.224832) # 2005 ThinkPad
+  0.940000   0.000000   0.940000 (  0.947986) # 2008 Eee901
+  

data/ext/isaac/Makefile

@@ -0,0 +1,236 @@
+
+SHELL = /bin/sh
+
+# V=0 quiet, V=1 verbose.  other values don't work.
+V = 0
+Q1 = $(V:1=)
+Q = $(Q1:0=@)
+ECHO1 = $(V:1=@:)
+ECHO = $(ECHO1:0=@echo)
+
+#### Start of system configuration section. ####
+
+srcdir = .
+topdir = $(includedir)/$(RUBY_VERSION_NAME)
+hdrdir = $(includedir)/$(RUBY_VERSION_NAME)
+arch_hdrdir = $(rubyhdrdir)/$(arch)
+PATH_SEPARATOR = :
+VPATH = $(srcdir):$(arch_hdrdir)/ruby:$(hdrdir)/ruby
+prefix = $(DESTDIR)/usr/local
+rubysitearchprefix = $(rubylibprefix)/$(sitearch)
+rubyarchprefix = $(rubylibprefix)/$(arch)
+rubylibprefix = $(libdir)/$(RUBY_BASE_NAME)
+exec_prefix = $(prefix)
+vendorarchhdrdir = $(vendorhdrdir)/$(sitearch)
+sitearchhdrdir = $(sitehdrdir)/$(sitearch)
+rubyarchhdrdir = $(rubyhdrdir)/$(arch)
+vendorhdrdir = $(rubyhdrdir)/vendor_ruby
+sitehdrdir = $(rubyhdrdir)/site_ruby
+rubyhdrdir = $(includedir)/$(RUBY_VERSION_NAME)
+vendorarchdir = $(vendorlibdir)/$(sitearch)
+vendorlibdir = $(vendordir)/$(ruby_version)
+vendordir = $(rubylibprefix)/vendor_ruby
+sitearchdir = $(sitelibdir)/$(sitearch)
+sitelibdir = $(sitedir)/$(ruby_version)
+sitedir = $(rubylibprefix)/site_ruby
+rubyarchdir = $(rubylibdir)/$(arch)
+rubylibdir = $(rubylibprefix)/$(ruby_version)
+sitearchincludedir = $(includedir)/$(sitearch)
+archincludedir = $(includedir)/$(arch)
+sitearchlibdir = $(libdir)/$(sitearch)
+archlibdir = $(libdir)/$(arch)
+ridir = $(datarootdir)/$(RI_BASE_NAME)
+mandir = $(datarootdir)/man
+localedir = $(datarootdir)/locale
+libdir = $(exec_prefix)/lib
+psdir = $(docdir)
+pdfdir = $(docdir)
+dvidir = $(docdir)
+htmldir = $(docdir)
+infodir = $(datarootdir)/info
+docdir = $(datarootdir)/doc/$(PACKAGE)
+oldincludedir = $(DESTDIR)/usr/include
+includedir = $(prefix)/include
+localstatedir = $(prefix)/var
+sharedstatedir = $(prefix)/com
+sysconfdir = $(prefix)/etc
+datadir = $(datarootdir)
+datarootdir = $(prefix)/share
+libexecdir = $(exec_prefix)/libexec
+sbindir = $(exec_prefix)/sbin
+bindir = $(exec_prefix)/bin
+archdir = $(rubyarchdir)
+
+
+CC = gcc
+CXX = g++
+LIBRUBY = $(LIBRUBY_A)
+LIBRUBY_A = lib$(RUBY_SO_NAME)-static.a
+LIBRUBYARG_SHARED = -Wl,-R -Wl,$(libdir) -L$(libdir) 
+LIBRUBYARG_STATIC = -Wl,-R -Wl,$(libdir) -L$(libdir) -l$(RUBY_SO_NAME)-static
+empty =
+OUTFLAG = -o $(empty)
+COUTFLAG = -o $(empty)
+
+RUBY_EXTCONF_H = 
+cflags   =  $(optflags) $(debugflags) $(warnflags)
+optflags = -O3 -fno-fast-math
+debugflags = -ggdb3
+warnflags = -Wall -Wextra -Wno-unused-parameter -Wno-parentheses -Wno-long-long -Wno-missing-field-initializers -Wunused-variable -Wpointer-arith -Wwrite-strings -Wdeclaration-after-statement -Wimplicit-function-declaration
+CFLAGS   = -fPIC $(cflags) $(ARCH_FLAG)
+INCFLAGS = -I. -I$(arch_hdrdir) -I$(hdrdir)/ruby/backward -I$(hdrdir) -I$(srcdir)
+DEFS     = 
+CPPFLAGS =   $(DEFS) $(cppflags)
+CXXFLAGS = $(CFLAGS) $(cxxflags)
+ldflags  = -L. -fstack-protector -rdynamic -Wl,-export-dynamic
+dldflags =  
+ARCH_FLAG = 
+DLDFLAGS = $(ldflags) $(dldflags) $(ARCH_FLAG)
+LDSHARED = $(CC) -shared
+LDSHAREDXX = $(CXX) -shared
+AR = ar
+EXEEXT = 
+
+RUBY_INSTALL_NAME = ruby
+RUBY_SO_NAME = ruby
+RUBYW_INSTALL_NAME = 
+RUBY_VERSION_NAME = $(RUBY_BASE_NAME)-$(ruby_version)
+RUBYW_BASE_NAME = rubyw
+RUBY_BASE_NAME = ruby
+
+arch = x86_64-linux
+sitearch = $(arch)
+ruby_version = 2.0.0
+ruby = $(bindir)/ruby
+RUBY = $(ruby)
+ruby_headers = $(hdrdir)/ruby.h $(hdrdir)/ruby/defines.h $(arch_hdrdir)/ruby/config.h
+
+RM = rm -f
+RM_RF = $(RUBY) -run -e rm -- -rf
+RMDIRS = rmdir --ignore-fail-on-non-empty -p
+MAKEDIRS = /bin/mkdir -p
+INSTALL = /usr/bin/install -c
+INSTALL_PROG = $(INSTALL) -m 0755
+INSTALL_DATA = $(INSTALL) -m 644
+COPY = cp
+TOUCH = exit >
+
+#### End of system configuration section. ####
+
+preload = 
+
+libpath = . $(libdir)
+LIBPATH =  -L. -L$(libdir) -Wl,-R$(libdir)
+DEFFILE = 
+
+CLEANFILES = mkmf.log
+DISTCLEANFILES = 
+DISTCLEANDIRS = 
+
+extout = 
+extout_prefix = 
+target_prefix = 
+LOCAL_LIBS = 
+LIBS =   -lpthread -lrt -ldl -lcrypt -lm   -lc
+ORIG_SRCS = isaac.c rand4.c rand.c
+SRCS = $(ORIG_SRCS) 
+OBJS = isaac.o rand4.o rand.o
+HDRS = $(srcdir)/rand4.h $(srcdir)/rand.h
+TARGET = isaac
+TARGET_NAME = isaac
+TARGET_ENTRY = Init_$(TARGET_NAME)
+DLLIB = $(TARGET).so
+EXTSTATIC = 
+STATIC_LIB = 
+
+BINDIR        = $(bindir)
+RUBYCOMMONDIR = $(sitedir)$(target_prefix)
+RUBYLIBDIR    = $(sitelibdir)$(target_prefix)
+RUBYARCHDIR   = $(sitearchdir)$(target_prefix)
+HDRDIR        = $(rubyhdrdir)/ruby$(target_prefix)
+ARCHHDRDIR    = $(rubyhdrdir)/$(arch)/ruby$(target_prefix)
+
+TARGET_SO     = $(DLLIB)
+CLEANLIBS     = $(TARGET).so 
+CLEANOBJS     = *.o  *.bak
+
+all:    $(DLLIB)
+static: $(STATIC_LIB)
+.PHONY: all install static install-so install-rb
+.PHONY: clean clean-so clean-static clean-rb
+
+clean-static::
+clean-rb-default::
+clean-rb::
+clean-so::
+clean: clean-so clean-static clean-rb-default clean-rb
+		-$(Q)$(RM) $(CLEANLIBS) $(CLEANOBJS) $(CLEANFILES) .*.time
+
+distclean-rb-default::
+distclean-rb::
+distclean-so::
+distclean-static::
+distclean: clean distclean-so distclean-static distclean-rb-default distclean-rb
+		-$(Q)$(RM) Makefile $(RUBY_EXTCONF_H) conftest.* mkmf.log
+		-$(Q)$(RM) core ruby$(EXEEXT) *~ $(DISTCLEANFILES)
+		-$(Q)$(RMDIRS) $(DISTCLEANDIRS) 2> /dev/null || true
+
+realclean: distclean
+install: install-so install-rb
+
+install-so: $(DLLIB) ./.RUBYARCHDIR.time
+	$(INSTALL_PROG) $(DLLIB) $(RUBYARCHDIR)
+clean-static::
+	-$(Q)$(RM) $(STATIC_LIB)
+install-rb: pre-install-rb install-rb-default
+install-rb-default: pre-install-rb-default
+pre-install-rb: Makefile
+pre-install-rb-default: Makefile
+pre-install-rb-default:
+	$(ECHO) installing default isaac libraries
+./.RUBYARCHDIR.time:
+	$(Q) $(MAKEDIRS) $(RUBYARCHDIR)
+	$(Q) $(TOUCH) $@
+
+site-install: site-install-so site-install-rb
+site-install-so: install-so
+site-install-rb: install-rb
+
+.SUFFIXES: .c .m .cc .mm .cxx .cpp .C .o
+
+.cc.o:
+	$(ECHO) compiling $(<)
+	$(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $<
+
+.mm.o:
+	$(ECHO) compiling $(<)
+	$(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $<
+
+.cxx.o:
+	$(ECHO) compiling $(<)
+	$(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $<
+
+.cpp.o:
+	$(ECHO) compiling $(<)
+	$(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $<
+
+.C.o:
+	$(ECHO) compiling $(<)
+	$(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $<
+
+.c.o:
+	$(ECHO) compiling $(<)
+	$(Q) $(CC) $(INCFLAGS) $(CPPFLAGS) $(CFLAGS) $(COUTFLAG)$@ -c $<
+
+.m.o:
+	$(ECHO) compiling $(<)
+	$(Q) $(CC) $(INCFLAGS) $(CPPFLAGS) $(CFLAGS) $(COUTFLAG)$@ -c $<
+
+$(DLLIB): $(OBJS) Makefile
+	$(ECHO) linking shared-object $(DLLIB)
+	-$(Q)$(RM) $(@)
+	$(Q) $(LDSHARED) -o $@ $(OBJS) $(LIBPATH) $(DLDFLAGS) $(LOCAL_LIBS) $(LIBS)
+
+
+
+$(OBJS): $(HDRS) $(ruby_headers)

data/ext/isaac/extconf.rb

@@ -0,0 +1,2 @@
+require 'mkmf'
+create_makefile 'isaac'

data/ext/isaac/isaac.c

@@ -0,0 +1,246 @@
+#include "ruby.h"
+#include "rand.h"
+#include "rand4.h"
+
+#ifndef min
+# define min(a,b) (((a)<(b)) ? (a) : (b))
+#endif /* min */
+
+static VALUE
+ISAAC_s_allocate(VALUE klass)
+{
+    randctx *ctx;
+
+    return Data_Make_Struct(klass, randctx, NULL, NULL, ctx);
+}
+
+static VALUE
+ISAAC4_s_allocate(VALUE klass)
+{
+    randctx4 *ctx;
+
+    return Data_Make_Struct(klass, randctx4, NULL, NULL, ctx);
+}
+
+/*
+ * Seed the generator with an array of up to ISAAC::RANDSIZ integers in the
+ * range 0..2**32-1. More entries are ignored. Missing entries are treated
+ * as 0. Returns +nil+.
+ */
+static VALUE
+ISAAC_srand(VALUE self, VALUE ary)
+{
+    int i;
+    randctx *ctx;
+
+    Check_Type(ary, T_ARRAY);
+    
+    Data_Get_Struct(self, randctx, ctx);
+    
+    MEMZERO(ctx, randctx, 1);
+    for (i=min(RANDSIZ, RARRAY_LEN(ary))-1; i>=0; i--) {
+        ctx->randrsl[i] = NUM2UINT(RARRAY_PTR(ary)[i]);
+    }
+    isaac_init(ctx, 1);
+
+    return Qnil;
+}
+
+/*
+ * Seed the generator with an array of up to ISAAC::RANDSIZ integers in the
+ * range 0..2**32-1. More entries are ignored. Missing entries are treated
+ * as 0. Returns +nil+.
+ */
+static VALUE
+ISAAC4_srand(VALUE self, VALUE ary)
+{
+    int i;
+    randctx4 *ctx;
+
+    Check_Type(ary, T_ARRAY);
+    
+    Data_Get_Struct(self, randctx4, ctx);
+    
+    MEMZERO(ctx, randctx4, 1);
+    for (i=min(RANDSIZ4, RARRAY_LEN(ary))-1; i>=0; i--) {
+        ctx->randrsl[i] = NUM2UINT(RARRAY_PTR(ary)[i]);
+    }
+    isaac_init4(ctx, 1);
+
+    return Qnil;
+}
+
+/*
+ * Return a random integer in the range 0..2**32-1.
+ */
+static VALUE
+ISAAC_rand32(VALUE self)
+{
+    randctx *ctx;
+
+    Data_Get_Struct(self, randctx, ctx);
+
+    if (!ctx->randcnt--) {
+        isaac_rand(ctx);
+        ctx->randcnt=RANDSIZ-1;
+    }
+    
+    return UINT2NUM(ctx->randrsl[ctx->randcnt]);
+}
+
+/*
+ * Return a random integer in the range 0..2**32-1.
+ */
+static VALUE
+ISAAC4_rand32(VALUE self)
+{
+    randctx4 *ctx;
+
+    Data_Get_Struct(self, randctx4, ctx);
+
+    if (!ctx->randcnt--) {
+        isaac_rand4(ctx);
+        ctx->randcnt=RANDSIZ4-1;
+    }
+    
+    return UINT2NUM(ctx->randrsl[ctx->randcnt]);
+}
+
+/*
+ * Return a random float in the range 0..1.
+ */
+static VALUE
+ISAAC_rand(VALUE self)
+{
+    randctx *ctx;
+
+    Data_Get_Struct(self, randctx, ctx);
+
+    if (!ctx->randcnt--) {
+        isaac_rand(ctx);
+        ctx->randcnt=RANDSIZ-1;
+    }
+    
+    return rb_float_new(ctx->randrsl[ctx->randcnt] / 4294967295.0);
+}
+
+/*
+ * Return a random float in the range 0..1.
+ */
+static VALUE
+ISAAC4_rand(VALUE self)
+{
+    randctx4 *ctx;
+
+    Data_Get_Struct(self, randctx4, ctx);
+
+    if (!ctx->randcnt--) {
+        isaac_rand4(ctx);
+        ctx->randcnt=RANDSIZ4-1;
+    }
+    
+    return rb_float_new(ctx->randrsl[ctx->randcnt] / 4294967295.0);
+}
+
+static VALUE
+ISAAC_marshal_dump(VALUE self)
+{
+    randctx *ctx;
+    int i;
+    int ary_size = sizeof(randctx)/sizeof(ub4);
+    VALUE ary;
+
+    Data_Get_Struct(self, randctx, ctx);
+    
+    ary = rb_ary_new2(ary_size);
+    for (i = 0; i < ary_size; i++) {
+        rb_ary_push(ary, UINT2NUM(((ub4 *)ctx)[i]));
+    }
+    
+    return ary;
+}
+
+static VALUE
+ISAAC4_marshal_dump(VALUE self)
+{
+    randctx4 *ctx;
+    int i;
+    int ary_size = sizeof(randctx4)/sizeof(ub4);
+    VALUE ary;
+
+    Data_Get_Struct(self, randctx4, ctx);
+    
+    ary = rb_ary_new2(ary_size);
+    for (i = 0; i < ary_size; i++) {
+        rb_ary_push(ary, UINT2NUM(((ub4 *)ctx)[i]));
+    }
+    
+    return ary;
+}
+
+static VALUE
+ISAAC_marshal_load(VALUE self, VALUE ary)
+{
+    randctx *ctx;
+    int i;
+    int ary_size = sizeof(randctx)/sizeof(ub4);
+
+    Data_Get_Struct(self, randctx, ctx);
+
+    if (RARRAY_LEN(ary) != ary_size)
+        rb_raise(rb_eArgError, "bad length in loaded ISAAC data");
+
+    for (i = 0; i < ary_size; i++) {
+        ((ub4 *)ctx)[i] = NUM2UINT(RARRAY_PTR(ary)[i]);
+    }
+    
+    return self;
+}
+
+static VALUE
+ISAAC4_marshal_load(VALUE self, VALUE ary)
+{
+    randctx4 *ctx;
+    int i;
+    int ary_size = sizeof(randctx4)/sizeof(ub4);
+
+    Data_Get_Struct(self, randctx4, ctx);
+
+    if (RARRAY_LEN(ary) != ary_size)
+        rb_raise(rb_eArgError, "bad length in loaded ISAAC4 data");
+
+    for (i = 0; i < ary_size; i++) {
+        ((ub4 *)ctx)[i] = NUM2UINT(RARRAY_PTR(ary)[i]);
+    }
+    
+    return self;
+}
+
+void
+Init_isaac()
+{
+    VALUE ISAAC;
+    VALUE ISAAC4;
+    VALUE mPRNG;
+
+    mPRNG = rb_define_module("PRNG");
+    ISAAC = rb_define_class_under(mPRNG, "ISAAC", rb_cObject);
+    ISAAC4 = rb_define_class_under(mPRNG, "ISAAC4", rb_cObject);
+        
+    rb_define_alloc_func(ISAAC, ISAAC_s_allocate);
+    rb_define_method(ISAAC, "srand", ISAAC_srand, 1);
+    rb_define_method(ISAAC, "rand32", ISAAC_rand32, 0);
+    rb_define_method(ISAAC, "rand", ISAAC_rand, 0);
+    rb_define_method(ISAAC, "marshal_dump", ISAAC_marshal_dump, 0);
+    rb_define_method(ISAAC, "marshal_load", ISAAC_marshal_load, 1);
+    
+    rb_define_alloc_func(ISAAC4, ISAAC4_s_allocate);
+    rb_define_method(ISAAC4, "srand", ISAAC4_srand, 1);
+    rb_define_method(ISAAC4, "rand32", ISAAC4_rand32, 0);
+    rb_define_method(ISAAC4, "rand", ISAAC4_rand, 0);
+    rb_define_method(ISAAC4, "marshal_dump", ISAAC4_marshal_dump, 0);
+    rb_define_method(ISAAC4, "marshal_load", ISAAC4_marshal_load, 1);
+    
+    rb_const_set(ISAAC, rb_intern("RANDSIZ"), UINT2NUM(RANDSIZ));
+    rb_const_set(ISAAC4, rb_intern("RANDSIZ"), UINT2NUM(RANDSIZ4));
+}

data/ext/isaac/rand.c

@@ -0,0 +1,139 @@
+/*
+------------------------------------------------------------------------------
+rand.c: By Bob Jenkins.  My random number generator, ISAAC.  Public Domain.
+MODIFIED:
+  960327: Creation (addition of randinit, really)
+  970719: use context, not global variables, for internal state
+  980324: added main (ifdef'ed out), also rearranged randinit()
+  010626: Note that this is public domain
+  
+ADAPTED Aug2004 for use in Ruby by Joel VanderWerf
+ADAPTED Jan2010 for 64 bit systems (same algorithm and results as 32 bit)
+------------------------------------------------------------------------------
+*/
+#ifndef RAND
+#include "rand.h"
+#endif
+
+
+#define ind(mm,x)  ((mm)[(x>>2)&(RANDSIZ-1)])
+#define rngstep(mix,a,b,mm,m,m2,r,x) \
+{ \
+  x = *m;  \
+  a = ((a^(mix)) + *(m2++)); \
+  *(m++) = y = (ind(mm,x) + a + b); \
+  *(r++) = b = (ind(mm,y>>RANDSIZL) + x); \
+}
+
+void isaac_rand(ctx)
+randctx *ctx;
+{
+   register ub4 a,b,x,y,*m,*mm,*m2,*r,*mend;
+   mm=ctx->randmem; r=ctx->randrsl;
+   a = ctx->randa; b = (ctx->randb + (++ctx->randc));
+   for (m = mm, mend = m2 = m+(RANDSIZ/2); m<mend; )
+   {
+      rngstep( a<<13, a, b, mm, m, m2, r, x);
+      rngstep( a>>6 , a, b, mm, m, m2, r, x);
+      rngstep( a<<2 , a, b, mm, m, m2, r, x);
+      rngstep( a>>16, a, b, mm, m, m2, r, x);
+   }
+   for (m2 = mm; m2<mend; )
+   {
+      rngstep( a<<13, a, b, mm, m, m2, r, x);
+      rngstep( a>>6 , a, b, mm, m, m2, r, x);
+      rngstep( a<<2 , a, b, mm, m, m2, r, x);
+      rngstep( a>>16, a, b, mm, m, m2, r, x);
+   }
+   ctx->randb = b; ctx->randa = a;
+}
+
+
+#define mix(a,b,c,d,e,f,g,h) \
+{ \
+   a^=b<<11; d+=a; b+=c; \
+   b^=c>>2;  e+=b; c+=d; \
+   c^=d<<8;  f+=c; d+=e; \
+   d^=e>>16; g+=d; e+=f; \
+   e^=f<<10; h+=e; f+=g; \
+   f^=g>>4;  a+=f; g+=h; \
+   g^=h<<8;  b+=g; h+=a; \
+   h^=a>>9;  c+=h; a+=b; \
+}
+
+/* if (flag==TRUE), then use the contents of randrsl[] to initialize mm[]. */
+void isaac_init(ctx, flag)
+randctx *ctx;
+int     flag;
+{
+   int i;
+   ub4 a,b,c,d,e,f,g,h;
+   ub4 *m,*r;
+   ctx->randa = ctx->randb = ctx->randc = 0;
+   m=ctx->randmem;
+   r=ctx->randrsl;
+   a=b=c=d=e=f=g=h=0x9e3779b9;  /* the golden ratio */
+
+   for (i=0; i<4; ++i)          /* scramble it */
+   {
+     mix(a,b,c,d,e,f,g,h);
+   }
+
+   if (flag) 
+   {
+     /* initialize using the contents of r[] as the seed */
+     for (i=0; i<RANDSIZ; i+=8)
+     {
+       a+=r[i  ]; b+=r[i+1]; c+=r[i+2]; d+=r[i+3];
+       e+=r[i+4]; f+=r[i+5]; g+=r[i+6]; h+=r[i+7];
+       mix(a,b,c,d,e,f,g,h);
+       m[i  ]=a; m[i+1]=b; m[i+2]=c; m[i+3]=d;
+       m[i+4]=e; m[i+5]=f; m[i+6]=g; m[i+7]=h;
+     }
+     /* do a second pass to make all of the seed affect all of m */
+     for (i=0; i<RANDSIZ; i+=8)
+     {
+       a+=m[i  ]; b+=m[i+1]; c+=m[i+2]; d+=m[i+3];
+       e+=m[i+4]; f+=m[i+5]; g+=m[i+6]; h+=m[i+7];
+       mix(a,b,c,d,e,f,g,h);
+       m[i  ]=a; m[i+1]=b; m[i+2]=c; m[i+3]=d;
+       m[i+4]=e; m[i+5]=f; m[i+6]=g; m[i+7]=h;
+     }
+   }
+   else
+   {
+     /* fill in mm[] with messy stuff */
+     for (i=0; i<RANDSIZ; i+=8)
+     {
+       mix(a,b,c,d,e,f,g,h);
+       m[i  ]=a; m[i+1]=b; m[i+2]=c; m[i+3]=d;
+       m[i+4]=e; m[i+5]=f; m[i+6]=g; m[i+7]=h;
+     }
+   }
+
+   isaac_rand(ctx);            /* fill in the first set of results */
+   ctx->randcnt=RANDSIZ;  /* prepare to use the first set of results */
+}
+
+
+#ifdef NEVER
+#include <stdio.h>
+
+int main()
+{
+  ub4 i,j;
+  randctx ctx;
+  ctx.randa=ctx.randb=ctx.randc=(ub4)0;
+  for (i=0; i<RANDSIZ; ++i) ctx.randrsl[i]=(ub4)0;
+  isaac_init(&ctx, 1);
+  for (i=0; i<2; ++i)
+  {
+    isaac_rand(&ctx);
+    for (j=0; j<RANDSIZ; ++j)
+    {
+      printf("%.8lx",(long unsigned int)ctx.randrsl[j]);
+      if ((j&7)==7) printf("\n");
+    }
+  }
+}
+#endif

data/ext/isaac/rand.h

@@ -0,0 +1,60 @@
+/*
+------------------------------------------------------------------------------
+rand.h: definitions for a random number generator
+By Bob Jenkins, 1996, Public Domain
+MODIFIED:
+  960327: Creation (addition of randinit, really)
+  970719: use context, not global variables, for internal state
+  980324: renamed seed to flag
+  980605: recommend RANDSIZL=4 for noncryptography.
+  010626: note this is public domain
+
+ADAPTED Aug2004 for use in Ruby by Joel VanderWerf
+ADAPTED Jan2010 for 64 bit systems (same algorithm and results as 32 bit)
+------------------------------------------------------------------------------
+*/
+
+#include <stdint.h>
+
+typedef uint32_t ub4;
+
+#ifndef RAND
+#define RAND
+#define RANDSIZL   (8)  /* I recommend 8 for crypto, 4 for simulations */
+#define RANDSIZ    (1<<RANDSIZL)
+
+/* context of random number generator */
+struct randctx
+{
+  ub4 randcnt;
+  ub4 randrsl[RANDSIZ];
+  ub4 randmem[RANDSIZ];
+  ub4 randa;
+  ub4 randb;
+  ub4 randc;
+};
+typedef  struct randctx  randctx;
+
+/*
+------------------------------------------------------------------------------
+ If (flag==TRUE), then use the contents of randrsl[0..RANDSIZ-1] as the seed.
+------------------------------------------------------------------------------
+*/
+void isaac_init(randctx *r, int flag);
+
+void isaac_rand(randctx *r);
+
+
+/*
+------------------------------------------------------------------------------
+ Call rand(/o_ randctx *r _o/) to retrieve a single 32-bit random value
+------------------------------------------------------------------------------
+*/
+#define rand(r) \
+   (!(r)->randcnt-- ? \
+     (isaac_rand(r), (r)->randcnt=RANDSIZ-1, (r)->randrsl[(r)->randcnt]) : \
+     (r)->randrsl[(r)->randcnt])
+
+#endif  /* RAND */
+
+

data/ext/isaac/rand4.c

@@ -0,0 +1,131 @@
+/*
+------------------------------------------------------------------------------
+rand4.c: rand.c specialized to RANDSIZL=4
+------------------------------------------------------------------------------
+*/
+#ifndef RAND4
+#include "rand4.h"
+#endif
+
+
+#define ind(mm,x)  ((mm)[(x>>2)&(RANDSIZ4-1)])
+#define rngstep(mix,a,b,mm,m,m2,r,x) \
+{ \
+  x = *m;  \
+  a = ((a^(mix)) + *(m2++)); \
+  *(m++) = y = (ind(mm,x) + a + b); \
+  *(r++) = b = (ind(mm,y>>4) + x); \
+}
+
+void isaac_rand4(ctx)
+randctx4 *ctx;
+{
+   register ub4 a,b,x,y,*m,*mm,*m2,*r,*mend;
+   mm=ctx->randmem; r=ctx->randrsl;
+   a = ctx->randa; b = (ctx->randb + (++ctx->randc));
+   for (m = mm, mend = m2 = m+(RANDSIZ4/2); m<mend; )
+   {
+      rngstep( a<<13, a, b, mm, m, m2, r, x);
+      rngstep( a>>6 , a, b, mm, m, m2, r, x);
+      rngstep( a<<2 , a, b, mm, m, m2, r, x);
+      rngstep( a>>16, a, b, mm, m, m2, r, x);
+   }
+   for (m2 = mm; m2<mend; )
+   {
+      rngstep( a<<13, a, b, mm, m, m2, r, x);
+      rngstep( a>>6 , a, b, mm, m, m2, r, x);
+      rngstep( a<<2 , a, b, mm, m, m2, r, x);
+      rngstep( a>>16, a, b, mm, m, m2, r, x);
+   }
+   ctx->randb = b; ctx->randa = a;
+}
+
+
+#define mix(a,b,c,d,e,f,g,h) \
+{ \
+   a^=b<<11; d+=a; b+=c; \
+   b^=c>>2;  e+=b; c+=d; \
+   c^=d<<8;  f+=c; d+=e; \
+   d^=e>>16; g+=d; e+=f; \
+   e^=f<<10; h+=e; f+=g; \
+   f^=g>>4;  a+=f; g+=h; \
+   g^=h<<8;  b+=g; h+=a; \
+   h^=a>>9;  c+=h; a+=b; \
+}
+
+/* if (flag==TRUE), then use the contents of randrsl[] to initialize mm[]. */
+void isaac_init4(ctx, flag)
+randctx4 *ctx;
+int     flag;
+{
+   int i;
+   ub4 a,b,c,d,e,f,g,h;
+   ub4 *m,*r;
+   ctx->randa = ctx->randb = ctx->randc = 0;
+   m=ctx->randmem;
+   r=ctx->randrsl;
+   a=b=c=d=e=f=g=h=0x9e3779b9;  /* the golden ratio */
+
+   for (i=0; i<4; ++i)          /* scramble it */
+   {
+     mix(a,b,c,d,e,f,g,h);
+   }
+
+   if (flag) 
+   {
+     /* initialize using the contents of r[] as the seed */
+     for (i=0; i<RANDSIZ4; i+=8)
+     {
+       a+=r[i  ]; b+=r[i+1]; c+=r[i+2]; d+=r[i+3];
+       e+=r[i+4]; f+=r[i+5]; g+=r[i+6]; h+=r[i+7];
+       mix(a,b,c,d,e,f,g,h);
+       m[i  ]=a; m[i+1]=b; m[i+2]=c; m[i+3]=d;
+       m[i+4]=e; m[i+5]=f; m[i+6]=g; m[i+7]=h;
+     }
+     /* do a second pass to make all of the seed affect all of m */
+     for (i=0; i<RANDSIZ4; i+=8)
+     {
+       a+=m[i  ]; b+=m[i+1]; c+=m[i+2]; d+=m[i+3];
+       e+=m[i+4]; f+=m[i+5]; g+=m[i+6]; h+=m[i+7];
+       mix(a,b,c,d,e,f,g,h);
+       m[i  ]=a; m[i+1]=b; m[i+2]=c; m[i+3]=d;
+       m[i+4]=e; m[i+5]=f; m[i+6]=g; m[i+7]=h;
+     }
+   }
+   else
+   {
+     /* fill in mm[] with messy stuff */
+     for (i=0; i<RANDSIZ4; i+=8)
+     {
+       mix(a,b,c,d,e,f,g,h);
+       m[i  ]=a; m[i+1]=b; m[i+2]=c; m[i+3]=d;
+       m[i+4]=e; m[i+5]=f; m[i+6]=g; m[i+7]=h;
+     }
+   }
+
+   isaac_rand4(ctx);            /* fill in the first set of results */
+   ctx->randcnt=RANDSIZ4;  /* prepare to use the first set of results */
+}
+
+
+#ifdef NEVER
+#include <stdio.h>
+
+int main()
+{
+  ub4 i,j;
+  randctx4 ctx;
+  ctx.randa=ctx.randb=ctx.randc=(ub4)0;
+  for (i=0; i<RANDSIZ4; ++i) ctx.randrsl[i]=(ub4)0;
+  isaac_init4(&ctx, 1);
+  for (i=0; i<2; ++i)
+  {
+    isaac_rand4(&ctx);
+    for (j=0; j<RANDSIZ4; ++j)
+    {
+      printf("%.8lx",(long unsigned int)ctx.randrsl[j]);
+      if ((j&7)==7) printf("\n");
+    }
+  }
+}
+#endif

data/ext/isaac/rand4.h

@@ -0,0 +1,49 @@
+/*
+------------------------------------------------------------------------------
+rand4.h: rand.h specialized to RANDSIZL=4
+------------------------------------------------------------------------------
+*/
+
+#include <stdint.h>
+
+#include "rand.h"
+
+#ifndef RAND4
+#define RAND4
+#define RANDSIZ4    (1<<4)
+
+/* context of random number generator */
+struct randctx4
+{
+  ub4 randcnt;
+  ub4 randrsl[RANDSIZ4];
+  ub4 randmem[RANDSIZ4];
+  ub4 randa;
+  ub4 randb;
+  ub4 randc;
+};
+typedef  struct randctx4  randctx4;
+
+/*
+------------------------------------------------------------------------------
+ If (flag==TRUE), then use the contents of randrsl[0..RANDSIZ4-1] as the seed.
+------------------------------------------------------------------------------
+*/
+void isaac_init4(randctx4 *r, int flag);
+
+void isaac_rand4(randctx4 *r);
+
+
+/*
+------------------------------------------------------------------------------
+ Call rand4(/o_ randctx4 *r _o/) to retrieve a single 32-bit random value
+------------------------------------------------------------------------------
+*/
+#define rand4(r) \
+   (!(r)->randcnt-- ? \
+     (isaac_rand4(r), (r)->randcnt=RANDSIZ4-1, (r)->randrsl[(r)->randcnt]) : \
+     (r)->randrsl[(r)->randcnt])
+
+#endif  /* RAND4 */
+
+

data/test/test_isaac.rb

@@ -0,0 +1,63 @@
+require 'minitest/autorun'
+require 'isaac'
+
+include PRNG
+
+class TestIsaac < MiniTest::Unit::TestCase
+  SEED = (0..255).map {rand(2**32-1)}
+    # note that minitest supplies the seed to ruby's Kernel#rand
+    # use '--seed N' to select a particular seed
+
+  SEQ_1_2_3 = {
+    ISAAC4 => [
+      200253249, 3829869937, 4163837080, 3505347059, 4075830238,
+      2736331801, 3164829547, 410071848, 1780052116, 1192885451],
+    ISAAC => [
+      2356990817, 1396826555, 488165990, 3792500048, 3350490136,
+      3216315542, 2855747110, 2938836516, 2909213788, 1662784833]
+   }
+  
+  CASES = [ISAAC4, ISAAC]
+
+  def setup
+    @rs = CASES.map {|cl| r=cl.new; r.srand SEED; r}
+  end
+  
+  def test_ranges
+    @rs.each do |r|
+      range = 0..1
+      range32 = 0..2**32-1
+
+      10.times do
+        assert_includes range, r.rand, r.class
+        assert_includes range32, r.rand32, r.class
+      end
+    end
+  end  
+  
+  def test_repeatable
+    @rs.each do |r|
+      r2 = r.class.new
+      r2.srand SEED
+      10.times do
+        assert_equal(r.rand32, r2.rand32, r.class)
+      end
+    end
+  end
+  
+  def test_predictable
+    @rs.each do |r|
+      r.srand [1,2,3]
+      assert_equal(SEQ_1_2_3[r.class], (0..9).map {r.rand32}, r.class)
+    end
+  end
+  
+  def test_marshal
+    @rs.each do |r|
+      r2 = Marshal.load(Marshal.dump(r))
+      10.times do
+        assert_equal(r.rand32, r2.rand32, r.class)
+      end
+    end
+  end
+end

metadata

@@ -0,0 +1,68 @@
+--- !ruby/object:Gem::Specification
+name: prng-isaac
+version: !ruby/object:Gem::Version
+  version: 0.0.5
+platform: ruby
+authors:
+- Joel VanderWerf
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-04-22 00:00:00.000000000 Z
+dependencies: []
+description: A pseudorandom number generator based on Bob Jenkins' ISAAC; useful for
+  both simulation and crypto.
+email: vjoel@users.sourceforge.net
+executables: []
+extensions:
+- ext/isaac/extconf.rb
+extra_rdoc_files:
+- RELEASE-NOTES
+- README.md
+- COPYING
+files:
+- RELEASE-NOTES
+- README.md
+- COPYING
+- ext/isaac/extconf.rb
+- ext/isaac/isaac.c
+- ext/isaac/rand4.c
+- ext/isaac/rand.c
+- ext/isaac/rand4.h
+- ext/isaac/rand.h
+- ext/isaac/Makefile
+- bench/bench.rb
+- test/test_isaac.rb
+homepage: https://github.com/vjoel/isaac
+licenses: []
+metadata: {}
+post_install_message: 
+rdoc_options:
+- --quiet
+- --line-numbers
+- --inline-source
+- --title
+- ISAAC
+- --main
+- README.md
+require_paths:
+- lib
+- ext
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.0.3
+signing_key: 
+specification_version: 4
+summary: ISAAC pseudorandom number generator
+test_files:
+- test/test_isaac.rb