Anonymous user
Subtractive generator: Difference between revisions
Added Elixir
m (→{{header|Java}}: trans) |
(Added Elixir) |
||
Line 611:
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|Elixir}}==
{{trans|Ruby}}
<lang elixir>defmodule Subtractive do
def new(seed) when seed in 0..999_999_999 do
s = Enum.reduce(1..53, [1, seed], fn _,[a,b|_]=acc -> [b-a | acc] end)
|> Enum.reverse
|> List.to_tuple
state = for i <- 1..55, do: elem(s, rem(34*i, 55))
{:ok, _pid} = Agent.start_link(fn -> state end, name: :Subtractive)
Enum.each(1..220, fn _ -> rand end) # Discard first 220 elements of sequence.
end
def rand do
state = Agent.get(:Subtractive, &(&1))
n = rem(Enum.at(state, -55) - Enum.at(state, -24) + 1_000_000_000, 1_000_000_000)
:ok = Agent.update(:Subtractive, fn _ -> tl(state) ++ [n] end)
hd(state)
end
end
Subtractive.new(292929)
for _ <- 1..10, do: IO.puts Subtractive.rand</lang>
{{out}}
<pre>
467478574
512932792
539453717
20349702
615542081
378707948
933204586
824858649
506003769
380969305
</pre>
=={{header|Fortran}}==
Line 1,590 ⟶ 1,627:
0 OK, 0:864
</pre>
=={{header|zkl}}==
{{trans|Icon and Unicon}}
| |||