@woosh/meep-engine 2.118.3 → 2.118.5

package/src/core/math/compute_legendre_polynomial.d.ts

@@ -3,7 +3,7 @@
  * Useful in Spherical Harmonics coefficient computation
  * @param {number} l band
  * @param {number} m
- * @param {number} x
+ * @param {number} x must be between 0 and 1
  * @returns {number}
  */
 export function compute_legendre_polynomial(l: number, m: number, x: number): number;

package/src/core/math/compute_legendre_polynomial.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compute_legendre_polynomial.d.ts","sourceRoot":"","sources":["../../../../src/core/math/compute_legendre_polynomial.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,+CALW,MAAM,KACN,MAAM,KACN,MAAM,GACJ,MAAM,CAuClB"}
+{"version":3,"file":"compute_legendre_polynomial.d.ts","sourceRoot":"","sources":["../../../../src/core/math/compute_legendre_polynomial.js"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,+CALW,MAAM,KACN,MAAM,KACN,MAAM,GACJ,MAAM,CA0ClB"}

package/src/core/math/compute_legendre_polynomial.js

@@ -1,12 +1,17 @@
+import { assert } from "../assert.js";
+
 /**
  * Computes associated Legendre Polynomial P(l,m,x) at x
  * Useful in Spherical Harmonics coefficient computation
  * @param {number} l band
  * @param {number} m
- * @param {number} x
+ * @param {number} x must be between 0 and 1
  * @returns {number}
  */
 export function compute_legendre_polynomial(l, m, x) {
+    assert.lessThanOrEqual(x,1,'only valid for X <= 1');
+
+    // TODO we might be able to do better, see https://github.com/halueda/wavy-orbitals/blob/fe738b0f8de8783cb7886d2c6ee616c2befb363b/legendre.js#L16
     // based on code from https://github.com/jan-van-bergen/SphericalHarmonicLighting/blob/2b214b3451859ded07ea4e41fb2aa8d2a44ab579/SphericalHarmonicsLighting/SphericalHarmonics.cpp#L61
 
     // Apply rule 2; P m m

package/src/core/math/hash/squirrel3.d.ts

@@ -1,5 +1,6 @@
 /**
  * Based on Squirrel3 hash function by Squirrel Eiserloh
+ * Alex: Personally I found it to have low entropy, so I don't see it as very useful
  * @see GDC 2017 presentation on "Math for Game Programmers: Noise-Based RNG"
  * @param {number} value expected to be an integer, if not - it will be truncated to such
  * @returns {number} signed 32-bit integer

package/src/core/math/hash/squirrel3.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"squirrel3.d.ts","sourceRoot":"","sources":["../../../../../src/core/math/hash/squirrel3.js"],"names":[],"mappings":"AAIA;;;;;GAKG;AACH,iCAHW,MAAM,GACJ,MAAM,CAYlB"}
+{"version":3,"file":"squirrel3.d.ts","sourceRoot":"","sources":["../../../../../src/core/math/hash/squirrel3.js"],"names":[],"mappings":"AAIA;;;;;;GAMG;AACH,iCAHW,MAAM,GACJ,MAAM,CAYlB"}

package/src/core/math/hash/squirrel3.js

@@ -4,6 +4,7 @@ const BIT_NOISE3 = 0x1B56C4E9;
 
 /**
  * Based on Squirrel3 hash function by Squirrel Eiserloh
+ * Alex: Personally I found it to have low entropy, so I don't see it as very useful
  * @see GDC 2017 presentation on "Math for Game Programmers: Noise-Based RNG"
  * @param {number} value expected to be an integer, if not - it will be truncated to such
  * @returns {number} signed 32-bit integer

package/src/core/math/max3.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"max3.d.ts","sourceRoot":"","sources":["../../../../src/core/math/max3.js"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,wBALW,MAAM,KACN,MAAM,KACN,MAAM,GACJ,MAAM,CAYlB"}
+{"version":3,"file":"max3.d.ts","sourceRoot":"","sources":["../../../../src/core/math/max3.js"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,wBALW,MAAM,KACN,MAAM,KACN,MAAM,GACJ,MAAM,CAgBlB"}

package/src/core/math/max3.js

@@ -8,11 +8,15 @@
 export function max3(a, b, c) {
 
     let v = a;
+
     if (v < b) {
         v = b;
     }
+
     if (v < c) {
         v = c;
     }
+
     return v;
+
 }

package/src/core/math/random/seededRandom_MersenneTwister.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Random number generator based on Mersenne Twister sequence
+ * @param {number} seed
+ * @returns {function():number} RNG
+ */
+export function seededRandom_MersenneTwister(seed: number): () => number;
+//# sourceMappingURL=seededRandom_MersenneTwister.d.ts.map

package/src/core/math/random/seededRandom_MersenneTwister.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"seededRandom_MersenneTwister.d.ts","sourceRoot":"","sources":["../../../../../src/core/math/random/seededRandom_MersenneTwister.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,mDAHW,MAAM,SACO,MAAM,CAmF7B"}

package/src/core/math/random/{seededRandomMersenneTwister.js → seededRandom_MersenneTwister.js}

@@ -1,9 +1,11 @@
 /**
- * https://gist.github.com/banksean/300494
+ * Random number generator based on Mersenne Twister sequence
  * @param {number} seed
  * @returns {function():number} RNG
  */
-export function seededRandomMersenneTwister(seed) {
+export function seededRandom_MersenneTwister(seed) {
+    // see https://gist.github.com/banksean/300494
+
     /* Period parameters */
     const N = 624;
     const M = 397;

package/src/core/math/solveQuadratic.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"solveQuadratic.d.ts","sourceRoot":"","sources":["../../../../src/core/math/solveQuadratic.js"],"names":[],"mappings":"AAGA;;;;;;;;GAQG;AACH,uCAJW,MAAM,EAAE,iBACR,MAAM,KAJN,MAAM,KACN,MAAM,KACN,MAAM,GAGJ,MAAM,CAgDlB"}
+{"version":3,"file":"solveQuadratic.d.ts","sourceRoot":"","sources":["../../../../src/core/math/solveQuadratic.js"],"names":[],"mappings":"AAGA;;;;;;;;GAQG;AACH,uCAJW,MAAM,EAAE,iBACR,MAAM,KAJN,MAAM,KACN,MAAM,KACN,MAAM,GAGJ,MAAM,CAoDlB"}

package/src/core/math/solveQuadratic.js

@@ -10,7 +10,11 @@ import { EPSILON } from "./EPSILON.js";
  * @param {number} result_offset offset into result array where solutions are written to
  * @returns {number} number of found solutions (roots)
  */
-export function solveQuadratic(result, result_offset, a, b, c) {
+export function solveQuadratic(
+    result, result_offset,
+    a, b, c
+) {
+
     assert.isNumber(a, 'a');
     assert.isNumber(b, 'b');
     assert.isNumber(c, 'c');

package/src/core/primitives/boolean/compareBooleans.js

@@ -15,3 +15,5 @@ export function compareBooleans(a, b) {
         return -1;
     }
 }
+
+

package/src/core/primitives/boolean/computeBooleanHash.d.ts

@@ -0,0 +1,7 @@
+/**
+ *
+ * @param {boolean} v
+ * @returns {number}
+ */
+export function computeBooleanHash(v: boolean): number;
+//# sourceMappingURL=computeBooleanHash.d.ts.map

package/src/core/primitives/boolean/computeBooleanHash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"computeBooleanHash.d.ts","sourceRoot":"","sources":["../../../../../src/core/primitives/boolean/computeBooleanHash.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,sCAHW,OAAO,GACL,MAAM,CAIlB"}

package/src/core/primitives/boolean/computeBooleanHash.js

@@ -0,0 +1,8 @@
+/**
+ *
+ * @param {boolean} v
+ * @returns {number}
+ */
+export function computeBooleanHash(v) {
+    return v ? 1 : 0;
+}

package/src/core/primitives/numbers/computeHashFloat.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"computeHashFloat.d.ts","sourceRoot":"","sources":["../../../../../src/core/primitives/numbers/computeHashFloat.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,oCAHW,MAAM,GACJ,MAAM,CAalB"}
+{"version":3,"file":"computeHashFloat.d.ts","sourceRoot":"","sources":["../../../../../src/core/primitives/numbers/computeHashFloat.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,oCAHW,MAAM,GACJ,MAAM,CAalB"}

package/src/core/primitives/numbers/computeHashFloat.js

@@ -1,3 +1,5 @@
+import { UINT32_MAX } from "../../binary/UINT32_MAX.js";
+
 /**
  *
  * @param {number} v
@@ -5,12 +7,12 @@
  */
 export function computeHashFloat(v) {
     //we break the number up into fractional and whole parts
-    const whole = v | 0;
+    const whole = v >> 0;
 
     const fraction = v - whole;
 
     //fractional part is scaled up into int32 range, this inexact method, as it will produce 0 hash for values below a certain threshold
-    const fractionHash = fraction * 1367130550;
+    const fractionHash = fraction * UINT32_MAX;
 
     //take XOR of both parts
     return fractionHash ^ whole;

package/src/engine/ecs/gui/position/ViewportPosition.d.ts

@@ -6,11 +6,6 @@ export namespace ViewportPositionFlags {
 export default ViewportPosition;
 declare class ViewportPosition {
     static fromJSON(opt: any): ViewportPosition;
-    /**
-     *
-     * @constructor
-     */
-    constructor(options: any);
     /**
      * Clip-scale position, on-screen values are in range of 0 to 1
      * @type {Vector2}

package/src/engine/ecs/gui/position/ViewportPosition.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ViewportPosition.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/ecs/gui/position/ViewportPosition.js"],"names":[],"mappings":"oCAOU,MAAM;;;;;;AAOhB;IAkHI,4CAMC;IAvHD;;;OAGG;IACH,0BAkDC;IAjDG;;;OAGG;IACH,UAFU,OAAO,CAEY;IAE7B;;;OAGG;IACH,QAFU,OAAO,CAEU;IAC3B;;;OAGG;IACH,QAFU,OAAO,CAEc;IAG/B;;;;OAIG;IACH,sBAFU,OAAO,CAEgB;IAEjC;;;;OAIG;IACH,iBAFU,MAAM,CAES;IAGzB;;;OAGG;IACH,mBAFU,OAAO,CAEa;IAE9B;;;OAGG;IACH,SAFU,eAAe,CAEe;IAQ5C;;;;OAIG;IACH,cAHW,gBAAgB,GACd,OAAO,CAWnB;IAED,eAUC;IAED;;;;;;;aAgBC;IAED;;;;;;;MASC;CASJ;;;;;oBAtImB,kCAAkC;4BAC1B,2CAA2C"}
+{"version":3,"file":"ViewportPosition.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/ecs/gui/position/ViewportPosition.js"],"names":[],"mappings":"oCAOU,MAAM;;;;;;AAOhB;IAuGI,4CAMC;IA5GD;;;OAGG;IACH,UAFU,OAAO,CAEQ;IAEzB;;;OAGG;IACH,QAFU,OAAO,CAEM;IACvB;;;OAGG;IACH,QAFU,OAAO,CAEU;IAG3B;;;;OAIG;IACH,sBAFU,OAAO,CAEY;IAE7B;;;;OAIG;IACH,iBAFU,MAAM,CAEK;IAGrB;;;OAGG;IACH,mBAFU,OAAO,CAES;IAE1B;;;OAGG;IACH,SAFU,eAAe,CAEW;IAEpC;;;;OAIG;IACH,cAHW,gBAAgB,GACd,OAAO,CAWnB;IAED,eAUC;IAED;;;;;;;aAgBC;IAED;;;;;;;MASC;CASJ;;;;;oBA3HmB,kCAAkC;4BAC1B,2CAA2C"}

package/src/engine/ecs/gui/position/ViewportPosition.js

@@ -14,60 +14,49 @@ export const ViewportPositionFlags = {
 
 class ViewportPosition {
     /**
-     *
-     * @constructor
+     * Clip-scale position, on-screen values are in range of 0 to 1
+     * @type {Vector2}
      */
-    constructor(options) {
-        /**
-         * Clip-scale position, on-screen values are in range of 0 to 1
-         * @type {Vector2}
-         */
-        this.position = new Vector2();
-
-        /**
-         * Fixed offset in pixels
-         * @type {Vector2}
-         */
-        this.offset = new Vector2();
-        /**
-         * ranges from 0..1 in both X and Y, controls anchor point of element positioning
-         * @type {Vector2}
-         */
-        this.anchor = new Vector2(0, 0);
-
-
-        /**
-         * Makes display element avoid overlap with GUI elements
-         * @see GUIElement
-         * @type {boolean}
-         */
-        this.resolveGuiCollisions = false;
-
-        /**
-         * How far should the HUD stay away from the edge if it's sticky
-         * @see stickToScreenEdge
-         * @type {number}
-         */
-        this.screenEdgeWidth = 10;
-
-
-        /**
-         * Controls whenever or not HUD should remain on the screen when it gets to the edge
-         * @type {boolean}
-         */
-        this.stickToScreenEdge = false;
-
-        /**
-         * Can be used to enable and disable positioning
-         * @type {ObservedBoolean}
-         */
-        this.enabled = new ObservedBoolean(true);
-
-        if (options !== undefined) {
-            console.warn("ViewportPosition constructor options is deprecated, please use static fromJSON method instead if you need similar functionality");
-            this.fromJSON(options);
-        }
-    }
+    position = new Vector2();
+
+    /**
+     * Fixed offset in pixels
+     * @type {Vector2}
+     */
+    offset = new Vector2();
+    /**
+     * ranges from 0..1 in both X and Y, controls anchor point of element positioning
+     * @type {Vector2}
+     */
+    anchor = new Vector2(0, 0);
+
+
+    /**
+     * Makes display element avoid overlap with GUI elements
+     * @see GUIElement
+     * @type {boolean}
+     */
+    resolveGuiCollisions = false;
+
+    /**
+     * How far should the HUD stay away from the edge if it's sticky
+     * @see stickToScreenEdge
+     * @type {number}
+     */
+    screenEdgeWidth = 10;
+
+
+    /**
+     * Controls whenever or not HUD should remain on the screen when it gets to the edge
+     * @type {boolean}
+     */
+    stickToScreenEdge = false;
+
+    /**
+     * Can be used to enable and disable positioning
+     * @type {ObservedBoolean}
+     */
+    enabled = new ObservedBoolean(true);
 
     /**
      *

package/src/engine/ecs/speaker/VoiceSystem.d.ts

@@ -9,7 +9,7 @@ export class VoiceSystem extends AbstractContextSystem<any> {
         font_size: number;
     });
     dependencies: (typeof Voice)[];
-    components_used: (ResourceAccessSpecification<typeof ViewportPosition> | ResourceAccessSpecification<typeof BehaviorComponent>)[];
+    components_used: ResourceAccessSpecification<typeof BehaviorComponent>[];
     /**
      *
      * @type {Localization}
@@ -100,7 +100,6 @@ export class VoiceSystem extends AbstractContextSystem<any> {
 }
 import { AbstractContextSystem } from "../system/AbstractContextSystem.js";
 import { Voice } from "./Voice.js";
-import ViewportPosition from "../gui/position/ViewportPosition.js";
-import { ResourceAccessSpecification } from "../../../core/model/ResourceAccessSpecification.js";
 import { BehaviorComponent } from "../../intelligence/behavior/ecs/BehaviorComponent.js";
+import { ResourceAccessSpecification } from "../../../core/model/ResourceAccessSpecification.js";
 //# sourceMappingURL=VoiceSystem.d.ts.map

package/src/engine/ecs/speaker/VoiceSystem.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"VoiceSystem.d.ts","sourceRoot":"","sources":["../../../../../src/engine/ecs/speaker/VoiceSystem.js"],"names":[],"mappings":"AA2JA;IACI;;;;OAIG;IACH;;;OA2FC;IArFG,+BAA2B;IAE3B,kIAQC;IAGD;;;OAGG;IACH,0BAAuB;IAEvB;;;OAGG;IACH,eAAe;IAEf;;;OAGG;IACH,4BAAiB;IAEjB;;;OAGG;IACH,8BAAgB;IAEhB;;;OAGG;IACH,eAAoB;IAEpB;;;;OAIG;IACH,iCAAyC;IAEzC;;;;OAIG;IACH,kBAAkC;IAIlC;;;;OAIG;IACH,eAAkB;IAElB;;;;OAIG;IACH,oBAAgC;IAEhC;;;OAGG;IACH,oBAAqC;IAErC;;;;OAIG;IACH,gBAAoB;IAGxB;;;OAGG;IACH,kBAFY,MAAM,CAIjB;IAED,0EAuBC;IAED;;;;;OAKG;IACH,uBAJW,MAAM,UACN,MAAM,SACN,KAAK,QAsBf;IAED;;;;;OAKG;IACH,wBAoBC;IAED;;;;;OAKG;IACH,gBAJW,MAAM,WACN,MAAM,SACN,KAAK,QAuHf;CACJ;sCAxbqC,oCAAoC;sBAIpD,YAAY;6BALL,qCAAqC;4CArBtB,oDAAoD;kCAQ9D,sDAAsD"}
+{"version":3,"file":"VoiceSystem.d.ts","sourceRoot":"","sources":["../../../../../src/engine/ecs/speaker/VoiceSystem.js"],"names":[],"mappings":"AA2JA;IACI;;;;OAIG;IACH;;;OA2FC;IArFG,+BAA2B;IAE3B,yEAQC;IAGD;;;OAGG;IACH,0BAAuB;IAEvB;;;OAGG;IACH,eAAe;IAEf;;;OAGG;IACH,4BAAiB;IAEjB;;;OAGG;IACH,8BAAgB;IAEhB;;;OAGG;IACH,eAAoB;IAEpB;;;;OAIG;IACH,iCAAyC;IAEzC;;;;OAIG;IACH,kBAAkC;IAIlC;;;;OAIG;IACH,eAAkB;IAElB;;;;OAIG;IACH,oBAAgC;IAEhC;;;OAGG;IACH,oBAAqC;IAErC;;;;OAIG;IACH,gBAAoB;IAGxB;;;OAGG;IACH,kBAFY,MAAM,CAIjB;IAED,0EAuBC;IAED;;;;;OAKG;IACH,uBAJW,MAAM,UACN,MAAM,SACN,KAAK,QAsBf;IAED;;;;;OAKG;IACH,wBAoBC;IAED;;;;;OAKG;IACH,gBAJW,MAAM,WACN,MAAM,SACN,KAAK,QAuHf;CACJ;sCAxbqC,oCAAoC;sBAIpD,YAAY;kCAlBA,sDAAsD;4CAR5C,oDAAoD"}

package/src/engine/graphics/sh3/lpv/find_max_depth_radius_for_point.js

@@ -1,7 +1,7 @@
-import { v3_distance_sqr } from "../../../../core/geom/vec3/v3_distance_sqr.js";
 import {
     tetrahedral_mesh_find_tets_attached_to_vertex
-} from "../../../../core/geometry/3d/tetrahedra/tetrahedral_mesh_find_tets_attached_to_vertex.js";
+} from "../../../../core/geom/3d/tetrahedra/tetrahedral_mesh_find_tets_attached_to_vertex.js";
+import { v3_distance_sqr } from "../../../../core/geom/vec3/v3_distance_sqr.js";
 import { max2 } from "../../../../core/math/max2.js";
 
 /**

package/src/engine/intelligence/optimization/optimize_cyclic_sequence_pairwise.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Was originally written for TAA jitter sequence optimization in order to reduce maximum impulse
+ * @template T
+ * @param {T[]} sequence
+ * @param {number} dimensions
+ * @param {number} offset
+ * @param {number} count
+ * @param {function(address0:number, address1:number, sequence:T[]):number} cost_function
+ * @param {*} [cost_function_ctx]
+ */
+export function optimize_cyclic_sequence_pairwise<T>(sequence: T[], dimensions: number, offset: number, count: number, cost_function: any, cost_function_ctx?: any): void;
+//# sourceMappingURL=optimize_cyclic_sequence_pairwise.d.ts.map

package/src/engine/intelligence/optimization/optimize_cyclic_sequence_pairwise.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"optimize_cyclic_sequence_pairwise.d.ts","sourceRoot":"","sources":["../../../../../src/engine/intelligence/optimization/optimize_cyclic_sequence_pairwise.js"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AACH,gFANW,MAAM,UACN,MAAM,SACN,MAAM,qDAiFhB"}

package/src/engine/intelligence/optimization/optimize_cyclic_sequence_pairwise.js

@@ -0,0 +1,90 @@
+import { assert } from "../../../core/assert.js";
+
+/**
+ * Was originally written for TAA jitter sequence optimization in order to reduce maximum impulse
+ * @template T
+ * @param {T[]} sequence
+ * @param {number} dimensions
+ * @param {number} offset
+ * @param {number} count
+ * @param {function(address0:number, address1:number, sequence:T[]):number} cost_function
+ * @param {*} [cost_function_ctx]
+ */
+export function optimize_cyclic_sequence_pairwise(
+    sequence,
+    dimensions,
+    offset,
+    count,
+    cost_function,
+    cost_function_ctx
+) {
+
+    assert.isNonNegativeInteger(dimensions, 'dimensions');
+    assert.isNonNegativeInteger(offset, 'offset');
+    assert.isNonNegativeInteger(count, 'count');
+
+    assert.isFunction(cost_function, 'cost_function');
+
+    let swaps = 0;
+
+    let distance_max = (count - 1) >>> 1;
+
+    function index_to_address(index) {
+        const wrapped_index = (index + count) % count;
+        return offset + wrapped_index * dimensions;
+    }
+
+    function move(from, to){
+        const i0 = index_to_address(from);
+        const i1 = index_to_address(to);
+
+        const clip = sequence.splice(i0, dimensions);
+        sequence.splice(i1, 0, ...clip);
+
+    }
+
+    function pair_cost(i0, i1){
+        return cost_function.call(cost_function_ctx, index_to_address(i0), index_to_address(i1), sequence)
+    }
+
+    main: do {
+        swaps = 0;
+
+        for (let from = 0; from < count; from++) {
+
+            for (let distance = -distance_max; distance <= distance_max; distance++) {
+                if (distance === 0) {
+                    continue;
+                }
+
+                // estimate swap benefit
+                const to = from+distance;
+
+                const removal_gain = pair_cost(from-1, from+1) - (
+                    pair_cost(from-1, from) + pair_cost(from, from+1)
+                );
+
+                move(from, to);
+
+                const insertion_gain = ( pair_cost(to-1, to) + pair_cost(to, to+1))
+                    - pair_cost(to -1, to+1);
+
+                const move_cost =insertion_gain + removal_gain;
+
+                if (move_cost >= 0) {
+                    // bad swap, undo
+
+                    move(to, from);
+
+                    continue;
+                }
+
+                swaps++;
+
+                continue main;
+            }
+        }
+
+    } while (swaps > 0);
+
+}

package/src/core/geometry/3d/tetrahedra/tetrahedral_mesh_find_tets_attached_to_vertex.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"tetrahedral_mesh_find_tets_attached_to_vertex.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geometry/3d/tetrahedra/tetrahedral_mesh_find_tets_attached_to_vertex.js"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,sEANW,MAAM,EAAE,iBACR,MAAM,uCAEN,MAAM,GACJ,MAAM,CAyBlB"}

package/src/core/math/random/MersenneTwister.d.ts

@@ -1,19 +0,0 @@
-export class MersenneTwister {
-    constructor(seed?: number);
-    N: number;
-    M: number;
-    MATRIX_A: number;
-    UPPER_MASK: number;
-    LOWER_MASK: number;
-    mt: any[];
-    mti: number;
-    init_genrand(s: any): void;
-    init_by_array(init_key: any, key_length: any): void;
-    genrand_int32(): number;
-    genrand_int31(): number;
-    genrand_real1(): number;
-    random(): number;
-    genrand_real3(): number;
-    genrand_res53(): number;
-}
-//# sourceMappingURL=MersenneTwister.d.ts.map

package/src/core/math/random/MersenneTwister.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"MersenneTwister.d.ts","sourceRoot":"","sources":["../../../../../src/core/math/random/MersenneTwister.js"],"names":[],"mappings":"AA8DA;IACI,2BAkBC;IAfG,UAAY;IACZ,UAAY;IACZ,iBAA0B;IAE1B,mBAA4B;IAE5B,mBAA4B;IAG5B,UAA2B;IAE3B,YAAqB;IAOzB,2BAaC;IAOD,oDAqCC;IAGD,wBAmCC;IAGD,wBAEC;IAGD,wBAGC;IAGD,iBAGC;IAGD,wBAGC;IAGD,wBAGC;CACJ"}