@woosh/meep-engine 2.109.0 → 2.109.1

package/build/meep.module.js

@@ -59953,7 +59953,7 @@ const DEFAULT_INITIAL_CAPACITY_POWER = 4;
  * @readonly
  * @type {number}
  */
-const DEFAULT_INITIAL_CAPACITY = 2 ** DEFAULT_INITIAL_CAPACITY_POWER;
+const DEFAULT_INITIAL_CAPACITY$1 = 2 ** DEFAULT_INITIAL_CAPACITY_POWER;
 
 /**
  * @readonly
@@ -60082,7 +60082,7 @@ class HashMap {
     constructor({
                     keyHashFunction = invokeObjectHash,
                     keyEqualityFunction = invokeObjectEquals,
-                    capacity = DEFAULT_INITIAL_CAPACITY,
+                    capacity = DEFAULT_INITIAL_CAPACITY$1,
                     loadFactor = DEFAULT_LOAD_FACTOR
                 } = {}) {
 
@@ -70775,16 +70775,25 @@ const EntityFlags = {
     WatchDestruction: 4
 };
 
+/**
+ * Align to the nearest number divisible by 32, rounding up
+ * @param {number} n
+ * @returns {number}
+ */
+function align_32(n) {
+    return ((n + 31) >>> 5) << 5
+}
+
 /**
  * de Bruijn sequence
  * @see https://graphics.stanford.edu/~seander/bithacks.html
  * @type {Uint8Array}
  */
-const msb_lut = new Uint8Array([
+const msb_lut_de_bruijn = new Uint8Array([
     0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8,
     31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9
-]);
-
+]);
+
 /**
  * Get index of the least significant set bit
  * Also known as ctz32 or "count trailing zeroes"
@@ -70793,9 +70802,9 @@ const msb_lut = new Uint8Array([
  * @returns {number}
  */
 function lsb_32(v) {
-    return msb_lut[((v & -v) * 0x077CB531) >>> 27];
-}
-
+    return msb_lut_de_bruijn[((v & -v) * 0x077CB531) >>> 27];
+}
+
 /**
  * Used for overallocating space when bit set needs to grow
  * @constant
@@ -70816,12 +70825,20 @@ const SHRINK_FACTOR$1 = 0.5;
  */
 const RESIZE_COUNT_THRESHOLD = 128;
 
+/**
+ * @readonly
+ * @type {number}
+ */
+const DEFAULT_INITIAL_CAPACITY = 64;
+
 class BitSet {
     /**
      * Dynamically sized bit field
      * @constructor
+     * @param {number} [initial_capacity]
      */
-    constructor() {
+    constructor(initial_capacity = DEFAULT_INITIAL_CAPACITY) {
+
         /**
          * Number of bits currently in use
          * @private
@@ -70834,7 +70851,7 @@ class BitSet {
          * @private
          * @type {number}
          */
-        this.__capacity = 64;
+        this.__capacity = align_32(initial_capacity);
 
         /**
          * Uint32-backed storage
@@ -71360,9 +71377,7 @@ class BitSet {
      * @returns {BitSet}
      */
     static fixedSize(x) {
-        const r = new BitSet();
-
-        r.setCapacity(x);
+        const r = new BitSet(x);
 
         //prevent resizing
         r.__shrinkFactor = 0;

package/package.json

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

package/src/core/binary/BitSet.d.ts

@@ -5,6 +5,12 @@ export class BitSet {
      * @returns {BitSet}
      */
     static fixedSize(x: number): BitSet;
+    /**
+     * Dynamically sized bit field
+     * @constructor
+     * @param {number} [initial_capacity]
+     */
+    constructor(initial_capacity?: number);
     /**
      * Number of bits currently in use
      * @private

package/src/core/binary/BitSet.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BitSet.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/BitSet.js"],"names":[],"mappings":"AA6DA;IAsiBI;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAWlB;IA9iBG;;;;OAIG;IACH,iBAAiB;IAEjB;;;;OAIG;IACH,mBAAoB;IAEpB;;;;OAIG;IACH,sBAA0D;IAE1D;;OAEG;IACH,gBAFU,MAAM,CAEmB;IAGvC,sBAEC;IAED;;;OAGG;IACH,mBAFW,MAAM,QAOhB;IAED;;;OAGG;IACH,uBAFW,MAAM,QAUhB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAED;;;;OAIG;IACH,iBAsBC;IAED,uBAMC;IAED;;;;OAIG;IACH,oBAyBC;IAED;;;;OAIG;IACH,oCAqCC;IAED;;;;OAIG;IACH,4BAFa,MAAM,CAuDlB;IAED;;;;OAIG;IACH,8BAFa,MAAM,CAkDlB;IAED;;;;OAIG;IACH,0BAFW,OAAO,QAmCjB;IAED;;;OAGG;IACH,2BAEC;IAED;;;;OAIG;IACH,qBAHW,MAAM,YACN,MAAM,QAWhB;IAED;;;;OAIG;IACH,uBAHW,MAAM,YACN,MAAM,QAShB;IAED;;;OAGG;IACH,SAFW,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAFa,OAAO,CAkBnB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACJ,OAAO,CAUnB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,OAAO,CAUnB;IAED;;;;;OAKG;IACH,sBAJW,MAAM,eACN,MAAM,aACN,MAAM,QAShB;IAED;;;;;OAKG;IACH,qBAJW,MAAM,eACN,MAAM,aACN,MAAM,QAShB;IAED;;;;;OAKG;IACH,gBAJW,MAAM,eACN,MAAM,aACN,MAAM,QAQhB;IAED;;OAEG;IACH,cAgBC;IAED;;;OAGG;IACH,YAFW,MAAM,QAoChB;CAiBJ"}
+{"version":3,"file":"BitSet.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/BitSet.js"],"names":[],"mappings":"AAgCA;IAyiBI;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CASlB;IApjBD;;;;OAIG;IACH,+BAFW,MAAM,EA8BhB;IAzBG;;;;OAIG;IACH,iBAAiB;IAEjB;;;;OAIG;IACH,mBAA4C;IAE5C;;;;OAIG;IACH,sBAA0D;IAE1D;;OAEG;IACH,gBAFU,MAAM,CAEmB;IAGvC,sBAEC;IAED;;;OAGG;IACH,mBAFW,MAAM,QAOhB;IAED;;;OAGG;IACH,uBAFW,MAAM,QAUhB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAED;;;;OAIG;IACH,iBAsBC;IAED,uBAMC;IAED;;;;OAIG;IACH,oBAyBC;IAED;;;;OAIG;IACH,oCAqCC;IAED;;;;OAIG;IACH,4BAFa,MAAM,CAuDlB;IAED;;;;OAIG;IACH,8BAFa,MAAM,CAkDlB;IAED;;;;OAIG;IACH,0BAFW,OAAO,QAmCjB;IAED;;;OAGG;IACH,2BAEC;IAED;;;;OAIG;IACH,qBAHW,MAAM,YACN,MAAM,QAWhB;IAED;;;;OAIG;IACH,uBAHW,MAAM,YACN,MAAM,QAShB;IAED;;;OAGG;IACH,SAFW,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAFa,OAAO,CAkBnB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACJ,OAAO,CAUnB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,OAAO,CAUnB;IAED;;;;;OAKG;IACH,sBAJW,MAAM,eACN,MAAM,aACN,MAAM,QAShB;IAED;;;;;OAKG;IACH,qBAJW,MAAM,eACN,MAAM,aACN,MAAM,QAShB;IAED;;;;;OAKG;IACH,gBAJW,MAAM,eACN,MAAM,aACN,MAAM,QAQhB;IAED;;OAEG;IACH,cAgBC;IAED;;;OAGG;IACH,YAFW,MAAM,QAoChB;CAeJ"}

package/src/core/binary/BitSet.js

@@ -1,43 +1,8 @@
 import { assert } from "../assert.js";
 import { max3 } from "../math/max3.js";
 import { min2 } from "../math/min2.js";
-
-/**
- * de Bruijn sequence
- * @see https://graphics.stanford.edu/~seander/bithacks.html
- * @type {Uint8Array}
- */
-const msb_lut = new Uint8Array([
-    0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8,
-    31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9
-]);
-
-/**
- * get most significant set bit
- * @see https://graphics.stanford.edu/~seander/bithacks.html
- * @param {number} v 32 bit integer
- * @returns {number} integer position of most significant bit
- */
-function msb_32(v) {
-    v |= v >>> 1;
-    v |= v >>> 2;
-    v |= v >>> 4;
-    v |= v >>> 8;
-    v |= v >>> 16;
-    v = (v >>> 1) + 1;
-    return msb_lut[(v * 0x077CB531) >>> 27];
-}
-
-/**
- * Get index of the least significant set bit
- * Also known as ctz32 or "count trailing zeroes"
- * @see https://graphics.stanford.edu/~seander/bithacks.html
- * @param {number} v
- * @returns {number}
- */
-function lsb_32(v) {
-    return msb_lut[((v & -v) * 0x077CB531) >>> 27];
-}
+import { align_32 } from "./align_32.js";
+import { lsb_32 } from "./lsb_32.js";
 
 /**
  * Used for overallocating space when bit set needs to grow
@@ -59,12 +24,21 @@ const SHRINK_FACTOR = 0.5;
  */
 const RESIZE_COUNT_THRESHOLD = 128;
 
+/**
+ * @readonly
+ * @type {number}
+ */
+const DEFAULT_INITIAL_CAPACITY = 64;
+
 export class BitSet {
     /**
      * Dynamically sized bit field
      * @constructor
+     * @param {number} [initial_capacity]
      */
-    constructor() {
+    constructor(initial_capacity = DEFAULT_INITIAL_CAPACITY) {
+        assert.isNonNegativeInteger(initial_capacity, 'initial_capacity');
+
         /**
          * Number of bits currently in use
          * @private
@@ -77,7 +51,7 @@ export class BitSet {
          * @private
          * @type {number}
          */
-        this.__capacity = 64;
+        this.__capacity = align_32(initial_capacity);
 
         /**
          * Uint32-backed storage
@@ -615,9 +589,7 @@ export class BitSet {
      * @returns {BitSet}
      */
     static fixedSize(x) {
-        const r = new BitSet();
-
-        r.setCapacity(x);
+        const r = new BitSet(x);
 
         //prevent resizing
         r.__shrinkFactor = 0;

package/src/core/binary/align_32.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Align to the nearest number divisible by 32, rounding up
+ * @param {number} n
+ * @returns {number}
+ */
+export function align_32(n: number): number;
+//# sourceMappingURL=align_32.d.ts.map

package/src/core/binary/align_32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"align_32.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/align_32.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,4BAHW,MAAM,GACJ,MAAM,CAIlB"}

package/src/core/binary/align_32.js

@@ -0,0 +1,8 @@
+/**
+ * Align to the nearest number divisible by 32, rounding up
+ * @param {number} n
+ * @returns {number}
+ */
+export function align_32(n) {
+    return ((n + 31) >>> 5) << 5
+}

package/src/core/binary/align_32.spec.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=align_32.spec.d.ts.map

package/src/core/binary/align_32.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"align_32.spec.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/align_32.spec.js"],"names":[],"mappings":""}

package/src/core/binary/align_32.spec.js

@@ -0,0 +1,11 @@
+import { align_32 } from "./align_32.js";
+
+test("basics", () => {
+    expect(align_32(0)).toBe(0);
+    expect(align_32(1)).toBe(32);
+    expect(align_32(31)).toBe(32);
+    expect(align_32(32)).toBe(32);
+    expect(align_32(33)).toBe(64);
+    expect(align_32(63)).toBe(64);
+    expect(align_32(64)).toBe(64);
+});

package/src/core/binary/align_4.js

@@ -11,4 +11,5 @@ export function align_4(n) {
     assert.greaterThanOrEqual(result, n, 'aligned result must be >= input');
 
     return result;
-}
+}
+

package/src/core/binary/lsb_32.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Get index of the least significant set bit
+ * Also known as ctz32 or "count trailing zeroes"
+ * @see https://graphics.stanford.edu/~seander/bithacks.html
+ * @param {number} v
+ * @returns {number}
+ */
+export function lsb_32(v: number): number;
+//# sourceMappingURL=lsb_32.d.ts.map

package/src/core/binary/lsb_32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lsb_32.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/lsb_32.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,0BAHW,MAAM,GACJ,MAAM,CAIlB"}

package/src/core/binary/lsb_32.js

@@ -0,0 +1,12 @@
+import { msb_lut_de_bruijn } from "./msb_lut_de_bruijn.js";
+
+/**
+ * Get index of the least significant set bit
+ * Also known as ctz32 or "count trailing zeroes"
+ * @see https://graphics.stanford.edu/~seander/bithacks.html
+ * @param {number} v
+ * @returns {number}
+ */
+export function lsb_32(v) {
+    return msb_lut_de_bruijn[((v & -v) * 0x077CB531) >>> 27];
+}

package/src/core/binary/msb_32.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=msb_32.d.ts.map

package/src/core/binary/msb_32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"msb_32.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/msb_32.js"],"names":[],"mappings":""}

package/src/core/binary/msb_32.js

@@ -0,0 +1,20 @@
+import { msb_lut_de_bruijn } from "./msb_lut_de_bruijn.js";
+
+/**
+ * get most significant set bit
+ * @see https://graphics.stanford.edu/~seander/bithacks.html
+ * @param {number} x 32 bit integer
+ * @returns {number} integer position of most significant bit
+ */
+function msb_32(x) {
+    let v = x;
+
+    v |= v >>> 1;
+    v |= v >>> 2;
+    v |= v >>> 4;
+    v |= v >>> 8;
+    v |= v >>> 16;
+    v = (v >>> 1) + 1;
+
+    return msb_lut_de_bruijn[(v * 0x077CB531) >>> 27];
+}

package/src/core/binary/msb_lut_de_bruijn.d.ts

@@ -0,0 +1,7 @@
+/**
+ * de Bruijn sequence
+ * @see https://graphics.stanford.edu/~seander/bithacks.html
+ * @type {Uint8Array}
+ */
+export const msb_lut_de_bruijn: Uint8Array;
+//# sourceMappingURL=msb_lut_de_bruijn.d.ts.map

package/src/core/binary/msb_lut_de_bruijn.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"msb_lut_de_bruijn.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/msb_lut_de_bruijn.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,gCAFU,UAAU,CAKjB"}

package/src/core/binary/msb_lut_de_bruijn.js

@@ -0,0 +1,9 @@
+/**
+ * de Bruijn sequence
+ * @see https://graphics.stanford.edu/~seander/bithacks.html
+ * @type {Uint8Array}
+ */
+export const msb_lut_de_bruijn = new Uint8Array([
+    0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8,
+    31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9
+]);

package/src/core/geom/3d/sphere/harmonics/sh3_convolve_with_cosine_kernel.js

@@ -22,4 +22,5 @@ export function sh3_convolve_with_cosine_kernel(out, out_offset, input, input_of
     out[out_offset + 6] = input[input_offset + 6] * CosineA2;
     out[out_offset + 7] = input[input_offset + 7] * CosineA2;
     out[out_offset + 8] = input[input_offset + 8] * CosineA2;
-}
+}
+

package/src/core/geom/3d/sphere/harmonics/sh3_vector_accumulate.d.ts

@@ -0,0 +1,12 @@
+/**
+ *
+ * @param {number[]|Float32Array|Float64Array} out
+ * @param {number} out_offset
+ * @param {number[]|Float32Array|Float64Array} basis
+ * @param {number} basis_offset
+ * @param {number[]|Float32Array|Float64Array} vector
+ * @param {number} vector_offset
+ * @param {number} dimensions
+ */
+export function sh3_vector_accumulate(out: number[] | Float32Array | Float64Array, out_offset: number, basis: number[] | Float32Array | Float64Array, basis_offset: number, vector: number[] | Float32Array | Float64Array, vector_offset: number, dimensions: number): void;
+//# sourceMappingURL=sh3_vector_accumulate.d.ts.map

package/src/core/geom/3d/sphere/harmonics/sh3_vector_accumulate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sh3_vector_accumulate.d.ts","sourceRoot":"","sources":["../../../../../../../src/core/geom/3d/sphere/harmonics/sh3_vector_accumulate.js"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AACH,2CARW,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,cAClC,MAAM,SACN,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,gBAClC,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,iBAClC,MAAM,cACN,MAAM,QA6BhB"}

package/src/core/geom/3d/sphere/harmonics/sh3_vector_accumulate.js

@@ -0,0 +1,40 @@
+import { assert } from "../../../../assert.js";
+
+/**
+ *
+ * @param {number[]|Float32Array|Float64Array} out
+ * @param {number} out_offset
+ * @param {number[]|Float32Array|Float64Array} basis
+ * @param {number} basis_offset
+ * @param {number[]|Float32Array|Float64Array} vector
+ * @param {number} vector_offset
+ * @param {number} dimensions
+ */
+export function sh3_vector_accumulate(
+    out, out_offset,
+    basis, basis_offset,
+    vector, vector_offset, dimensions
+) {
+
+    assert.isArrayLike(out, 'out');
+    assert.isNonNegativeInteger(out_offset, 'out_offset');
+
+    assert.isArrayLike(basis, 'basis');
+    assert.isNonNegativeInteger(basis_offset, 'basis_offset');
+
+    assert.isNonNegativeInteger(dimensions, 'dimensions');
+
+    for (let j = 0; j < 9; j++) {
+
+        const out_coefficient_offset = out_offset + j * dimensions;
+
+        const basis_value = basis[basis_offset + j];
+
+        for (let i = 0; i < dimensions; i++) {
+            const scalar = vector[vector_offset + i];
+
+            out[out_coefficient_offset + i] += basis_value * scalar;
+        }
+
+    }
+}

package/src/core/geom/3d/sphere/harmonics/sh3_vector_accumulate.spec.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=sh3_vector_accumulate.spec.d.ts.map

package/src/core/geom/3d/sphere/harmonics/sh3_vector_accumulate.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sh3_vector_accumulate.spec.d.ts","sourceRoot":"","sources":["../../../../../../../src/core/geom/3d/sphere/harmonics/sh3_vector_accumulate.spec.js"],"names":[],"mappings":""}

package/src/core/geom/3d/sphere/harmonics/sh3_vector_accumulate.spec.js

@@ -0,0 +1,27 @@
+import { sh3_vector_accumulate } from "./sh3_vector_accumulate.js";
+
+test("basics", () => {
+    const out = [
+        1, 2,
+        3,4, 5,6,7,8,
+        9,10, 11,12, 13,14, 15,16, 17,18
+    ];
+    const basis = [
+        2,
+        3, 5, 7,
+        11, 13, 17, 19, 23
+    ];
+
+    sh3_vector_accumulate(
+        out, 0,
+        basis, 0,
+        [-3, 5], 0,
+        2
+    );
+
+    expect(out).toEqual([
+        -5, 12,
+        -6, 19, -10, 31, -14, 43,
+        -24, 65, -28, 77, -38, 99, -42, 111, -52, 133
+    ]);
+});

package/src/core/geom/vec/vector_copy.d.ts

@@ -0,0 +1,10 @@
+/**
+ *
+ * @param {number[]} out
+ * @param {number} out_offset
+ * @param {number[]} input
+ * @param {number} input_offset
+ * @param {number} length
+ */
+export function vector_copy(out: number[], out_offset: number, input: number[], input_offset: number, length: number): void;
+//# sourceMappingURL=vector_copy.d.ts.map

package/src/core/geom/vec/vector_copy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vector_copy.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/vec/vector_copy.js"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,iCANW,MAAM,EAAE,cACR,MAAM,SACN,MAAM,EAAE,gBACR,MAAM,UACN,MAAM,QAIhB"}

package/src/core/geom/vec/vector_copy.js

@@ -0,0 +1,13 @@
+import { array_copy } from "../../collection/array/array_copy.js";
+
+/**
+ *
+ * @param {number[]} out
+ * @param {number} out_offset
+ * @param {number[]} input
+ * @param {number} input_offset
+ * @param {number} length
+ */
+export function vector_copy(out, out_offset, input, input_offset, length) {
+    array_copy(input, input_offset, out, out_offset, length);
+}

package/src/core/{math/vector_nd_dot.d.ts → geom/vec/vector_dot.d.ts}

@@ -5,5 +5,5 @@
  * @param {number} n number of dimensions
  * @return {number}
  */
-export function vector_nd_dot(a: number[] | Float32Array | Float64Array, b: number[] | Float32Array | Float64Array, n: number): number;
-//# sourceMappingURL=vector_nd_dot.d.ts.map
+export function vector_dot(a: number[] | Float32Array | Float64Array, b: number[] | Float32Array | Float64Array, n: number): number;
+//# sourceMappingURL=vector_dot.d.ts.map

package/src/core/geom/vec/vector_dot.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vector_dot.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/vec/vector_dot.js"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,8BALW,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,KAClC,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,KAClC,MAAM,GACL,MAAM,CAUjB"}

package/src/core/{math/vector_nd_dot.js → geom/vec/vector_dot.js}

@@ -5,7 +5,7 @@
  * @param {number} n number of dimensions
  * @return {number}
  */
-export function vector_nd_dot(a, b, n) {
+export function vector_dot(a, b, n) {
     let result = 0;
 
     for (let i = 0; i < n; i++) {

package/src/core/{math/vector_nd_normalize.d.ts → geom/vec/vector_normalize.d.ts}

@@ -4,5 +4,5 @@
  * @param {number[]|Float32Array|Float64Array} data
  * @param {number} [length] number of dimensions
  */
-export function vector_nd_normalize(result: number[] | Float32Array | Float64Array, data: number[] | Float32Array | Float64Array, length?: number): void;
-//# sourceMappingURL=vector_nd_normalize.d.ts.map
+export function vector_normalize(result: number[] | Float32Array | Float64Array, data: number[] | Float32Array | Float64Array, length?: number): void;
+//# sourceMappingURL=vector_normalize.d.ts.map

package/src/core/geom/vec/vector_normalize.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vector_normalize.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/vec/vector_normalize.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,yCAJW,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,QAClC,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,WAClC,MAAM,QAoBhB"}

package/src/core/{math/vector_nd_normalize.js → geom/vec/vector_normalize.js}

@@ -4,7 +4,7 @@
  * @param {number[]|Float32Array|Float64Array} data
  * @param {number} [length] number of dimensions
  */
-export function vector_nd_normalize(result, data, length = data.length) {
+export function vector_normalize(result, data, length = data.length) {
 
     let magnitude2 = 0;
 

package/src/core/geom/vec/vector_normalize.spec.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=vector_normalize.spec.d.ts.map

package/src/core/geom/vec/vector_normalize.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vector_normalize.spec.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/vec/vector_normalize.spec.js"],"names":[],"mappings":""}

package/src/core/{math/vector_nd_normalize.spec.js → geom/vec/vector_normalize.spec.js}

@@ -1,15 +1,15 @@
-import { vector_nd_normalize } from "./vector_nd_normalize.js";
+import { vector_normalize } from "./vector_normalize.js";
 
 test("1d vector normalization", () => {
     const v = [7];
 
-    vector_nd_normalize(v, v, 1);
+    vector_normalize(v, v, 1);
 
     expect(v[0]).toBeCloseTo(1);
 
     v[0] = -13;
 
-    vector_nd_normalize(v, v, 1);
+    vector_normalize(v, v, 1);
 
     expect(v[0]).toBeCloseTo(-1);
 });

package/src/core/geom/vec/vector_scale_array.d.ts

@@ -0,0 +1,11 @@
+/**
+ *
+ * @param {number[]|Float32Array|Float64Array} out
+ * @param {number} out_offset
+ * @param {number[]|Float32Array|Float64Array} input
+ * @param {number} input_offset
+ * @param {number} dimensions
+ * @param {number} scale
+ */
+export function vector_scale_array(out: number[] | Float32Array | Float64Array, out_offset: number, input: number[] | Float32Array | Float64Array, input_offset: number, dimensions: number, scale: number): void;
+//# sourceMappingURL=vector_scale_array.d.ts.map

package/src/core/geom/vec/vector_scale_array.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vector_scale_array.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/vec/vector_scale_array.js"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;AACH,wCAPW,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,cAClC,MAAM,SACN,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,gBAClC,MAAM,cACN,MAAM,SACN,MAAM,QAqBhB"}

package/src/core/geom/vec/vector_scale_array.js

@@ -0,0 +1,31 @@
+import { assert } from "../../assert.js";
+
+/**
+ *
+ * @param {number[]|Float32Array|Float64Array} out
+ * @param {number} out_offset
+ * @param {number[]|Float32Array|Float64Array} input
+ * @param {number} input_offset
+ * @param {number} dimensions
+ * @param {number} scale
+ */
+export function vector_scale_array(
+    out, out_offset,
+    input, input_offset,
+    dimensions,
+    scale) {
+
+    assert.isArrayLike(out, 'out');
+    assert.isNonNegativeInteger(out_offset, 'out_offset');
+
+    assert.isArrayLike(input, 'input');
+    assert.isNonNegativeInteger(input_offset, 'input_offset');
+
+    assert.isNonNegativeInteger(dimensions, 'dimensions');
+    assert.isNumber(scale, 'scale');
+
+    for (let i = 0; i < dimensions; i++) {
+        out[out_offset + i] = input[input_offset + i] * scale;
+    }
+
+}

package/src/core/geom/vec3/v3_dot_array_array.js

@@ -18,3 +18,5 @@ export function v3_dot_array_array(a, a_offset, b, b_offset) {
 
     return a_x * b_x + a_y * b_y + a_z * b_z;
 }
+
+

package/src/core/model/node-graph/node/NodeInstance.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"NodeInstance.d.ts","sourceRoot":"","sources":["../../../../../../src/core/model/node-graph/node/NodeInstance.js"],"names":[],"mappings":"AAcA;;;;GAIG;AACH;IAEI;;;;OAIG;IACH,aAFU,MAAM,CAEE;IAElB;;;OAGG;IACH,6BAAmB;IAEnB;;;OAGG;IACH,WAFU,yBAAyB,EAAE,CAEtB;IAEf;;;OAGG;IACH,gBAAgB;IAEhB;;;OAGG;IACH,qBAAmB;IAEnB;;;OAGG;IACH,aAFU,gBAAgB,CAED;IAEzB;;;;;;OAMG;IACH,wBAFU,MAAM,CAEE;IAElB;;OAEG;IACH;QACI;;;WAGG;mCADO,OAAO,MAAM,WAAO;QAG9B;;;WAGG;iCADO,OAAO,MAAM,MAAI;QAG3B;;;WAGG;mCADO,OAAO,MAAM,MAAI;QAI3B;;;;WAIG;qCADO,yCAAyC,YAAY,CAAC;MAGlE;IAEF;;;;;;OAMG;IACH,yBALW,MAAM,aACN,aAAa,UACb,YAAY,GACV,MAAM,CAsBlB;IAED;;;OAGG;IACH,gDAEC;IAED;;;OAGG;IACH,+CAEC;IAGD;;;OAGG;IACH,mCAEC;IAED;;;;OAIG;IACH,kCAEC;IAED;;;;OAIG;IACH,mBAHW,MAAM,oBAKhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,OAKhB;IAED;;;;OAIG;IACH,yBAHW,MAAM,KAOhB;IAED;;;;OAIG;IACH,2BAHW,MAAM,oBAmChB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,OAAO,CAkBnB;IAED;;;OAGG;IACH,uCAQC;IAED,wBAIC;IAED;;;OAGG;IACH,mDA+BC;IAED;;;;OAIG;IACH,qBAHW,MAAM,GACJ,yBAAyB,GAAC,SAAS,CAoB/C;IAED,eAEC;IAED;;;;OAIG;IACH,cAHW,YAAY,GACV,OAAO,CAQnB;IAED,mBAEC;IAIL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;CAPpC;0CA1VyC,gCAAgC;iBAHzD,kCAAkC;mBAChC,kCAAkC;8BAGvB,oBAAoB"}
+{"version":3,"file":"NodeInstance.d.ts","sourceRoot":"","sources":["../../../../../../src/core/model/node-graph/node/NodeInstance.js"],"names":[],"mappings":"AAcA;;;;GAIG;AACH;IAEI;;;;OAIG;IACH,aAFU,MAAM,CAEE;IAElB;;;OAGG;IACH,6BAAmB;IAEnB;;;OAGG;IACH,WAFU,yBAAyB,EAAE,CAEtB;IAEf;;;OAGG;IACH,gBAAgB;IAEhB;;;OAGG;IACH,qBAAmB;IAEnB;;;OAGG;IACH,aAFU,gBAAgB,CAED;IAEzB;;;;;;OAMG;IACH,wBAFU,MAAM,CAEE;IAElB;;OAEG;IACH;QACI;;;WAGG;mCADO,OAAO,MAAM,WAAO;QAG9B;;;WAGG;iCADO,OAAO,MAAM,MAAI;QAG3B;;;WAGG;mCADO,OAAO,MAAM,MAAI;QAI3B;;;;WAIG;qCADO,yCAAyC,YAAY,CAAC;MAGlE;IAEF;;;;;;OAMG;IACH,yBALW,MAAM,aACN,aAAa,UACb,YAAY,GACV,MAAM,CAsBlB;IAED;;;OAGG;IACH,gDAEC;IAED;;;OAGG;IACH,+CAEC;IAGD;;;OAGG;IACH,mCAEC;IAED;;;;OAIG;IACH,kCAEC;IAED;;;;OAIG;IACH,mBAHW,MAAM,oBAKhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,OAKhB;IAED;;;;OAIG;IACH,yBAHW,MAAM,KAOhB;IAED;;;;OAIG;IACH,2BAHW,MAAM,oBAmChB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,OAAO,CAkBnB;IAED;;;OAGG;IACH,uCAQC;IAED,wBAIC;IAED;;;OAGG;IACH,mDA+BC;IAED;;;;OAIG;IACH,qBAHW,MAAM,GACJ,yBAAyB,GAAC,SAAS,CAoB/C;IAED;;;;OAIG;IACH,6BAHW,MAAM,GACJ,SAAS,GAAC,yBAAyB,CAa/C;IAED,eAEC;IAED;;;;OAIG;IACH,cAHW,YAAY,GACV,OAAO,CAQnB;IAED,mBAEC;IAIL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;CAPpC;0CA5WyC,gCAAgC;iBAHzD,kCAAkC;mBAChC,kCAAkC;8BAGvB,oBAAoB"}

package/src/core/model/node-graph/node/NodeInstance.js

@@ -329,6 +329,24 @@ export class NodeInstance {
         return undefined;
     }
 
+    /**
+     *
+     * @param {string} name
+     * @returns {undefined|NodeInstancePortReference}
+     */
+    getFirstEndpointByName(name) {
+        assert.isString(name, 'name');
+
+        const ports = this.description.getPortsByName(name);
+
+        if (ports.length === 0) {
+            return undefined;
+        }
+
+        return this.getEndpoint(ports[0].id);
+
+    }
+
     hash() {
         return this.id;
     }