@graphty/graph-samples 0.0.1 → 0.1.2

package/dist/src/random/exp.js

@@ -0,0 +1,101 @@
+/**
+ * An exponential and the power functions built on it, returning the same bits on every JavaScript
+ * engine: a port of fdlibm's `__ieee754_exp` (e_exp.c, Sun Microsystems 1993), for the same reason
+ * and with the same technique as `detLog` in log.ts -- the exponent is read and written through a
+ * little-endian DataView and everything else is IEEE-754 double addition, subtraction,
+ * multiplication and division, which ECMAScript requires to be correctly rounded. Error below 1 ulp.
+ */
+import { detLog } from "./log.js";
+const O_THRESHOLD = 7.09782712893383973096e2;
+const U_THRESHOLD = -7.45133219101941108420e2;
+const LN2_HI = 6.93147180369123816490e-1;
+const LN2_LO = 1.90821492927058770002e-10;
+const INV_LN2 = 1.44269504088896338700;
+const TWOM1000 = 9.33263618503218878990e-302;
+const P1 = 1.66666666666666019037e-1;
+const P2 = -2.77777777770155933842e-3;
+const P3 = 6.61375632143793436117e-5;
+const P4 = -1.65339022054652515390e-6;
+const P5 = 4.13813679705723846039e-8;
+const view = new DataView(new ArrayBuffer(8));
+/**
+ * `y * 2^k` for a y in [0.5, 2) and k >= -1021, by adding k to the exponent field.
+ * @param y - the mantissa part
+ * @param k - the power of two
+ * @returns the scaled value
+ */
+function scale(y, k) {
+    view.setFloat64(0, y, true);
+    view.setInt32(4, view.getInt32(4, true) + (k << 20), true);
+    return view.getFloat64(0, true);
+}
+/**
+ * e^x, bit-identical across engines.
+ * @param x - the argument
+ * @returns e^x; +Infinity above about 709.78, 0 below about -745.13, NaN for NaN
+ */
+export function detExp(x) {
+    view.setFloat64(0, x, true);
+    const high = view.getInt32(4, true);
+    const negative = high < 0 ? 1 : 0;
+    const hx = high & 0x7fffffff;
+    if (hx >= 0x40862e42) {
+        if (hx >= 0x7ff00000) {
+            // NaN stays NaN, +Infinity stays, -Infinity gives 0
+            return negative === 0 || Number.isNaN(x) ? x + x : 0;
+        }
+        if (x > O_THRESHOLD) {
+            return Infinity;
+        }
+        if (x < U_THRESHOLD) {
+            return 0;
+        }
+    }
+    let hi = 0;
+    let lo = 0;
+    let k = 0;
+    let r = x;
+    if (hx > 0x3fd62e42) {
+        // |x| > 0.5 ln 2: reduce to r = x - k ln 2
+        if (hx < 0x3ff0a2b2) {
+            hi = negative === 0 ? x - LN2_HI : x + LN2_HI;
+            lo = negative === 0 ? LN2_LO : -LN2_LO;
+            k = 1 - negative - negative;
+        }
+        else {
+            k = Math.trunc(INV_LN2 * x + (negative === 0 ? 0.5 : -0.5));
+            hi = x - k * LN2_HI;
+            lo = k * LN2_LO;
+        }
+        r = hi - lo;
+    }
+    else if (hx < 0x3e300000) {
+        // |x| < 2^-28
+        return 1 + x;
+    }
+    const t = r * r;
+    const c = r - t * (P1 + t * (P2 + t * (P3 + t * (P4 + t * P5))));
+    if (k === 0) {
+        return 1 - ((r * c) / (c - 2.0) - r);
+    }
+    const y = 1 - (lo - (r * c) / (2.0 - c) - hi);
+    return k >= -1021 ? scale(y, k) : scale(y, k + 1000) * TWOM1000;
+}
+/**
+ * x^y as `detExp(y * detLog(x))` for x > 0: deterministic, not correctly rounded (the relative
+ * error grows with |y ln x|, about 1e-13 for the magnitudes the generators use). 0^y is 0 for
+ * y > 0.
+ * @param x - the base, >= 0
+ * @param y - the exponent
+ * @returns x^y
+ */
+export function detPow(x, y) {
+    if (x === 0) {
+        if (y === 0) {
+            return 1;
+        }
+        return y > 0 ? 0 : Infinity;
+    }
+    return detExp(y * detLog(x));
+}
+//# sourceMappingURL=exp.js.map

package/dist/src/random/exp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"exp.js","sourceRoot":"","sources":["../../../src/random/exp.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAElC,MAAM,WAAW,GAAG,wBAAwB,CAAC;AAC7C,MAAM,WAAW,GAAG,CAAC,wBAAwB,CAAC;AAC9C,MAAM,MAAM,GAAG,yBAAyB,CAAC;AACzC,MAAM,MAAM,GAAG,0BAA0B,CAAC;AAC1C,MAAM,OAAO,GAAG,sBAAsB,CAAC;AACvC,MAAM,QAAQ,GAAG,2BAA2B,CAAC;AAC7C,MAAM,EAAE,GAAG,yBAAyB,CAAC;AACrC,MAAM,EAAE,GAAG,CAAC,yBAAyB,CAAC;AACtC,MAAM,EAAE,GAAG,yBAAyB,CAAC;AACrC,MAAM,EAAE,GAAG,CAAC,yBAAyB,CAAC;AACtC,MAAM,EAAE,GAAG,yBAAyB,CAAC;AAErC,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;AAE9C;;;;;GAKG;AACH,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;IAC/B,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IAC5B,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IAC3D,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AACpC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,MAAM,CAAC,CAAS;IAC5B,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,IAAI,GAAG,UAAU,CAAC;IAC7B,IAAI,EAAE,IAAI,UAAU,EAAE,CAAC;QACnB,IAAI,EAAE,IAAI,UAAU,EAAE,CAAC;YACnB,oDAAoD;YACpD,OAAO,QAAQ,KAAK,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,CAAC;QACD,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC;YAClB,OAAO,QAAQ,CAAC;QACpB,CAAC;QACD,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC;YAClB,OAAO,CAAC,CAAC;QACb,CAAC;IACL,CAAC;IACD,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,EAAE,GAAG,UAAU,EAAE,CAAC;QAClB,2CAA2C;QAC3C,IAAI,EAAE,GAAG,UAAU,EAAE,CAAC;YAClB,EAAE,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;YAC9C,EAAE,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACvC,CAAC,GAAG,CAAC,GAAG,QAAQ,GAAG,QAAQ,CAAC;QAChC,CAAC;aAAM,CAAC;YACJ,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,GAAG,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5D,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;YACpB,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC;QACpB,CAAC;QACD,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;IAChB,CAAC;SAAM,IAAI,EAAE,GAAG,UAAU,EAAE,CAAC;QACzB,cAAc;QACd,OAAO,CAAC,GAAG,CAAC,CAAC;IACjB,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACzC,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAC9C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,QAAQ,CAAC;AACpE,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,MAAM,CAAC,CAAS,EAAE,CAAS;IACvC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACV,OAAO,CAAC,CAAC;QACb,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IAChC,CAAC;IACD,OAAO,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AACjC,CAAC"}

package/dist/src/random/log.d.ts

@@ -0,0 +1,19 @@
+/**
+ * A natural logarithm that returns the same bits on every JavaScript engine.
+ *
+ * ECMAScript leaves `Math.log` "implementation-approximated", so two engines may differ in the
+ * last bit, and a geometric skip `floor(log(u) / log(1 - p))` that lands on an integer boundary
+ * would then pick a different edge. This is a port of fdlibm's `__ieee754_log` (e_log.c, Sun
+ * Microsystems 1993, the code V8 and SpiderMonkey themselves use): it reads the exponent and
+ * mantissa through a little-endian DataView and otherwise uses only IEEE-754 double addition,
+ * subtraction, multiplication and division, which ECMAScript requires to be correctly rounded
+ * (and forbids from being fused). So the result is a pure function of the input bits.
+ * Error below 1 ulp.
+ */
+/**
+ * The natural logarithm of `x`, bit-identical across engines.
+ * @param input - the argument
+ * @returns ln(input); -Infinity for 0, NaN for negative input or NaN
+ */
+export declare function detLog(input: number): number;
+//# sourceMappingURL=log.d.ts.map

package/dist/src/random/log.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"log.d.ts","sourceRoot":"","sources":["../../../src/random/log.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAeH;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAsD5C"}

package/dist/src/random/log.js

@@ -0,0 +1,83 @@
+/**
+ * A natural logarithm that returns the same bits on every JavaScript engine.
+ *
+ * ECMAScript leaves `Math.log` "implementation-approximated", so two engines may differ in the
+ * last bit, and a geometric skip `floor(log(u) / log(1 - p))` that lands on an integer boundary
+ * would then pick a different edge. This is a port of fdlibm's `__ieee754_log` (e_log.c, Sun
+ * Microsystems 1993, the code V8 and SpiderMonkey themselves use): it reads the exponent and
+ * mantissa through a little-endian DataView and otherwise uses only IEEE-754 double addition,
+ * subtraction, multiplication and division, which ECMAScript requires to be correctly rounded
+ * (and forbids from being fused). So the result is a pure function of the input bits.
+ * Error below 1 ulp.
+ */
+const LN2_HI = 6.9314718036912381649e-1; // 3fe62e42 fee00000
+const LN2_LO = 1.90821492927058770002e-10; // 3dea39ef 35793c76
+const TWO54 = 1.8014398509481984e16; // 43500000 00000000
+const LG1 = 6.66666666666673513e-1; // 3FE55555 55555593
+const LG2 = 3.999999999940941908e-1; // 3FD99999 9997FA04
+const LG3 = 2.857142874366239149e-1; // 3FD24924 94229359
+const LG4 = 2.222219843214978396e-1; // 3FCC71C5 1D8E78AF
+const LG5 = 1.818357216161805012e-1; // 3FC74664 96CB03DE
+const LG6 = 1.531383769920937332e-1; // 3FC39A09 D078C69F
+const LG7 = 1.479819860511658591e-1; // 3FC2F112 DF3E5244
+const view = new DataView(new ArrayBuffer(8));
+/**
+ * The natural logarithm of `x`, bit-identical across engines.
+ * @param input - the argument
+ * @returns ln(input); -Infinity for 0, NaN for negative input or NaN
+ */
+export function detLog(input) {
+    let x = input;
+    view.setFloat64(0, x, true);
+    let hx = view.getInt32(4, true);
+    const lx = view.getUint32(0, true);
+    let k = 0;
+    if (hx < 0x00100000) {
+        if (((hx & 0x7fffffff) | lx) === 0) {
+            return -Infinity;
+        }
+        if (hx < 0) {
+            return NaN;
+        }
+        // subnormal: scale up
+        k -= 54;
+        x *= TWO54;
+        view.setFloat64(0, x, true);
+        hx = view.getInt32(4, true);
+    }
+    if (hx >= 0x7ff00000) {
+        return x + x;
+    }
+    k += (hx >> 20) - 1023;
+    hx &= 0x000fffff;
+    const i0 = (hx + 0x95f64) & 0x100000;
+    // normalize x or x/2
+    view.setInt32(4, hx | (i0 ^ 0x3ff00000), true);
+    x = view.getFloat64(0, true);
+    k += i0 >> 20;
+    const f = x - 1.0;
+    if ((0x000fffff & (2 + hx)) < 3) {
+        // |f| < 2**-20
+        if (f === 0) {
+            return k === 0 ? 0 : k * LN2_HI + k * LN2_LO;
+        }
+        const r = f * f * (0.5 - 0.3333333333333333 * f);
+        return k === 0 ? f - r : k * LN2_HI - (r - k * LN2_LO - f);
+    }
+    const s = f / (2.0 + f);
+    const dk = k;
+    const z = s * s;
+    let i = hx - 0x6147a;
+    const w = z * z;
+    const j = 0x6b851 - hx;
+    const t1 = w * (LG2 + w * (LG4 + w * LG6));
+    const t2 = z * (LG1 + w * (LG3 + w * (LG5 + w * LG7)));
+    i |= j;
+    const R = t2 + t1;
+    if (i > 0) {
+        const hfsq = 0.5 * f * f;
+        return k === 0 ? f - (hfsq - s * (hfsq + R)) : dk * LN2_HI - (hfsq - (s * (hfsq + R) + dk * LN2_LO) - f);
+    }
+    return k === 0 ? f - s * (f - R) : dk * LN2_HI - (s * (f - R) - dk * LN2_LO - f);
+}
+//# sourceMappingURL=log.js.map

package/dist/src/random/log.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"log.js","sourceRoot":"","sources":["../../../src/random/log.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,MAAM,MAAM,GAAG,wBAAwB,CAAC,CAAC,oBAAoB;AAC7D,MAAM,MAAM,GAAG,0BAA0B,CAAC,CAAC,oBAAoB;AAC/D,MAAM,KAAK,GAAG,qBAAqB,CAAC,CAAC,oBAAoB;AACzD,MAAM,GAAG,GAAG,sBAAsB,CAAC,CAAC,oBAAoB;AACxD,MAAM,GAAG,GAAG,uBAAuB,CAAC,CAAC,oBAAoB;AACzD,MAAM,GAAG,GAAG,uBAAuB,CAAC,CAAC,oBAAoB;AACzD,MAAM,GAAG,GAAG,uBAAuB,CAAC,CAAC,oBAAoB;AACzD,MAAM,GAAG,GAAG,uBAAuB,CAAC,CAAC,oBAAoB;AACzD,MAAM,GAAG,GAAG,uBAAuB,CAAC,CAAC,oBAAoB;AACzD,MAAM,GAAG,GAAG,uBAAuB,CAAC,CAAC,oBAAoB;AAEzD,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;AAE9C;;;;GAIG;AACH,MAAM,UAAU,MAAM,CAAC,KAAa;IAChC,IAAI,CAAC,GAAG,KAAK,CAAC;IACd,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IAC5B,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAChC,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAEnC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,EAAE,GAAG,UAAU,EAAE,CAAC;QAClB,IAAI,CAAC,CAAC,EAAE,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YACjC,OAAO,CAAC,QAAQ,CAAC;QACrB,CAAC;QACD,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YACT,OAAO,GAAG,CAAC;QACf,CAAC;QACD,sBAAsB;QACtB,CAAC,IAAI,EAAE,CAAC;QACR,CAAC,IAAI,KAAK,CAAC;QACX,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAC5B,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IACD,IAAI,EAAE,IAAI,UAAU,EAAE,CAAC;QACnB,OAAO,CAAC,GAAG,CAAC,CAAC;IACjB,CAAC;IACD,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC;IACvB,EAAE,IAAI,UAAU,CAAC;IACjB,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,OAAO,CAAC,GAAG,QAAQ,CAAC;IACrC,qBAAqB;IACrB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,GAAG,UAAU,CAAC,EAAE,IAAI,CAAC,CAAC;IAC/C,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC7B,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC;IACd,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IAClB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAC9B,eAAe;QACf,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACV,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC;QACjD,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,kBAAkB,GAAG,CAAC,CAAC,CAAC;QACjD,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/D,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACxB,MAAM,EAAE,GAAG,CAAC,CAAC;IACb,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC;IACrB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,MAAM,CAAC,GAAG,OAAO,GAAG,EAAE,CAAC;IACvB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAC3C,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC,IAAI,CAAC,CAAC;IACP,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;IAClB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACR,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QACzB,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7G,CAAC;IACD,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC;AACrF,CAAC"}

package/dist/src/random/stream.d.ts

@@ -0,0 +1,93 @@
+/**
+ * The one random number source of @graphty/graph-samples, and its determinism contract.
+ *
+ * A stream is named by `(seed, domain, block)`:
+ *
+ * - `seed` is the caller's seed, any safe integer in [0, 2^53).
+ * - `domain` is a fixed ASCII name per generator and purpose ("gnp", "sbm", ...). It is hashed
+ *   with 32-bit FNV-1a to `domainId`.
+ * - `block` is a unit of work the ALGORITHM defines (a row of the adjacency matrix, a node), an
+ *   integer in [0, 2^32). It never depends on how many workers or chunks run the generator.
+ *
+ * The stream's key is `Threefry2x32-20(key = (seed mod 2^32, floor(seed / 2^32)),
+ * counter = (domainId, block))`, and its words are `Threefry2x32-20(key = streamKey,
+ * counter = (i mod 2^32, floor(i / 2^32)))` for i = 0, 1, 2, ..., two words per counter, word 0
+ * first. Every draw below is defined in terms of those words with integer-exact arithmetic, so the
+ * same `(seed, domain, block)` yields the same values on every engine, platform and version.
+ * `test/random/stream.test.ts` freezes it with golden values: changing anything here changes every
+ * seeded graph, which is a breaking change of the package.
+ */
+/**
+ * 32-bit FNV-1a over the UTF-16 code units of `name` (the names are ASCII, so this is the bytes).
+ * @param name - the domain name
+ * @returns the unsigned 32-bit hash
+ */
+export declare function domainId(name: string): number;
+/**
+ * The seed every random generator uses when the caller gives none: 0. A fixed default, never the
+ * clock, so an unseeded call is as reproducible as a seeded one. Frozen with the rest of the
+ * contract: changing it changes every unseeded graph.
+ */
+export declare const DEFAULT_SEED = 0;
+/**
+ * The caller's seed, or {@link DEFAULT_SEED} when it is undefined; throws on an invalid seed.
+ * @param seed - the seed option
+ * @returns the seed to use
+ */
+export declare function resolveSeed(seed: number | undefined): number;
+/**
+ * Throw unless `seed` is a safe non-negative integer.
+ * @param seed - the seed
+ */
+export declare function checkSeed(seed: number): void;
+/** A deterministic stream of random words keyed by (seed, domain, block). */
+export declare class RandomStream {
+    private readonly seedLo;
+    private readonly seedHi;
+    private readonly domain;
+    private readonly key;
+    private readonly out;
+    private counter;
+    private spare;
+    /**
+     * The stream of one block.
+     * @param seed - the caller's seed, an integer in [0, 2^53)
+     * @param domain - the generator's fixed domain name
+     * @param block - the first block, an integer in [0, 2^32)
+     */
+    constructor(seed: number, domain: string, block: number);
+    /**
+     * Restart the stream at the first word of another block of the same seed and domain.
+     * @param block - the block, an integer in [0, 2^32)
+     */
+    reset(block: number): void;
+    /**
+     * The next word.
+     * @returns an unsigned 32-bit integer
+     */
+    nextU32(): number;
+    /**
+     * A uniform double in [0, 1) with 53 random bits: (a >>> 5) * 2^26 + (b >>> 6), over 2^53,
+     * for the next two words a and b. Exact: every step is an integer below 2^53.
+     * @returns the double
+     */
+    nextFloat(): number;
+    /**
+     * A uniform integer in [0, n) by masked rejection: draw a word, keep its low
+     * ceil(log2 n) bits, retry while the result is >= n. Exact and unbiased; fewer than two
+     * words per call on average. For n above 2^32 the high bits come from one extra word drawn
+     * first.
+     * @param n - the bound, an integer in [1, 2^53]
+     * @returns the integer
+     */
+    nextBelow(n: number): number;
+    /**
+     * The number of failures before the next success of a Bernoulli(p) sequence, given
+     * `logQ = detLog(1 - p)` for 0 < p < 1: floor(detLog(1 - u) / logQ) for u = nextFloat().
+     * The caller handles p = 0 and p = 1 without drawing.
+     * @param logQ - detLog(1 - p), negative and finite
+     * @returns a non-negative integer (possibly above 2^53 for tiny p)
+     */
+    nextSkip(logQ: number): number;
+}
+//# sourceMappingURL=stream.d.ts.map

package/dist/src/random/stream.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stream.d.ts","sourceRoot":"","sources":["../../../src/random/stream.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAQH;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAO7C;AAED;;;;GAIG;AACH,eAAO,MAAM,YAAY,IAAI,CAAC;AAE9B;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,GAAG,MAAM,CAI5D;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAI5C;AAED,6EAA6E;AAC7E,qBAAa,YAAY;IACrB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAsB;IAC1C,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAsB;IAC1C,OAAO,CAAC,OAAO,CAAK;IACpB,OAAO,CAAC,KAAK,CAAM;IAEnB;;;;;OAKG;gBACS,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAQvD;;;OAGG;IACH,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAM1B;;;OAGG;IACH,OAAO,IAAI,MAAM;IAYjB;;;;OAIG;IACH,SAAS,IAAI,MAAM;IAMnB;;;;;;;OAOG;IACH,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAqB5B;;;;;;OAMG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;CAGjC"}

package/dist/src/random/stream.js

@@ -0,0 +1,154 @@
+/**
+ * The one random number source of @graphty/graph-samples, and its determinism contract.
+ *
+ * A stream is named by `(seed, domain, block)`:
+ *
+ * - `seed` is the caller's seed, any safe integer in [0, 2^53).
+ * - `domain` is a fixed ASCII name per generator and purpose ("gnp", "sbm", ...). It is hashed
+ *   with 32-bit FNV-1a to `domainId`.
+ * - `block` is a unit of work the ALGORITHM defines (a row of the adjacency matrix, a node), an
+ *   integer in [0, 2^32). It never depends on how many workers or chunks run the generator.
+ *
+ * The stream's key is `Threefry2x32-20(key = (seed mod 2^32, floor(seed / 2^32)),
+ * counter = (domainId, block))`, and its words are `Threefry2x32-20(key = streamKey,
+ * counter = (i mod 2^32, floor(i / 2^32)))` for i = 0, 1, 2, ..., two words per counter, word 0
+ * first. Every draw below is defined in terms of those words with integer-exact arithmetic, so the
+ * same `(seed, domain, block)` yields the same values on every engine, platform and version.
+ * `test/random/stream.test.ts` freezes it with golden values: changing anything here changes every
+ * seeded graph, which is a breaking change of the package.
+ */
+import { detLog } from "./log.js";
+import { threefry2x32 } from "./threefry.js";
+const TWO_32 = 4294967296;
+const TWO_53 = 9007199254740992;
+/**
+ * 32-bit FNV-1a over the UTF-16 code units of `name` (the names are ASCII, so this is the bytes).
+ * @param name - the domain name
+ * @returns the unsigned 32-bit hash
+ */
+export function domainId(name) {
+    let h = 0x811c9dc5;
+    for (let i = 0; i < name.length; i++) {
+        h ^= name.charCodeAt(i);
+        h = Math.imul(h, 0x01000193);
+    }
+    return h >>> 0;
+}
+/**
+ * The seed every random generator uses when the caller gives none: 0. A fixed default, never the
+ * clock, so an unseeded call is as reproducible as a seeded one. Frozen with the rest of the
+ * contract: changing it changes every unseeded graph.
+ */
+export const DEFAULT_SEED = 0;
+/**
+ * The caller's seed, or {@link DEFAULT_SEED} when it is undefined; throws on an invalid seed.
+ * @param seed - the seed option
+ * @returns the seed to use
+ */
+export function resolveSeed(seed) {
+    const resolved = seed ?? DEFAULT_SEED;
+    checkSeed(resolved);
+    return resolved;
+}
+/**
+ * Throw unless `seed` is a safe non-negative integer.
+ * @param seed - the seed
+ */
+export function checkSeed(seed) {
+    if (!Number.isSafeInteger(seed) || seed < 0) {
+        throw new RangeError(`seed must be an integer in [0, 2^53), got ${String(seed)}`);
+    }
+}
+/** A deterministic stream of random words keyed by (seed, domain, block). */
+export class RandomStream {
+    /**
+     * The stream of one block.
+     * @param seed - the caller's seed, an integer in [0, 2^53)
+     * @param domain - the generator's fixed domain name
+     * @param block - the first block, an integer in [0, 2^32)
+     */
+    constructor(seed, domain, block) {
+        this.key = new Uint32Array(2);
+        this.out = new Uint32Array(2);
+        this.counter = 0;
+        this.spare = -1;
+        checkSeed(seed);
+        this.seedLo = seed >>> 0;
+        this.seedHi = Math.floor(seed / TWO_32);
+        this.domain = domainId(domain);
+        this.reset(block);
+    }
+    /**
+     * Restart the stream at the first word of another block of the same seed and domain.
+     * @param block - the block, an integer in [0, 2^32)
+     */
+    reset(block) {
+        threefry2x32(this.seedLo, this.seedHi, this.domain, block >>> 0, this.key);
+        this.counter = 0;
+        this.spare = -1;
+    }
+    /**
+     * The next word.
+     * @returns an unsigned 32-bit integer
+     */
+    nextU32() {
+        if (this.spare >= 0) {
+            const word = this.spare;
+            this.spare = -1;
+            return word;
+        }
+        const c = this.counter++;
+        threefry2x32(this.key[0], this.key[1], c >>> 0, Math.floor(c / TWO_32), this.out);
+        this.spare = this.out[1];
+        return this.out[0];
+    }
+    /**
+     * A uniform double in [0, 1) with 53 random bits: (a >>> 5) * 2^26 + (b >>> 6), over 2^53,
+     * for the next two words a and b. Exact: every step is an integer below 2^53.
+     * @returns the double
+     */
+    nextFloat() {
+        const a = this.nextU32() >>> 5;
+        const b = this.nextU32() >>> 6;
+        return (a * 67108864 + b) / TWO_53;
+    }
+    /**
+     * A uniform integer in [0, n) by masked rejection: draw a word, keep its low
+     * ceil(log2 n) bits, retry while the result is >= n. Exact and unbiased; fewer than two
+     * words per call on average. For n above 2^32 the high bits come from one extra word drawn
+     * first.
+     * @param n - the bound, an integer in [1, 2^53]
+     * @returns the integer
+     */
+    nextBelow(n) {
+        if (n <= TWO_32) {
+            const mask = n === 1 ? 0 : 0xffffffff >>> Math.clz32(n - 1);
+            for (;;) {
+                const x = (this.nextU32() & mask) >>> 0;
+                if (x < n) {
+                    return x;
+                }
+            }
+        }
+        const hiBound = Math.ceil(n / TWO_32);
+        const hiMask = 0xffffffff >>> Math.clz32(hiBound - 1);
+        for (;;) {
+            const hi = (this.nextU32() & hiMask) >>> 0;
+            const x = hi * TWO_32 + this.nextU32();
+            if (x < n) {
+                return x;
+            }
+        }
+    }
+    /**
+     * The number of failures before the next success of a Bernoulli(p) sequence, given
+     * `logQ = detLog(1 - p)` for 0 < p < 1: floor(detLog(1 - u) / logQ) for u = nextFloat().
+     * The caller handles p = 0 and p = 1 without drawing.
+     * @param logQ - detLog(1 - p), negative and finite
+     * @returns a non-negative integer (possibly above 2^53 for tiny p)
+     */
+    nextSkip(logQ) {
+        return Math.floor(detLog(1 - this.nextFloat()) / logQ);
+    }
+}
+//# sourceMappingURL=stream.js.map

package/dist/src/random/stream.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stream.js","sourceRoot":"","sources":["../../../src/random/stream.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClC,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAE7C,MAAM,MAAM,GAAG,UAAU,CAAC;AAC1B,MAAM,MAAM,GAAG,gBAAgB,CAAC;AAEhC;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACjC,IAAI,CAAC,GAAG,UAAU,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,CAAC,KAAK,CAAC,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAC;AAE9B;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,IAAwB;IAChD,MAAM,QAAQ,GAAG,IAAI,IAAI,YAAY,CAAC;IACtC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACpB,OAAO,QAAQ,CAAC;AACpB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,IAAY;IAClC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QAC1C,MAAM,IAAI,UAAU,CAAC,6CAA6C,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACtF,CAAC;AACL,CAAC;AAED,6EAA6E;AAC7E,MAAM,OAAO,YAAY;IASrB;;;;;OAKG;IACH,YAAY,IAAY,EAAE,MAAc,EAAE,KAAa;QAXtC,QAAG,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QACzB,QAAG,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,YAAO,GAAG,CAAC,CAAC;QACZ,UAAK,GAAG,CAAC,CAAC,CAAC;QASf,SAAS,CAAC,IAAI,CAAC,CAAC;QAChB,IAAI,CAAC,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACtB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,KAAa;QACf,YAAY,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,KAAK,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3E,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACpB,CAAC;IAED;;;OAGG;IACH,OAAO;QACH,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;YAClB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACxB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QACzB,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAClF,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED;;;;OAIG;IACH,SAAS;QACL,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC/B,OAAO,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;IACvC,CAAC;IAED;;;;;;;OAOG;IACH,SAAS,CAAC,CAAS;QACf,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;YACd,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5D,SAAS,CAAC;gBACN,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;gBACxC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;oBACR,OAAO,CAAC,CAAC;gBACb,CAAC;YACL,CAAC;QACL,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,UAAU,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QACtD,SAAS,CAAC;YACN,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,CAAC,GAAG,EAAE,GAAG,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YACvC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACR,OAAO,CAAC,CAAC;YACb,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,QAAQ,CAAC,IAAY;QACjB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;IAC3D,CAAC;CACJ"}

package/dist/src/random/threefry.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Threefry-2x32 with 20 rounds: the counter-based block function of J. K. Salmon, M. A. Moraes,
+ * R. O. Dror and D. E. Shaw, "Parallel random numbers: as easy as 1, 2, 3", SC11 (2011),
+ * doi:10.1145/2063384.2063405, as specified by the Random123 library and used by JAX.
+ *
+ * It maps a 64-bit key and a 64-bit counter to 64 random bits using only 32-bit addition,
+ * rotation and xor, so JavaScript computes it exactly on every engine: no floating point, no
+ * 64-bit multiply, no BigInt. It passes BigCrush with 13 rounds; 20 is Random123's default.
+ */
+/**
+ * Encrypt one 64-bit counter under one 64-bit key.
+ * @param k0 - key word 0 (unsigned 32-bit)
+ * @param k1 - key word 1 (unsigned 32-bit)
+ * @param c0 - counter word 0 (unsigned 32-bit)
+ * @param c1 - counter word 1 (unsigned 32-bit)
+ * @param out - receives the two output words
+ */
+export declare function threefry2x32(k0: number, k1: number, c0: number, c1: number, out: Uint32Array): void;
+//# sourceMappingURL=threefry.d.ts.map

package/dist/src/random/threefry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"threefry.d.ts","sourceRoot":"","sources":["../../../src/random/threefry.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAQH;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,WAAW,GAAG,IAAI,CAoBnG"}

package/dist/src/random/threefry.js

@@ -0,0 +1,43 @@
+/**
+ * Threefry-2x32 with 20 rounds: the counter-based block function of J. K. Salmon, M. A. Moraes,
+ * R. O. Dror and D. E. Shaw, "Parallel random numbers: as easy as 1, 2, 3", SC11 (2011),
+ * doi:10.1145/2063384.2063405, as specified by the Random123 library and used by JAX.
+ *
+ * It maps a 64-bit key and a 64-bit counter to 64 random bits using only 32-bit addition,
+ * rotation and xor, so JavaScript computes it exactly on every engine: no floating point, no
+ * 64-bit multiply, no BigInt. It passes BigCrush with 13 rounds; 20 is Random123's default.
+ */
+/** Rotation constants R_32x2 of Threefry-2x32 (Random123 threefry.h). */
+const ROTATIONS = [13, 15, 26, 6, 17, 29, 16, 24];
+/** The Skein key-schedule parity constant for 32-bit words. */
+const KS_PARITY = 0x1bd11bda;
+/**
+ * Encrypt one 64-bit counter under one 64-bit key.
+ * @param k0 - key word 0 (unsigned 32-bit)
+ * @param k1 - key word 1 (unsigned 32-bit)
+ * @param c0 - counter word 0 (unsigned 32-bit)
+ * @param c1 - counter word 1 (unsigned 32-bit)
+ * @param out - receives the two output words
+ */
+export function threefry2x32(k0, k1, c0, c1, out) {
+    const ks0 = k0 >>> 0;
+    const ks1 = k1 >>> 0;
+    const ks2 = (KS_PARITY ^ ks0 ^ ks1) >>> 0;
+    const ks = [ks0, ks1, ks2];
+    let x0 = (c0 + ks0) | 0;
+    let x1 = (c1 + ks1) | 0;
+    for (let round = 0; round < 20; round++) {
+        x0 = (x0 + x1) | 0;
+        const r = ROTATIONS[round & 7];
+        x1 = (x1 << r) | (x1 >>> (32 - r));
+        x1 ^= x0;
+        if ((round & 3) === 3) {
+            const s = (round + 1) >>> 2;
+            x0 = (x0 + ks[s % 3]) | 0;
+            x1 = (x1 + ks[(s + 1) % 3] + s) | 0;
+        }
+    }
+    out[0] = x0;
+    out[1] = x1;
+}
+//# sourceMappingURL=threefry.js.map

package/dist/src/random/threefry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"threefry.js","sourceRoot":"","sources":["../../../src/random/threefry.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,yEAAyE;AACzE,MAAM,SAAS,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAU,CAAC;AAE3D,+DAA+D;AAC/D,MAAM,SAAS,GAAG,UAAU,CAAC;AAE7B;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,GAAgB;IACzF,MAAM,GAAG,GAAG,EAAE,KAAK,CAAC,CAAC;IACrB,MAAM,GAAG,GAAG,EAAE,KAAK,CAAC,CAAC;IACrB,MAAM,GAAG,GAAG,CAAC,SAAS,GAAG,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;IAC1C,MAAM,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAC3B,IAAI,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IACxB,IAAI,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IACxB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC;QACtC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QACnB,MAAM,CAAC,GAAG,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAC/B,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACnC,EAAE,IAAI,EAAE,CAAC;QACT,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YAC5B,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC1B,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACxC,CAAC;IACL,CAAC;IACD,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;IACZ,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;AAChB,CAAC"}

package/dist/src/random/trig.d.ts

@@ -0,0 +1,16 @@
+/**
+ * The cosine and sine of a uniformly drawn angle, the same bits on every engine.
+ *
+ * The angle is given as a turn fraction u in [0, 1) (angle 2 pi u), so the argument reduction is
+ * exact: 8u splits into an octant k and a fraction f without rounding, and only f * pi / 4 rounds
+ * once. On [0, pi / 4] the polynomials are fdlibm's `__kernel_sin` and `__kernel_cos` (FreeBSD
+ * k_sin.c and k_cos.c, Sun Microsystems 1993) with a zero tail, evaluated with the four basic
+ * operations only. Error a few ulp; bit-identical everywhere.
+ */
+/**
+ * cos(2 pi u) and sin(2 pi u).
+ * @param u - the turn fraction, in [0, 1)
+ * @param out - receives [cos, sin]
+ */
+export declare function detCosSinTurn(u: number, out: Float64Array): void;
+//# sourceMappingURL=trig.d.ts.map

package/dist/src/random/trig.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"trig.d.ts","sourceRoot":"","sources":["../../../src/random/trig.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AA2CH;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CA0BhE"}

package/dist/src/random/trig.js

@@ -0,0 +1,78 @@
+/**
+ * The cosine and sine of a uniformly drawn angle, the same bits on every engine.
+ *
+ * The angle is given as a turn fraction u in [0, 1) (angle 2 pi u), so the argument reduction is
+ * exact: 8u splits into an octant k and a fraction f without rounding, and only f * pi / 4 rounds
+ * once. On [0, pi / 4] the polynomials are fdlibm's `__kernel_sin` and `__kernel_cos` (FreeBSD
+ * k_sin.c and k_cos.c, Sun Microsystems 1993) with a zero tail, evaluated with the four basic
+ * operations only. Error a few ulp; bit-identical everywhere.
+ */
+const PIO4 = 7.85398163397448278999e-1;
+const S1 = -1.66666666666666324348e-1;
+const S2 = 8.33333333332248946124e-3;
+const S3 = -1.98412698298579493134e-4;
+const S4 = 2.75573137070700676789e-6;
+const S5 = -2.50507602534068634195e-8;
+const S6 = 1.58969099521155010221e-10;
+const C1 = 4.16666666666666019037e-2;
+const C2 = -1.38888888888741095749e-3;
+const C3 = 2.48015872894767294178e-5;
+const C4 = -2.75573143513906633035e-7;
+const C5 = 2.08757232129817482790e-9;
+const C6 = -1.13596475577881948265e-11;
+/**
+ * sin(x) for |x| <= pi / 4.
+ * @param x - the argument
+ * @returns the sine
+ */
+function kernelSin(x) {
+    const z = x * x;
+    const r = S2 + z * (S3 + z * (S4 + z * (S5 + z * S6)));
+    return x + z * x * (S1 + z * r);
+}
+/**
+ * cos(x) for |x| <= pi / 4.
+ * @param x - the argument
+ * @returns the cosine
+ */
+function kernelCos(x) {
+    const z = x * x;
+    const w = z * z;
+    const r = z * (C1 + z * (C2 + z * C3)) + w * w * (C4 + z * (C5 + z * C6));
+    const hz = 0.5 * z;
+    const v = 1.0 - hz;
+    return v + (1.0 - v - hz + z * r);
+}
+/**
+ * cos(2 pi u) and sin(2 pi u).
+ * @param u - the turn fraction, in [0, 1)
+ * @param out - receives [cos, sin]
+ */
+export function detCosSinTurn(u, out) {
+    const t = u * 8;
+    const octant = Math.floor(t);
+    const x = (t - octant) * PIO4;
+    // the octant's angle is (octant >> 1) quarter turns plus x (even octant) or pi/2 - (pi/4 - x)
+    const odd = (octant & 1) === 1;
+    const z = odd ? PIO4 - x : x;
+    const c = odd ? kernelSin(z) : kernelCos(z);
+    const s = odd ? kernelCos(z) : kernelSin(z);
+    switch ((octant >> 1) & 3) {
+        case 0:
+            out[0] = c;
+            out[1] = s;
+            break;
+        case 1:
+            out[0] = -s;
+            out[1] = c;
+            break;
+        case 2:
+            out[0] = -c;
+            out[1] = -s;
+            break;
+        default:
+            out[0] = s;
+            out[1] = -c;
+    }
+}
+//# sourceMappingURL=trig.js.map