2 randbit - additive 55 shuffle pseudo-random number generator
13 If x > 0, randbit(x) returns a pseudo-random integer in [0, 2^x),
14 i.e. the same as rand(2^x). If the integer returned is
16 b_1 * 2^(x-1) + b_2 * 2^(x-2) + ... + b_n,
18 where each b_i is 0 or 1, then b_1, b_2, ..., b_n may be
19 considered as a sequence of x random bits.
21 If x <= 0, randbit(x) causes the random-number generator to skip
22 abs(x) bits, and returns abs(x).
24 If x is omitted, it is assumed to have the value of 1.
26 See the rand() help page for details on the additive 55 shuffle
27 pseudo-random number generator.
30 > print srand(0), randbit(20), randbit(20), randbit(20), randbit(20)
31 RAND state 817647 476130 944201 822573
33 > print srand(0), randbit(-20), randbit(20), randbit(-20), randbit(20)
34 RAND state 20 476130 20 822573
40 void zrand(long cnt, ZVALUE *res)
43 seed, srand, randbit, isrand, random, srandom, israndom