/* * randombitrun - check rand bit run lengths of random() * * We will use randombit(1) to generate a stream if single bits. * The odds that we will have n bits the same in a row is 1/2^n. */ /* * Copyright 1997 by Landon Curt Noll. All Rights Reserved. * * Permission to use, copy, modify, and distribute this software and * its documentation for any purpose and without fee is hereby granted, * provided that the above copyright, this permission notice, and the * disclaimer below appear in all of the following: * * * supporting documentation * * source copies * * source works derived from this source * * binaries derived from this source or from derived source * * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR * PERFORMANCE OF THIS SOFTWARE. */ define randombitrun(run_cnt) { local i; /* index */ local max_run; /* longest run */ local long_run_cnt; /* number of runs longer than MAX_RUN */ local run; /* current run length */ local tally_sum; /* sum of all tally values */ local last; /* last random number */ local current; /* current random number */ local MAX_RUN = 18; /* max run we will keep track of */ local mat tally[1:MAX_RUN]; /* tally of length of a rise run of 'x' */ local mat prob[1:MAX_RUN]; /* prob[x] = probability of 'x' length run */ /* * parse args */ if (param(0) == 0) { run_cnt = 65536; } /* * run setup */ max_run = 0; /* no runs yet */ long_run_cnt = 0; /* no long runs set */ current = randombit(1); /* our first number */ run = 1; /* * compute the run length probabilities * * A bit run length of 'r' occurs with a probability of: * * 1/2^n; */ for (i=1; i <= MAX_RUN; ++i) { prob[i] = 1.0/(1< max_run) { max_run = run; } if (run > MAX_RUN) { ++long_run_cnt; } else { ++tally[run]; } /* start a new run */ current = randombit(1); run = 1; /* note the continuing run */ } else { ++run; } } /* determine the number of runs found */ tally_sum = matsum(tally) + long_run_cnt; /* * print the stats */ printf("random runbit test used %d values to produce %d runs\n", run_cnt, tally_sum); for (i=1; i <= MAX_RUN; ++i) { printf("length=%d\tprob=%9.7f\texpect=%d \tcount=%d \terr=%9.7f\n", i, prob[i], round(tally_sum*prob[i]), tally[i], (tally[i] - round(tally_sum*prob[i]))/tally_sum); } printf("length>%d\t\t\t\t\tcount=%d\n", MAX_RUN, long_run_cnt); printf("max length=%d\n", max_run); } if (config("lib_debug") >= 0) { print "randombitrun([run_length]) defined"; }