@woosh/meep-engine 2.118.4 → 2.118.5

package/package.json

@@ -5,7 +5,7 @@
   "description": "Fully featured ECS game engine written in JavaScript",
   "type": "module",
   "author": "Alexander Goldring",
-  "version": "2.118.4",
+  "version": "2.118.5",
   "main": "build/meep.module.js",
   "module": "build/meep.module.js",
   "exports": {

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/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/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/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"}

package/src/core/math/random/MersenneTwister.js

@@ -1,212 +0,0 @@
-/*
-  I've wrapped Makoto Matsumoto and Takuji Nishimura's code in a namespace
-  so it's better encapsulated. Now you can have multiple random number generators
-  and they won't stomp all over eachother's state.
-
-  If you want to use this as a substitute for Math.random(), use the random()
-  method like so:
-
-  var m = new MersenneTwister();
-  var randomNumber = m.random();
-
-  You can also call the other genrand_{foo}() methods on the instance.
-  If you want to use a specific seed in order to get a repeatable random
-  sequence, pass an integer into the constructor:
-  var m = new MersenneTwister(123);
-  and that will always produce the same random sequence.
-  Sean McCullough (banksean@gmail.com)
-*/
-
-/*
-   A C-program for MT19937, with initialization improved 2002/1/26.
-   Coded by Takuji Nishimura and Makoto Matsumoto.
-
-   Before using, initialize the state by using init_genrand(seed)
-   or init_by_array(init_key, key_length).
-
-   Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
-   All rights reserved.
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions
-   are met:
-
-     1. Redistributions of source code must retain the above copyright
-        notice, this list of conditions and the following disclaimer.
-
-     2. Redistributions in binary form must reproduce the above copyright
-        notice, this list of conditions and the following disclaimer in the
-        documentation and/or other materials provided with the distribution.
-
-     3. The names of its contributors may not be used to endorse or promote
-        products derived from this software without specific prior written
-        permission.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
-   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
-   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-
-   Any feedback is very welcome.
-   http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
-   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
-*/
-
-export class MersenneTwister {
-    constructor(seed = new Date().getTime()) {
-
-        /* Period parameters */
-        this.N = 624;
-        this.M = 397;
-        this.MATRIX_A = 0x9908b0df;
-        /* constant vector a */
-        this.UPPER_MASK = 0x80000000;
-        /* most significant w-r bits */
-        this.LOWER_MASK = 0x7fffffff;
-        /* least significant r bits */
-
-        this.mt = new Array(this.N);
-        /* the array for the state vector */
-        this.mti = this.N + 1;
-        /* mti==N+1 means mt[N] is not initialized */
-
-        this.init_genrand(seed);
-    }
-
-    /* initializes mt[N] with a seed */
-    init_genrand(s) {
-        this.mt[0] = s >>> 0;
-        for (this.mti = 1; this.mti < this.N; this.mti++) {
-            const s = this.mt[this.mti - 1] ^ (this.mt[this.mti - 1] >>> 30);
-            this.mt[this.mti] = (((((s & 0xffff0000) >>> 16) * 1812433253) << 16) + (s & 0x0000ffff) * 1812433253)
-                + this.mti;
-            /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
-            /* In the previous versions, MSBs of the seed affect   */
-            /* only MSBs of the array mt[].                        */
-            /* 2002/01/09 modified by Makoto Matsumoto             */
-            this.mt[this.mti] >>>= 0;
-            /* for >32 bit machines */
-        }
-    }
-
-    /* initialize by an array with array-length */
-    /* init_key is the array for initializing keys */
-    /* key_length is its length */
-
-    /* slight change for C++, 2004/2/26 */
-    init_by_array(init_key, key_length) {
-        let i, j, k;
-        this.init_genrand(19650218);
-        i = 1;
-        j = 0;
-        k = (this.N > key_length ? this.N : key_length);
-        for (; k; k--) {
-            const s = this.mt[i - 1] ^ (this.mt[i - 1] >>> 30)
-            this.mt[i] = (this.mt[i] ^ (((((s & 0xffff0000) >>> 16) * 1664525) << 16) + ((s & 0x0000ffff) * 1664525)))
-                + init_key[j] + j;
-            /* non linear */
-            this.mt[i] >>>= 0;
-            /* for WORDSIZE > 32 machines */
-            i++;
-            j++;
-            if (i >= this.N) {
-                this.mt[0] = this.mt[this.N - 1];
-                i = 1;
-            }
-            if (j >= key_length) j = 0;
-        }
-        for (k = this.N - 1; k; k--) {
-            const s = this.mt[i - 1] ^ (this.mt[i - 1] >>> 30);
-            this.mt[i] = (this.mt[i] ^ (((((s & 0xffff0000) >>> 16) * 1566083941) << 16) + (s & 0x0000ffff) * 1566083941))
-                - i;
-            /* non linear */
-            this.mt[i] >>>= 0;
-            /* for WORDSIZE > 32 machines */
-            i++;
-            if (i >= this.N) {
-                this.mt[0] = this.mt[this.N - 1];
-                i = 1;
-            }
-        }
-
-        this.mt[0] = 0x80000000;
-        /* MSB is 1; assuring non-zero initial array */
-    }
-
-    /* generates a random number on [0,0xffffffff]-interval */
-    genrand_int32() {
-        let y;
-        const mag01 = new Array(0x0, this.MATRIX_A);
-        /* mag01[x] = x * MATRIX_A  for x=0,1 */
-
-        if (this.mti >= this.N) { /* generate N words at one time */
-            let kk;
-
-            if (this.mti === this.N + 1)   /* if init_genrand() has not been called, */
-                this.init_genrand(5489);
-            /* a default initial seed is used */
-
-            for (kk = 0; kk < this.N - this.M; kk++) {
-                y = (this.mt[kk] & this.UPPER_MASK) | (this.mt[kk + 1] & this.LOWER_MASK);
-                this.mt[kk] = this.mt[kk + this.M] ^ (y >>> 1) ^ mag01[y & 0x1];
-            }
-            for (; kk < this.N - 1; kk++) {
-                y = (this.mt[kk] & this.UPPER_MASK) | (this.mt[kk + 1] & this.LOWER_MASK);
-                this.mt[kk] = this.mt[kk + (this.M - this.N)] ^ (y >>> 1) ^ mag01[y & 0x1];
-            }
-            y = (this.mt[this.N - 1] & this.UPPER_MASK) | (this.mt[0] & this.LOWER_MASK);
-            this.mt[this.N - 1] = this.mt[this.M - 1] ^ (y >>> 1) ^ mag01[y & 0x1];
-
-            this.mti = 0;
-        }
-
-        y = this.mt[this.mti++];
-
-        /* Tempering */
-        y ^= (y >>> 11);
-        y ^= (y << 7) & 0x9d2c5680;
-        y ^= (y << 15) & 0xefc60000;
-        y ^= (y >>> 18);
-
-        return y >>> 0;
-    }
-
-    /* generates a random number on [0,0x7fffffff]-interval */
-    genrand_int31() {
-        return (this.genrand_int32() >>> 1);
-    }
-
-    /* generates a random number on [0,1]-real-interval */
-    genrand_real1() {
-        return this.genrand_int32() * (1.0 / 4294967295.0);
-        /* divided by 2^32-1 */
-    }
-
-    /* generates a random number on [0,1)-real-interval */
-    random() {
-        return this.genrand_int32() * (1.0 / 4294967296.0);
-        /* divided by 2^32 */
-    }
-
-    /* generates a random number on (0,1)-real-interval */
-    genrand_real3() {
-        return (this.genrand_int32() + 0.5) * (1.0 / 4294967296.0);
-        /* divided by 2^32 */
-    }
-
-    /* generates a random number on [0,1) with 53-bit resolution*/
-    genrand_res53() {
-        const a = this.genrand_int32() >>> 5, b = this.genrand_int32() >>> 6;
-        return (a * 67108864.0 + b) * (1.0 / 9007199254740992.0);
-    }
-}
-
-/* These real versions are due to Isaku Wada, 2002/01/09 added */

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

@@ -1,7 +0,0 @@
-/**
- * https://gist.github.com/banksean/300494
- * @param {number} seed
- * @returns {function():number} RNG
- */
-export function seededRandomMersenneTwister(seed: number): () => number;
-//# sourceMappingURL=seededRandomMersenneTwister.d.ts.map

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

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