Subtractive generator: Difference between revisions
m
→{{header|Wren}}: Changed to Wren S/H
(Added Gambas) |
m (→{{header|Wren}}: Changed to Wren S/H) |
||
| (4 intermediate revisions by 2 users not shown) | |||
Line 811:
This implementation never uses multiplication, but it does use modulus (remainder from division) to put each random number in range from 0 to 10^9 - 1.
=={{header|EasyLang}}==
{{trans|C}}
<syntaxhighlight>
MOD = 1000000000
len state[] 55
arrbase state[] 0
global si sj .
funcdecl subrand .
proc subrand_seed p1 . .
p2 = 1
state[0] = p1 mod MOD
j = 21
for i = 1 to 54
state[j] = p2
p2 = (p1 - p2) mod MOD
p1 = state[j]
j = (j + 21) mod 55
.
si = 0
sj = 24
for i = 0 to 164
h = subrand
h = h
.
.
func subrand .
if si = sj
subrand_seed 0
.
si = (si - 1) mod 55
sj = (sj - 1) mod 55
x = (state[si] - state[sj]) mod MOD
state[si] = x
return x
.
subrand_seed 292929
for i to 10
print subrand
.
</syntaxhighlight>
=={{header|Elixir}}==
Line 1,889 ⟶ 1,930:
{{out}}
<pre>[467478574, 512932792, 539453717, 20349702, 615542081]</pre>
=={{header|Quackery}}==
<syntaxhighlight lang="Quackery"> [ stack ] is randoms ( --> s )
' [ 292929 1 ]
53 times
[ dup -2 peek
over -1 peek
- 1000000000 mod
join ]
dup witheach
[ swap
i^ 34 * 1 - 55 mod
poke ]
randoms put
[ randoms take
behead over 30 peek
- 1000000000 mod
tuck join
randoms put ] is rand ( --> n )
165 times [ rand drop ]
10 times [ rand echo cr ]</syntaxhighlight>
{{out}}
<pre>467478574
512932792
539453717
20349702
615542081
378707948
933204586
824858649
506003769
380969305</pre>
=={{header|Racket}}==
Line 2,341 ⟶ 2,421:
=={{header|Wren}}==
{{trans|C}}
<syntaxhighlight lang="
var state = List.filled(55, 0)
var si = 0
| |||