/usr/share/calc/help/srand is in apcalc-common 2.12.5.0-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 | NAME
srand - seed the subtractive 100 shuffle pseudo-random number generator
SYNOPSIS
srand([seed])
TYPES
seed integer, matrix of integers or rand state
return rand state
DESCRIPTION
Seed the pseudo-random number using an subtractive 100 shuffle generator.
For integer seed != 0:
Any buffered rand generator bits are flushed. The subtractive table
for the rand generator is loaded with the default subtractive table.
The low order 64 bits of seed is xor-ed against each table value.
The subtractive table is shuffled according to seed/2^64.
The following calc code produces the same effect on the internal
subtractive table:
/* reload default subtractive table xor-ed with low 64 seed bits */
seed_xor = seed & ((1<<64)-1);
for (i=0; i < 100; ++i) {
subtractive[i] = xor(default_subtractive[i], seed_xor);
}
/* shuffle the subtractive table */
seed >>= 64;
for (i=100; seed > 0 && i > 0; --i) {
quomod(seed, i+1, seed, j);
swap(subtractive[i], subtractive[j]);
}
Seed must be >= 0. All seed values < 0 are reserved for future use.
The subtractive table pointers are reset to subtractive[36]
and subtractive[99]. Last the shuffle table is loaded with
successive values from the subtractive 100 generator.
There is no limit on the size of a seed. On the other hand,
extremely large seeds require large tables and long seed times.
Using a seed in the range of [2^64, 2^64 * 100!) should be
sufficient for most purposes. An easy way to stay within this
range to to use seeds that are between 21 and 178 digits, or
64 to 588 bits long.
To help make the generator produced by seed S, significantly
different from S+1, seeds are scrambled prior to use. The
internal function randreseed64 maps [0,2^64) into [0,2^64) in a
1-to-1 and onto fashion for every 64 bits of S.
The purpose of the randreseed64() is not to add security. It
simply helps remove the human perception of the relationship
between the seed and the production of the generator.
The randreseed64 process does not reduce the security of the
rand generator. Every seed is converted into a different
unique seed. No seed is ignored or favored. See the rand
help file for details.
For integer seed == 0:
Restore the initial state and modulus of the rand generator.
After this call, the rand generator is restored to its initial
state after calc started.
The subtractive 100 pointers are reset to subtractive[36]
and subtractive[99]. Last the shuffle table is loaded with
successive values from the subtractive 100 generator.
The call:
srand(0)
restores the rand generator to the initial conditions at calc startup.
For matrix arg:
Any buffered random bits are flushed. The subtractive table with the
first 100 entries of the matrix mod 2^64.
The subtractive 100 pointers are reset to subtractive[36]
and subtractive[99]. Last the shuffle table is loaded with
successive values from the subtractive 100 generator.
This form allows one to load the internal subtractive 100 generator
with user supplied values.
The randreseed64 process is NOT applied to the matrix values.
For rand state arg:
Restore the rand state and return the previous state. Note that
the argument state is a rand state value (isrand(state) is true).
Any internally buffered random bits are restored.
All calls to srand(seed) return the previous state or current
state in case of srand(). Their return value can be supplied
to srand in restore the generator to that previous state:
state = srand(123456789);
newstate = srand(); /* save state */
x = rand();
...
srand(newstate); /* restore state to after srand(123456789) */
x1 = rand(); /* produces the same value as x */
...
srand(state); /* restore original state */
For no arg given:
Return current s100 generator state. This call does not alter
the generator state.
This call allows one to take a snapshot of the current generator state.
See the rand help file for details on the generator.
EXAMPLE
; srand(0x8d2dcb2bed3212844f4ad31)
RAND state
; state = srand();
; print rand(123), rand(123), rand(123), rand(123), rand(123), rand(123);
80 95 41 78 100 27
; print rand(123), rand(123), rand(123), rand(123), rand(123), rand(123);
122 109 12 95 80 32
; state2 = srand(state);
; print rand(123), rand(123), rand(123), rand(123), rand(123), rand(123);
80 95 41 78 100 27
; print rand(123), rand(123), rand(123), rand(123), rand(123), rand(123);
122 109 12 95 80 32
; state3 = srand();
; print state3 == state2;
1
; print rand();
10710588361472584495
LIMITS
for matrix arg, the matrix must have at least 100 integers
LINK LIBRARY
RAND *zsrand(ZVALUE *pseed, MATRIX *pmat100)
RAND *zsetrand(RAND *state)
SEE ALSO
seed, srandom, randbit, isrand, random, srandom, israndom
## Copyright (C) 1999 Landon Curt Noll
##
## Calc is open software; you can redistribute it and/or modify it under
## the terms of the version 2.1 of the GNU Lesser General Public License
## as published by the Free Software Foundation.
##
## Calc is distributed in the hope that it will be useful, but WITHOUT
## ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
## or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General
## Public License for more details.
##
## A copy of version 2.1 of the GNU Lesser General Public License is
## distributed with calc under the filename COPYING-LGPL. You should have
## received a copy with calc; if not, write to Free Software Foundation, Inc.
## 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
##
## @(#) $Revision: 30.1 $
## @(#) $Id: srand,v 30.1 2007/03/16 11:10:42 chongo Exp $
## @(#) $Source: /usr/local/src/bin/calc/help/RCS/srand,v $
##
## Under source code control: 1996/01/01 04:19:07
## File existed as early as: 1996
##
## chongo <was here> /\oo/\ http://www.isthe.com/chongo/
## Share and enjoy! :-) http://www.isthe.com/chongo/tech/comp/calc/
|