Version: 0.0.00.0.10.0.20.0.30.0.40.0.50.0.60.1.00.1.10.1.20.1.40.1.50.1.60.1.70.2.00.2.10.2.20.2.30.2.40.2.50.2.60.2.70.2.80.2.90.2.100.2.110.2.120.2.130.2.140.2.150.2.160.2.170.2.180.2.190.2.200.2.210.2.220.2.230.2.240.2.250.2.260.2.270.2.280.2.290.2.300.2.310.2.320.2.330.2.340.2.350.2.360.2.370.2.380.2.390.2.400.2.410.2.420.2.430.2.440.2.450.2.460.2.470.2.480.2.490.2.500.2.510.2.520.2.530.2.540.2.550.2.560.2.570.2.580.2.590.2.600.2.610.2.620.2.630.2.640.2.650.2.660.2.670.2.680.2.690.2.700.2.710.2.720.2.730.2.740.2.750.2.760.2.770.2.780.2.790.2.800.2.810.2.820.2.830.2.840.2.850.2.860.2.870.2.880.2.890.2.900.2.910.2.920.2.930.2.940.2.950.2.960.2.970.2.980.2.99
/**
* This is a variant of xoroshiro128plus - the fastest full-period generator passing BigCrush without systematic failures.
*
* This implementation follows the idea of the original xoroshiro128plus implementation,
* but is optimized for the JavaScript runtime. I.e.
* * The operations are performed on 32bit integers (the original implementation works with 64bit values).
* * The initial 128bit state is computed based on a 32bit seed and Xorshift32.
* * This implementation returns two 32bit values based on the 64bit value that is computed by xoroshiro128plus.
* Caution: The last addition step works slightly different than in the original implementation - the add carry of the
* first 32bit addition is not carried over to the last 32bit.
* [Reference implementation](http://vigna.di.unimi.it/xorshift/xoroshiro128plus.c)
*/
export class Xoroshiro128plus {
* @param {number} seed Unsigned 32 bit number
constructor(seed: number);
seed: number;
state: Uint32Array;
_fresh: boolean;
* @return {number} Float/Double in [0,1)
next(): number;
}
//# sourceMappingURL=Xoroshiro128plus.d.ts.map