Pseudo-random numbers/Splitmix64: Difference between revisions

{{trans|Python}}

UInt64 state

L 100'000

hist[Int(random_gen.next_float() * 5)]++

{{out}}

'''package specification:'''

package Random_Splitmix64 is

function next_float return Float;

procedure Set_State (Seed : in Unsigned_64);

'''package body:'''

Internal : Unsigned_64 := 1234567;

end Set_State;

'''Main procedure:'''

with Random_Splitmix64; use Random_Splitmix64;

with Ada.Text_IO; use Ada.Text_IO;

end Main;

{{out}}

<pre>

=={{header|ALGOL 68}}==

{{works with|ALGOL 68G|Any Tested with release 2.8.3.win32}}

# note that although LONG INT is 64 bits in Algol 68G, LONG BITS is longer than 64 bits #

LONG BITS mask 64 = LONG 16rffffffffffffffff;

print( ( newline ) )

END

{{out}}

<pre>

=={{header|C}}==

Code copied from the reference C implementation used by Java, and using GNU GCC v7.1.1.

To the extent possible under law, the author has dedicated all copyright

printf("%d: %d ", i, vec5[i]);

}

<pre>

6457827717110365317

=={{header|Factor}}==

math.statistics namespaces prettyprint sequences ;

"Seed: 987654321; first 100,000 float values histogram" print

987654321 seed 100,000 [ next-float 5 * >integer ] replicate

{{out}}

<pre>

{{works with|gforth|0.7.3}}

: rnd-base-op ( z factor shift -- u ) 2 pick swap rshift rot xor * ;

;

{{out}}

=={{header|F_Sharp|F#}}==

let a: uint64 = 0x9e3779b97f4a7c15UL

printfn "%i" fourth

printfn "%i" fifth

{{out}}

=={{header|Go}}==

import (

fmt.Printf(" %d : %d\n", i, counts[i])

}

{{out}}

=={{header|Haskell}}==

import Data.Word

import Data.List

randoms = unfoldr (pure . next)

<pre>λ> mapM_ print $ take 5 $ randoms 1234567

=={{header|Jasmin}}==

u64 c2 = 0xbf58476d1ce4e5b9;

u64 c3 = 0x94d049bb133111eb;

return result;

}

=={{header|Julia}}==

{{trans|Python}}

const C2 = 0xbf58476d1ce4e5b9

const C3 = 0x94d049bb133111eb

testSplitmix64()

<pre>

6457827717110365317

=={{header|Mathematica}}/{{header|Wolfram Language}}==

BitShiftLevelUint[z_, n_] := BitShiftRight[z, n]

MultiplyUint[z_, n_] := Mod[z n, 2^64]

GenerateRandomNumbers[1234567, 5]

nums = GenerateRandomNumbers[987654321, 10^5];

{{out}}

<pre>{6457827717110365317, 3203168211198807973, 9817491932198370423, 4593380528125082431, 16408922859458223821}

=={{header|Nim}}==

const Two64 = 2.0^64

for _ in 1..100_000:

inc counts[int(prng.nextFloat * 5)]

{{out}}

=={{header|Perl}}==

use warnings;

no warnings 'portable';

$rng = splitmix64->new(seed => 987654321);

$h{int 5 * $rng->next_float}++ for 1 .. 100_000;

{{out}}

<pre>Seed: 1234567, first 5 values:

=={{header|Phix}}==

As per [[Pseudo-random_numbers/PCG32#Phix]], resorting to mpfr/gmp

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">include</span> <span style="color: #004080;">mpfr</span><span style="color: #0000FF;">.</span><span style="color: #000000;">e</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

<span style="color: #0000FF;">?</span><span style="color: #000000;">r</span>

{{out}}

<pre>

=={{header|Object Pascal}}==

program splitmix64;

Write(i, ': ', vec[i], ' ');

end.

<pre>

6457827717110365317

=={{header|PicoLisp}}==

(de mod64 (N)

(roundf (* 5 (*/ (nextSplit) 1.0 18446744073709551616)))

1 ) )

{{out}}

<pre>

=={{header|Python}}==

C1 = 0x9e3779b97f4a7c15

C2 = 0xbf58476d1ce4e5b9

for i in range(100_000):

hist[int(random_gen.next_float() *5)] += 1

{{out}}

{{works with|Rakudo|2020.07}}

has $!state;

say "\nSeed: 987654321; first 1e5 Rat values histogram";

$rng = splitmix64.new( :seed(987654321) );

{{out}}

<pre>Seed: 1234567; first five Int values

=={{header|REXX}}==

numeric digits 200 /*ensure enough decimal digs for mult. */

parse arg n reps pick seed1 seed2 . /*obtain optional arguments from the CL*/

xor: parse arg a, b; $= /*perform a bit─wise XOR. */

do !=1 for length(a); $= $ || (substr(a,!,1) && substr(b,!,1) )

{{out|output|text=&nbsp; when using the default inputs:}}

<pre>

=={{header|Ruby}}==

MASK64 = (1 << 64) - 1

C1, C2, C3 = 0x9e3779b97f4a7c15, 0xbf58476d1ce4e5b9, 0x94d049bb133111eb

rand_gen = Splitmix64.new(987654321)

p 100_000.times.lazy.map{(rand_gen.rand_f * 5).floor}.tally.sort.to_h

{{out}}

<pre>6457827717110365317

=={{header|Sidef}}==

{{trans|Perl}}

define (

var rng = Splitmix64(987654321)

var histogram = Bag(1e5.of { floor(5*rng.next_float) }...)

{{out}}

<pre>

{{libheader|Wren-big}}

No 64 bit integers so we use BigInt with a mask.

var Const1 = BigInt.fromBaseString("9e3779b97f4a7c15", 16)

}

System.print("\nThe counts for 100,000 repetitions are:")

{{out}}