@woosh/meep-engine 2.120.5 → 2.121.1

package/src/core/geom/2d/quad-tree/QuadTreeNode.js

@@ -2,6 +2,8 @@ import { assert } from "../../../assert.js";
 import { max2 } from "../../../math/max2.js";
 import { min2 } from "../../../math/min2.js";
 import AABB2 from "../../2d/aabb/AABB2.js";
+import { qt_collect_by_box } from "./qt_collect_by_box.js";
+import { qt_collect_by_point } from "./qt_collect_by_point.js";
 import { QuadTreeDatum } from "./QuadTreeDatum.js";
 
 
@@ -13,45 +15,45 @@ const THRESHOLD_MERGE = 8;
  * @extends AABB2
  */
 export class QuadTreeNode extends AABB2 {
-    constructor(x0 = 0, y0 = 0, x1 = 0, y1 = 0) {
-        super(x0, y0, x1, y1);
-
-        /**
-         *
-         * @type {QuadTreeNode|null}
-         */
-        this.topLeft = null;
-        /**
-         *
-         * @type {QuadTreeNode|null}
-         */
-        this.topRight = null;
-        /**
-         *
-         * @type {QuadTreeNode|null}
-         */
-        this.bottomLeft = null;
-        /**
-         *
-         * @type {QuadTreeNode|null}
-         */
-        this.bottomRight = null;
+    /**
+     *
+     * @type {QuadTreeNode|null}
+     */
+    topLeft = null;
+    /**
+     *
+     * @type {QuadTreeNode|null}
+     */
+    topRight = null;
+    /**
+     *
+     * @type {QuadTreeNode|null}
+     */
+    bottomLeft = null;
+    /**
+     *
+     * @type {QuadTreeNode|null}
+     */
+    bottomRight = null;
 
-        /**
-         *
-         * @type {QuadTreeNode|null}
-         */
-        this.parentNode = null;
+    /**
+     *
+     * @type {QuadTreeNode|null}
+     */
+    parentNode = null;
 
-        this.treeDataCount = 0;
+    /**
+     *
+     * @type {number}
+     */
+    treeDataCount = 0;
 
 
-        /**
-         *
-         * @type {QuadTreeDatum<D>[]}
-         */
-        this.data = [];
-    }
+    /**
+     *
+     * @type {QuadTreeDatum<D>[]}
+     */
+    data = [];
 
     balance() {
         const dataLength = this.data.length;
@@ -174,8 +176,8 @@ export class QuadTreeNode extends AABB2 {
                 }
             }
 
-            const xm = (x0 + x1) *0.5;
-            const ym = (y0 + y1) *0.5;
+            const xm = (x0 + x1) * 0.5;
+            const ym = (y0 + y1) * 0.5;
 
             if (datum.y1 < ym) {
                 //top
@@ -417,7 +419,7 @@ export class QuadTreeNode extends AABB2 {
 
     /**
      *
-     * @param {function(QuadTreeNode):boolean} visitor
+     * @param {function(QuadTreeNode<D>):boolean} visitor
      * @param {*} [thisArg]
      */
     traversePreOrder(visitor, thisArg) {
@@ -437,75 +439,34 @@ export class QuadTreeNode extends AABB2 {
     }
 
     /**
-     *
+     * @deprecated use {@link qt_collect_by_point}
      * @param {number} x
      * @param {number} y
      * @param {function(QuadTreeDatum<D>, x:number,y:number):boolean?} visitor
      * @param {*} [thisArg]
      */
-    traversePointIntersections(x, y, visitor, thisArg) {
-        const data = this.data;
-        const dataCount = data.length;
-
-        for (let i = 0; i < dataCount; i++) {
-            const datum = data[i];
-
-            if (datum.x0 <= x && datum.x1 >= x && datum.y0 <= y && datum.y1 >= y) {
-                const continueTraversal = visitor.call(thisArg, datum, x, y);
-
-                if (continueTraversal === false) {
-                    return;
-                }
-            }
-        }
-
-        if (this.isSplit()) {
-
-            const hx = (this.x0 + this.x1) / 2;
-            const hy = (this.y0 + this.y1) / 2;
-
-            if (hx >= x) {
-                if (hy >= y) {
-                    this.topLeft.traversePointIntersections(x, y, visitor, thisArg);
-                }
-                if (hy <= y) {
-                    this.bottomLeft.traversePointIntersections(x, y, visitor, thisArg);
-                }
-            }
-
-            if (hx <= x) {
-                if (hy >= y) {
-                    this.topRight.traversePointIntersections(x, y, visitor, thisArg);
-                }
-                if (hy <= y) {
-                    this.bottomRight.traversePointIntersections(x, y, visitor, thisArg);
-                }
-            }
-
-        }
+    traversePointIntersections(
+        x,
+        y,
+        visitor,
+        thisArg
+    ) {
+        throw new Error('Deprecated, use `qt_collect_by_point` instead')
     }
 
     /**
-     *
+     * @deprecated use {@link qt_collect_by_point} directly
      * @param {Array<QuadTreeDatum<D>>} result
      * @param {number} x
      * @param {number} y
      * @returns {number} number of intersecting objects added to the result
      */
     requestDatumIntersectionsPoint(result, x, y) {
-        //TODO optimize closures out to avoid GC
-
-        let count = 0;
-
-        this.traversePointIntersections(x, y, (d) => {
-            result[count++] = d;
-        });
-
-        return count;
+        return qt_collect_by_point(result, 0, this, x, y);
     }
 
     /**
-     *
+     * @deprecated use {@link qt_collect_by_box} instead
      * @param {Array<QuadTreeDatum<D>>} result
      * @param {number} x0
      * @param {number} y0
@@ -514,18 +475,12 @@ export class QuadTreeNode extends AABB2 {
      * @returns {number} number of intersecting objects added to the result
      */
     requestDatumIntersectionsRectangle(result, x0, y0, x1, y1) {
-        let count = 0;
-
-        //TODO optimize closures out, to avoid GC
-        this.traverseRectangleIntersections(x0, y0, x1, y1, (d) => {
-            result[count++] = d;
-        });
-
-        return count;
+        return qt_collect_by_box(result, 0, this, x0, y0, x1, y1);
     }
 
     /**
      * NOTE: touching is not counted as intersection
+     * @deprecated use {@link qt_collect_by_box} instead
      * @param {number} x0
      * @param {number} y0
      * @param {number} x1
@@ -576,3 +531,9 @@ export class QuadTreeNode extends AABB2 {
     }
 
 }
+
+/**
+ * @readonly
+ * @type {boolean}
+ */
+QuadTreeNode.prototype.isQuadTreeNode = true;

package/src/core/geom/2d/quad-tree/qt_collect_by_box.d.ts

@@ -0,0 +1,14 @@
+/**
+ *
+ * @template T
+ * @param {Array<QuadTreeDatum<T>>} result
+ * @param {number} result_offset
+ * @param {QuadTreeNode<T>} tree
+ * @param {number} x0
+ * @param {number} y0
+ * @param {number} x1
+ * @param {number} y1
+ * @returns {number}
+ */
+export function qt_collect_by_box<T>(result: Array<QuadTreeDatum<T>>, result_offset: number, tree: QuadTreeNode<T>, x0: number, y0: number, x1: number, y1: number): number;
+//# sourceMappingURL=qt_collect_by_box.d.ts.map

package/src/core/geom/2d/quad-tree/qt_collect_by_box.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"qt_collect_by_box.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/quad-tree/qt_collect_by_box.js"],"names":[],"mappings":"AASA;;;;;;;;;;;GAWG;AACH,kCAVa,CAAC,UACH,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,iBACvB,MAAM,QACN,YAAY,CAAC,CAAC,CAAC,MACf,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,MAAM,CAsElB"}

package/src/core/geom/2d/quad-tree/qt_collect_by_box.js

@@ -0,0 +1,90 @@
+import { assert } from "../../../assert.js";
+import { aabb2_overlap_exists } from "../aabb/aabb2_overlap_exists.js";
+
+/**
+ *
+ * @type {QuadTreeNode[]}
+ */
+const node_stack = [];
+
+/**
+ *
+ * @template T
+ * @param {Array<QuadTreeDatum<T>>} result
+ * @param {number} result_offset
+ * @param {QuadTreeNode<T>} tree
+ * @param {number} x0
+ * @param {number} y0
+ * @param {number} x1
+ * @param {number} y1
+ * @returns {number}
+ */
+export function qt_collect_by_box(
+    result, result_offset,
+    tree,
+    x0, y0,x1, y1
+){
+    assert.isArray(result, 'result');
+    assert.isNonNegativeInteger(result_offset, 'result_offset');
+    assert.defined(tree, 'tree');
+    assert.notNull(tree, 'tree');
+    assert.equal(tree.isQuadTreeNode, true, 'tree.isQuadTreeNode !== true');
+    assert.isNumber(x0, 'x0');
+    assert.isNumber(y0, 'y0');
+    assert.isNumber(x1, 'x1');
+    assert.isNumber(y1, 'y1');
+
+    let result_cursor = result_offset;
+
+    let stack_pointer = 1;
+
+    node_stack[0] = tree;
+
+    while (stack_pointer-- > 0) {
+
+        const node = node_stack[stack_pointer];
+
+        if (!aabb2_overlap_exists(node.x0, node.y0, node.x1, node.y1, x0, y0, x1,y1)) {
+            // not a match
+            continue;
+        }
+
+        const data = node.data;
+        const data_count = data.length;
+
+        for (let i = 0; i < data_count; i++) {
+            const datum = data[i];
+
+            if (aabb2_overlap_exists(datum.x0, datum.y0, datum.x1, datum.y1, x0, y0, x1,y1)) {
+                result[result_cursor++] = datum;
+            }
+        }
+
+        if (node.isSplit()) {
+            const hx = (node.x0 + node.x1) * 0.5;
+            const hy = (node.y0 + node.y1) * 0.5;
+
+            if (hx >= x0) {
+                if (hy >= y0) {
+                    node_stack[stack_pointer++] = node.topLeft;
+                }
+                if (hy <= y1) {
+                    node_stack[stack_pointer++] = node.bottomLeft;
+                }
+            }
+
+            if (hx <= x1) {
+                if (hy >= y0) {
+                    node_stack[stack_pointer++] = node.topRight;
+                }
+                if (hy <= y1) {
+                    node_stack[stack_pointer++] = node.bottomRight;
+                }
+            }
+
+
+        }
+    }
+
+    return result_cursor - result_offset;
+}

package/src/core/geom/2d/quad-tree/qt_collect_by_point.d.ts

@@ -0,0 +1,11 @@
+/**
+ * @template T
+ * @param {Array<QuadTreeDatum<T>>} result
+ * @param {number} result_offset
+ * @param {QuadTreeNode<T>} tree
+ * @param {number} x
+ * @param {number} y
+ * @returns {number}
+ */
+export function qt_collect_by_point<T>(result: Array<QuadTreeDatum<T>>, result_offset: number, tree: QuadTreeNode<T>, x: number, y: number): number;
+//# sourceMappingURL=qt_collect_by_point.d.ts.map

package/src/core/geom/2d/quad-tree/qt_collect_by_point.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"qt_collect_by_point.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/quad-tree/qt_collect_by_point.js"],"names":[],"mappings":"AASA;;;;;;;;GAQG;AACH,oCARa,CAAC,UACH,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,iBACvB,MAAM,QACN,YAAY,CAAC,CAAC,CAAC,KACf,MAAM,KACN,MAAM,GACJ,MAAM,CAoElB"}

package/src/core/geom/2d/quad-tree/qt_collect_by_point.js

@@ -0,0 +1,85 @@
+import { assert } from "../../../assert.js";
+import { aabb2_intersects_point } from "../aabb/aabb2_intersects_point.js";
+
+/**
+ *
+ * @type {QuadTreeNode[]}
+ */
+const node_stack = [];
+
+/**
+ * @template T
+ * @param {Array<QuadTreeDatum<T>>} result
+ * @param {number} result_offset
+ * @param {QuadTreeNode<T>} tree
+ * @param {number} x
+ * @param {number} y
+ * @returns {number}
+ */
+export function qt_collect_by_point(
+    result, result_offset,
+    tree,
+    x, y
+) {
+    assert.isArray(result, 'result');
+    assert.isNonNegativeInteger(result_offset, 'result_offset');
+    assert.defined(tree, 'tree');
+    assert.notNull(tree, 'tree');
+    assert.equal(tree.isQuadTreeNode, true, 'tree.isQuadTreeNode !== true');
+    assert.isNumber(x, 'x');
+    assert.isNumber(y, 'y');
+
+    let result_cursor = result_offset;
+
+    let stack_pointer = 1;
+
+    node_stack[0] = tree;
+
+    while (stack_pointer-- > 0) {
+
+        const node = node_stack[stack_pointer];
+
+        if (!aabb2_intersects_point(node.x0, node.y0, node.x1, node.y1, x, y)) {
+            // not a match
+            continue;
+        }
+
+        const data = node.data;
+        const data_count = data.length;
+
+        for (let i = 0; i < data_count; i++) {
+            const datum = data[i];
+
+            if (aabb2_intersects_point(datum.x0, datum.y0, datum.x1, datum.y1, x, y)) {
+                result[result_cursor++] = datum;
+            }
+        }
+
+        if (node.isSplit()) {
+            const hx = (node.x0 + node.x1) * 0.5;
+            const hy = (node.y0 + node.y1) * 0.5;
+
+            if (hx >= x) {
+                if (hy >= y) {
+                    node_stack[stack_pointer++] = node.topLeft;
+                }
+                if (hy <= y) {
+                    node_stack[stack_pointer++] = node.bottomLeft;
+                }
+            }
+
+            if (hx <= x) {
+                if (hy >= y) {
+                    node_stack[stack_pointer++] = node.topRight;
+                }
+                if (hy <= y) {
+                    node_stack[stack_pointer++] = node.bottomRight;
+                }
+            }
+
+
+        }
+    }
+
+    return result_cursor - result_offset;
+}

package/src/core/geom/3d/ray/ray3_distance_to_point.d.ts

@@ -1,2 +1,15 @@
-export function ray3_distance_to_point(origin_x: any, origin_y: any, origin_z: any, direction_x: any, direction_y: any, direction_z: any, ref_x: any, ref_y: any, ref_z: any): number;
+/**
+ *
+ * @param {number} origin_x
+ * @param {number} origin_y
+ * @param {number} origin_z
+ * @param {number} direction_x
+ * @param {number} direction_y
+ * @param {number} direction_z
+ * @param {number} ref_x
+ * @param {number} ref_y
+ * @param {number} ref_z
+ * @return {number}
+ */
+export function ray3_distance_to_point(origin_x: number, origin_y: number, origin_z: number, direction_x: number, direction_y: number, direction_z: number, ref_x: number, ref_y: number, ref_z: number): number;
 //# sourceMappingURL=ray3_distance_to_point.d.ts.map

package/src/core/geom/3d/ray/ray3_distance_to_point.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ray3_distance_to_point.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/ray/ray3_distance_to_point.js"],"names":[],"mappings":"AAEA,sLAWC"}
+{"version":3,"file":"ray3_distance_to_point.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/ray/ray3_distance_to_point.js"],"names":[],"mappings":"AAEA;;;;;;;;;;;;GAYG;AACH,iDAXW,MAAM,YACN,MAAM,YACN,MAAM,eACN,MAAM,eACN,MAAM,eACN,MAAM,SACN,MAAM,SACN,MAAM,SACN,MAAM,GACL,MAAM,CAiBjB"}

package/src/core/geom/3d/ray/ray3_distance_to_point.js

@@ -1,6 +1,23 @@
 import { v3_dot } from "../../vec3/v3_dot.js";
 
-export function ray3_distance_to_point(origin_x, origin_y, origin_z, direction_x, direction_y, direction_z, ref_x, ref_y, ref_z){
+/**
+ *
+ * @param {number} origin_x
+ * @param {number} origin_y
+ * @param {number} origin_z
+ * @param {number} direction_x
+ * @param {number} direction_y
+ * @param {number} direction_z
+ * @param {number} ref_x
+ * @param {number} ref_y
+ * @param {number} ref_z
+ * @return {number}
+ */
+export function ray3_distance_to_point(
+    origin_x, origin_y, origin_z,
+    direction_x, direction_y, direction_z,
+    ref_x, ref_y, ref_z
+) {
     // find the closest point
     const sp0_x = ref_x - origin_x;
     const sp0_y = ref_y - origin_y;

package/src/core/geom/3d/shape/UnionShape3D.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"UnionShape3D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/shape/UnionShape3D.js"],"names":[],"mappings":"AA0BA;IAqII;;;;OAIG;IACH,sBAHW,eAAe,EAAE,GACf,YAAY,CAUxB;IA9IG;;;OAGG;IACH,UAFU,eAAe,EAAE,CAET;IAElB;;;;;OAKG;IACH,kCAAmC;IAEnC,qBAAsB;IACtB,qBAAuB;IACvB,uBAAyB;IAG7B,wCAgCC;IAED;;;OAGG;IACH,mCAkBC;IAED;;;OAGG;IACH,2CA8CC;IAiBD,qBAuBC;IAED,2BAYC;IAED,mEAEC;IAED,6CAaC;IAED,oCAYC;IAED,kFAoDC;IAED,qGAyBC;IAED;;;;OAIG;IACH,cAHW,YAAY,GACV,OAAO,CAKnB;IAED,eAWC;CACJ;gCArV+B,sBAAsB"}
+{"version":3,"file":"UnionShape3D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/shape/UnionShape3D.js"],"names":[],"mappings":"AA2BA;IAqII;;;;OAIG;IACH,sBAHW,eAAe,EAAE,GACf,YAAY,CAYxB;IAhJG;;;OAGG;IACH,UAFU,eAAe,EAAE,CAET;IAElB;;;;;OAKG;IACH,kCAAmC;IAEnC,qBAAsB;IACtB,qBAAuB;IACvB,uBAAyB;IAG7B,wCAgCC;IAED;;;OAGG;IACH,mCAkBC;IAED;;;OAGG;IACH,2CA8CC;IAmBD,qBAuBC;IAED,2BAaC;IAED,mEAEC;IAED,6CAaC;IAED,oCAYC;IAED,kFAoDC;IAED,qGAyBC;IAED;;;;OAIG;IACH,cAHW,YAAY,GACV,OAAO,CAKnB;IAED,eAWC;CACJ;gCAxV+B,sBAAsB"}

package/src/core/geom/3d/shape/UnionShape3D.js

@@ -1,3 +1,4 @@
+import { assert } from "../../../assert.js";
 import { array_copy } from "../../../collection/array/array_copy.js";
 import { binarySearchHighIndex } from "../../../collection/array/binarySearchHighIndex.js";
 import { isArrayEqual } from "../../../collection/array/isArrayEqual.js";
@@ -163,6 +164,8 @@ export class UnionShape3D extends AbstractShape3D {
      * @returns {UnionShape3D}
      */
     static from(children) {
+        assert.isArray(children, 'children');
+
         const r = new UnionShape3D();
 
         r.children = children;
@@ -205,6 +208,7 @@ export class UnionShape3D extends AbstractShape3D {
         for (let i = 0; i < child_count; i++) {
             const child = children[i];
 
+            // TODO this is incorrect math
             r += child.surface_area;
         }
 

package/src/core/geom/3d/shape/UnitCubeShape3D.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"UnitCubeShape3D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/shape/UnitCubeShape3D.js"],"names":[],"mappings":"AAUA;IAkFI,iCAAwC;IAhFxC,qBAEC;IAED,wCAQC;IAED,4DAYC;IAED,qGAIC;IAED,mEAEC;IAED,6CAqBC;IAED,oCASC;IAED,kFAEC;IAED,eAEC;CAGJ;gCAtF+B,sBAAsB"}
+{"version":3,"file":"UnitCubeShape3D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/shape/UnitCubeShape3D.js"],"names":[],"mappings":"AAUA;IAsFI,iCAAwC;IApFxC,qBAEC;IAED,2BAEC;IAED,wCAQC;IAED,4DAYC;IAED,qGAIC;IAED,mEAEC;IAED,6CAqBC;IAED,oCASC;IAED,kFAEC;IAED,eAEC;CAGJ;gCA1F+B,sBAAsB"}

package/src/core/geom/3d/shape/UnitCubeShape3D.js

@@ -14,6 +14,10 @@ export class UnitCubeShape3D extends AbstractShape3D {
         return 1;
     }
 
+    get surface_area() {
+        return 6;
+    }
+
     compute_bounding_box(result) {
         result[0] = -0.5;
         result[1] = -0.5;

package/src/core/geom/ConicRay.d.ts

@@ -49,10 +49,14 @@ export class ConicRay {
     /**
      *
      * @param {ConicRay} other
-     * @param {number} tolerance
+     * @param {number} [tolerance]
      * @returns {boolean}
      */
     roughlyEquals(other: ConicRay, tolerance?: number): boolean;
+    /**
+     *
+     * @return {number}
+     */
     hash(): number;
     /**
      *

package/src/core/geom/ConicRay.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ConicRay.d.ts","sourceRoot":"","sources":["../../../../src/core/geom/ConicRay.js"],"names":[],"mappings":"AAQA;;;;GAIG;AACH;IA8KI;;;;;;;OAOG;IACH,sBANW,MAAM,KACN,MAAM,KACN,MAAM,cACN,MAAM,GACJ,QAAQ,CAkBpB;IApMD;;;;OAIG;IACH,oBAFU,OAAO,CAEgB;IAEjC;;;;OAIG;IACH,OAFU,MAAM,CAEN;IAEV;;;MAKC;IAED,0BAGC;IAED;;;OAGG;IACH,uBAFW,YAAY,QAKtB;IAED;;;OAGG;IACH,yBAFW,YAAY,QAQtB;IAED;;;;OAIG;IACH,cAHW,QAAQ,GACN,OAAO,CAMnB;IAED;;;;;OAKG;IACH,qBAJW,QAAQ,cACR,MAAM,GACJ,OAAO,CAKnB;IAED,eAKC;IAED;;;OAGG;IACH,YAFW,QAAQ,QAKlB;IAED;;;;OAIG;IACH,4BAHW,OAAO,GACL,OAAO,CAMnB;IAED;;;;;OAKG;IACH,gDAFW,OAAO,QAsEjB;CA2BJ;oBA/MmB,cAAc"}
+{"version":3,"file":"ConicRay.d.ts","sourceRoot":"","sources":["../../../../src/core/geom/ConicRay.js"],"names":[],"mappings":"AAQA;;;;GAIG;AACH;IAkLI;;;;;;;OAOG;IACH,sBANW,MAAM,KACN,MAAM,KACN,MAAM,cACN,MAAM,GACJ,QAAQ,CAkBpB;IAxMD;;;;OAIG;IACH,oBAFU,OAAO,CAEgB;IAEjC;;;;OAIG;IACH,OAFU,MAAM,CAEN;IAEV;;;MAKC;IAED,0BAGC;IAED;;;OAGG;IACH,uBAFW,YAAY,QAKtB;IAED;;;OAGG;IACH,yBAFW,YAAY,QAQtB;IAED;;;;OAIG;IACH,cAHW,QAAQ,GACN,OAAO,CAMnB;IAED;;;;;OAKG;IACH,qBAJW,QAAQ,cACR,MAAM,GACJ,OAAO,CAKnB;IAED;;;OAGG;IACH,QAFY,MAAM,CAOjB;IAED;;;OAGG;IACH,YAFW,QAAQ,QAKlB;IAED;;;;OAIG;IACH,4BAHW,OAAO,GACL,OAAO,CAMnB;IAED;;;;;OAKG;IACH,gDAFW,OAAO,QAsEjB;CA2BJ;oBAnNmB,cAAc"}

package/src/core/geom/ConicRay.js

@@ -74,7 +74,7 @@ export class ConicRay {
     /**
      *
      * @param {ConicRay} other
-     * @param {number} tolerance
+     * @param {number} [tolerance]
      * @returns {boolean}
      */
     roughlyEquals(other, tolerance = EPSILON) {
@@ -82,6 +82,10 @@ export class ConicRay {
             && this.direction.roughlyEquals(other.direction, tolerance);
     }
 
+    /**
+     *
+     * @return {number}
+     */
     hash() {
         return combine_hash(
             computeHashFloat(this.angle),

package/src/core/geom/Vector1.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Vector1.d.ts","sourceRoot":"","sources":["../../../../src/core/geom/Vector1.js"],"names":[],"mappings":";AAWA;IAmQI;;;;;OAKG;IACH,kBAJW,OAAO,KACP,OAAO,GACN,MAAM,CAIjB;IA1QD;;;;;;OAMG;IACH,gBALW,MAAM,EAchB;IAHG,UAAU;IAEV,0DAA6B;IAWjC;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAED;;;;OAIG;IACH,iBAHW,OAAO,GACL,MAAM,CAIlB;IAED;;;;OAIG;IACH,OAHW,MAAM,GACJ,OAAO,CAgBnB;IAED;;;OAGG;IACH,aAFW,MAAM,QAOhB;IAED;;;OAGG;IACH,UAFY,OAAO,CAIlB;IAED,kBAEC;IAED,kBAEC;IAED;;;;OAIG;IACH,iBAFY,OAAO,CAIlB;IAED;;;OAGG;IACH,WAFW,OAAO,GAAC,OAAO,GAAC,OAAO,GAAC,OAAO,WAIzC;IAED;;;;OAIG;IACH,iBAFY,OAAO,CAIlB;IAED;;;;OAIG;IACH,WAHW,OAAO,GACL,OAAO,CAInB;IAED;;;;OAIG;IACH,gBAHW,OAAO,GACL,OAAO,CAInB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAIhB;IAED;;;;;OAKG;IACH,WAJW,MAAM,QACN,MAAM,GACJ,OAAO,CAInB;IAED;;;OAGG;IACH,eAEC;IAED;;;OAGG;IACH,YAFW,OAAO,GAAC,OAAO,GAAC,OAAO,GAAC,OAAO,QAIzC;IAED;;;OAGG;IACH,SAFa,OAAO,CAInB;IAED;;;;OAIG;IACH,cAHW,OAAO,GACL,OAAO,CAInB;IAED;;OAEG;IACH,QAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,4BAGC;IAED,iBAEC;IAED,yBAEC;IAED;;;;OAIG;IACH,qBAHW,MAAM,EAAE,WACR,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,EAAE,WACR,MAAM,QAIhB;IAED,oBAEC;IAED;;;OAGG;IACH,uBAFW,YAAY,QAItB;IAED;;;OAGG;IACH,yBAFW,YAAY,QAMtB;IAgBD,iBAEC;IAND,gBAEC;IAaL;;;OAGG;IACH,oBAFU,OAAO,CAEU;IAXvB,sDAIC;CACJ;;;cAYS,OAAO;aAMP,OAAO;;mBAjTE,4BAA4B"}
+{"version":3,"file":"Vector1.d.ts","sourceRoot":"","sources":["../../../../src/core/geom/Vector1.js"],"names":[],"mappings":";AAWA;IA4QI;;;;;OAKG;IACH,kBAJW,OAAO,KACP,OAAO,GACN,MAAM,CAIjB;IAnRD;;;;;;OAMG;IACH,gBALW,MAAM,EAchB;IAHG,UAAU;IAEV,0DAA6B;IAWjC;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAED;;;;OAIG;IACH,iBAHW,OAAO,GACL,MAAM,CAIlB;IAED;;;;OAIG;IACH,OAHW,MAAM,GACJ,OAAO,CAgBnB;IAED;;;OAGG;IACH,aAFW,MAAM,QAOhB;IAED;;;OAGG;IACH,UAFY,OAAO,CAIlB;IAED;;;OAGG;IACH,kBAEC;IAED;;;OAGG;IACH,kBAEC;IAED;;;;OAIG;IACH,iBAFY,OAAO,CAIlB;IAED;;;OAGG;IACH,WAFW,OAAO,GAAC,OAAO,GAAC,OAAO,GAAC,OAAO,WAKzC;IAED;;;;OAIG;IACH,iBAFY,OAAO,CAIlB;IAED;;;;OAIG;IACH,WAHW,OAAO,GACL,OAAO,CAInB;IAED;;;;OAIG;IACH,gBAHW,OAAO,GACL,OAAO,CAInB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAIhB;IAED;;;;;OAKG;IACH,WAJW,MAAM,QACN,MAAM,GACJ,OAAO,CAInB;IAED;;;OAGG;IACH,eAEC;IAED;;;OAGG;IACH,YAFW,OAAO,GAAC,OAAO,GAAC,OAAO,GAAC,OAAO,QAIzC;IAED;;;OAGG;IACH,SAFa,OAAO,CAInB;IAED;;;;OAIG;IACH,cAHW,OAAO,GACL,OAAO,CAInB;IAED;;OAEG;IACH,QAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,4BAGC;IAED,iBAEC;IAED,yBAEC;IAED;;;;OAIG;IACH,qBAHW,MAAM,EAAE,WACR,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,EAAE,WACR,MAAM,QAIhB;IAED,oBAEC;IAED;;;OAGG;IACH,uBAFW,YAAY,QAItB;IAED;;;OAGG;IACH,yBAFW,YAAY,QAMtB;IAkBD,iBAEC;IAND,gBAEC;IAaL;;;OAGG;IACH,oBAFU,OAAO,CAEU;IAXvB,sDAIC;CACJ;;;cAaS,OAAO;aAOP,OAAO;;mBA9TE,4BAA4B"}

package/src/core/geom/Vector1.js

@@ -45,7 +45,7 @@ class Vector1 extends Number {
     }
 
     /**
-     *
+     * Currently held value
      * @returns {number}
      */
     getValue() {
@@ -53,7 +53,7 @@ class Vector1 extends Number {
     }
 
     /**
-     *
+     * Useful for sorting
      * @param {Vector1} other
      * @returns {number}
      */
@@ -101,10 +101,18 @@ class Vector1 extends Number {
         return this.x === 0;
     }
 
+    /**
+     * Increase value by 1.
+     * `value++`
+     */
     increment() {
         this._add(1);
     }
 
+    /**
+     * Decrease value by 1.
+     * `value--`
+     */
     decrement() {
         this._add(-1);
     }
@@ -123,6 +131,7 @@ class Vector1 extends Number {
      * @param {Vector1|Vector2|Vector3|Vector4} other
      */
     add(other) {
+        assert.isObject(other,"other");
         return this._add(other.x);
     }
 
@@ -278,6 +287,8 @@ class Vector1 extends Number {
         return a.x - b.x;
     }
 
+    // pretending to be an array
+
     get 0() {
         return this.x;
     }
@@ -302,12 +313,14 @@ Vector1.prototype.isVector1 = true;
 Vector1.typeName = "Vector1";
 
 /**
+ * Utility singleton
  * @readonly
  * @type {Vector1}
  */
 Vector1.zero = Object.freeze(new Vector1(0));
 
 /**
+ * Utility singleton
  * @readonly
  * @type {Vector1}
  */