@woosh/meep-engine 2.87.3 → 2.87.4

package/src/core/geom/2d/quad-tree-binary/QuadTree.spec.js

@@ -0,0 +1,53 @@
+import { QT_NULL_POINTER, QuadTree } from "./QuadTree.js";
+
+test("constructor does not throw", () => {
+
+    new QuadTree();
+
+});
+
+test("root is set after insert operation", () => {
+
+    const tree = new QuadTree();
+
+    const el = tree.element_allocate();
+
+    tree.element_set_bounds_primitive(el, 0, 0, 0, 0);
+
+    tree.element_insert(el);
+
+    expect(tree.root).not.toEqual(QT_NULL_POINTER)
+
+});
+
+test("removing last element clears out root", () => {
+    const tree = new QuadTree();
+
+    const el = tree.element_allocate();
+
+    tree.element_set_bounds_primitive(el, 0, 0, 0, 0);
+
+    tree.element_insert(el);
+    tree.element_remove(el);
+
+    expect(tree.root).toEqual(QT_NULL_POINTER)
+
+});
+
+test("inserting multiple elements into the tree does not throw",()=>{
+
+    const tree = new QuadTree();
+
+    const a = tree.element_allocate();
+
+    tree.element_set_bounds_primitive(a, 0, 0, 0, 0);
+
+    tree.element_insert(a);
+
+    const b = tree.element_allocate();
+
+    tree.element_set_bounds_primitive(b, 0, 0, 0, 0);
+
+    tree.element_insert(b);
+
+});

package/src/core/geom/3d/morton/de_interleave_2_bits.spec.d.ts

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

package/src/core/geom/3d/morton/de_interleave_2_bits.spec.d.ts.map

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

package/src/core/geom/3d/morton/de_interleave_2_bits.spec.js

@@ -0,0 +1,21 @@
+import { de_interleave_2_bits } from "./de_interleave_bits_by_2.js";
+
+test("deinterleave 0", () => {
+
+    const bits = de_interleave_2_bits(0);
+
+    expect(bits).toBe(0);
+
+});
+
+test("deinterleave 3 and 7", () => {
+
+    const interleaved_3 = 0b101;
+    const interleaved_4 = 0b10000;
+
+    const interleaved = (interleaved_3 << 1) | interleaved_4;
+
+    expect(de_interleave_2_bits(interleaved)).toBe(4);
+    expect(de_interleave_2_bits(interleaved >> 1)).toBe(3);
+
+});

package/src/core/geom/3d/morton/de_interleave_bits_by_2.d.ts

@@ -0,0 +1,7 @@
+/**
+ * ABABAB gets turned into BBB
+ * @param {number} interleaved
+ * @returns {number} Odd bits end up in lower 16 bits, even bits end up in top part
+ */
+export function de_interleave_2_bits(interleaved: number): number;
+//# sourceMappingURL=de_interleave_bits_by_2.d.ts.map

package/src/core/geom/3d/morton/de_interleave_bits_by_2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"de_interleave_bits_by_2.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/morton/de_interleave_bits_by_2.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,kDAHW,MAAM,GACJ,MAAM,CAWlB"}

package/src/core/geom/3d/morton/de_interleave_bits_by_2.js

@@ -0,0 +1,15 @@
+/**
+ * ABABAB gets turned into BBB
+ * @param {number} interleaved
+ * @returns {number} Odd bits end up in lower 16 bits, even bits end up in top part
+ */
+export function de_interleave_2_bits(interleaved) {
+    let x = interleaved & 0x55555555;
+
+    x = (x | (x >> 1)) & 0x33333333;
+    x = (x | (x >> 2)) & 0x0f0f0f0f;
+    x = (x | (x >> 4)) & 0x00ff00ff;
+    x = (x | (x >> 8)) & 0x0000ffff;
+
+    return x;
+}

package/src/core/geom/3d/morton/split_by_2.d.ts

@@ -1,7 +1,7 @@
 /**
  * method to separate bits from a given integer 2 positions apart
  *
- * @example when input is ABC, output bits are A0B0C
+ * @example when input is ABC, output bits are 0A0B0C
  * @see https://github.com/Forceflow/libmorton/blob/234a443ca8e2c64f6385f1a9d6ee10a70d08a3fa/include/libmorton/morton2D.h#L99
  * @param {number} a
  * @returns {number}

package/src/core/geom/3d/morton/split_by_2.js

@@ -1,7 +1,7 @@
 /**
  * method to separate bits from a given integer 2 positions apart
  *
- * @example when input is ABC, output bits are A0B0C
+ * @example when input is ABC, output bits are 0A0B0C
  * @see https://github.com/Forceflow/libmorton/blob/234a443ca8e2c64f6385f1a9d6ee10a70d08a3fa/include/libmorton/morton2D.h#L99
  * @param {number} a
  * @returns {number}

package/src/core/geom/3d/morton/split_by_3.d.ts

@@ -2,7 +2,7 @@
  * method to separate bits from a given integer 3 positions apart
  * we only look at the first 10 bits
  *
- * @example when input is ABC, output bits are A00B00C
+ * @example when input is ABC, output bits are 00A00B00C
  * @param {number} a
  * @returns {number}
  */

package/src/core/geom/3d/morton/split_by_3.js

@@ -2,7 +2,7 @@
  * method to separate bits from a given integer 3 positions apart
  * we only look at the first 10 bits
  *
- * @example when input is ABC, output bits are A00B00C
+ * @example when input is ABC, output bits are 00A00B00C
  * @param {number} a
  * @returns {number}
  */

package/src/core/geom/3d/topology/struct/binary/BinaryElementPool.d.ts

@@ -70,6 +70,13 @@ export class BinaryElementPool {
      * @return {number}
      */
     element_address(id: number): number;
+    /**
+     * Returns word-offset of element
+     * Word size is 4, so this is the same as `element_address(id) / 4`
+     * @param {number} id
+     * @return {number}
+     */
+    element_word(id: number): number;
     /**
      * Used alongside iterators to check if element is actually allocated or not
      * @param {number} id

package/src/core/geom/3d/topology/struct/binary/BinaryElementPool.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BinaryElementPool.d.ts","sourceRoot":"","sources":["../../../../../../../../src/core/geom/3d/topology/struct/binary/BinaryElementPool.js"],"names":[],"mappings":"AAoCA;;GAEG;AACH;IAEI;;;;OAIG;IACH,uBAHW,MAAM,qBACN,MAAM,EA0ChB;IApCG;;;;OAIG;IACH,oBAA4B;IAE5B;;;;OAIG;IACH,eAAgB;IAEhB;;;;;OAKG;IACH,uBAAuB;IAEvB,2BAA2E;IAC3E,yBAAsD;IACtD,2BAAwD;IACxD,6BAA0D;IAC1D,oBAAiD;IAEjD,mBAAkC;IAElC;;;;OAIG;IACH,eAAe;IAGnB;;;;OAIG;IACH,mBAEC;IAED;;;OAGG;IACH,uBAEC;IAED;;;OAGG;IACH,+BAEC;IAED;;;OAGG;IACH,iCAEC;IAED;;OAEG;IACH,aAEC;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACL,MAAM,CAMjB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACL,OAAO,CAoBlB;IAED;;;;OAIG;IACH,uBAsBC;IAED;;;;OAIG;IACH,wBAQC;IAED;;;OAGG;IACH,0BAFW,MAAM,QAMhB;IAGD;;;OAGG;IACH,YAFY,MAAM,CAqBjB;IAED;;;;OAIG;IACH,2BAHW,MAAM,GACL,MAAM,CAcjB;IAED;;;;OAIG;IACH,YAFW,MAAM,QAYhB;IAED;;OAEG;IACH,cAGC;CACJ"}
+{"version":3,"file":"BinaryElementPool.d.ts","sourceRoot":"","sources":["../../../../../../../../src/core/geom/3d/topology/struct/binary/BinaryElementPool.js"],"names":[],"mappings":"AAwBA;;GAEG;AACH;IAEI;;;;OAIG;IACH,uBAHW,MAAM,qBACN,MAAM,EA0ChB;IApCG;;;;OAIG;IACH,oBAA4B;IAE5B;;;;OAIG;IACH,eAAgB;IAEhB;;;;;OAKG;IACH,uBAAuB;IAEvB,2BAA2E;IAC3E,yBAAsD;IACtD,2BAAwD;IACxD,6BAA0D;IAC1D,oBAAiD;IAEjD,mBAAkC;IAElC;;;;OAIG;IACH,eAAe;IAGnB;;;;OAIG;IACH,mBAEC;IAED;;;OAGG;IACH,uBAEC;IAED;;;OAGG;IACH,+BAEC;IAED;;;OAGG;IACH,iCAEC;IAED;;OAEG;IACH,aAEC;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACL,MAAM,CAMjB;IAED;;;;;OAKG;IACH,iBAHW,MAAM,GACL,MAAM,CAIjB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACL,OAAO,CAsBlB;IAED;;;;OAIG;IACH,uBAsBC;IAED;;;;OAIG;IACH,wBAQC;IAED;;;OAGG;IACH,0BAFW,MAAM,QAMhB;IAGD;;;OAGG;IACH,YAFY,MAAM,CAqBjB;IAED;;;;OAIG;IACH,2BAHW,MAAM,GACL,MAAM,CAcjB;IAED;;;;OAIG;IACH,YAFW,MAAM,QAYhB;IAED;;OAEG;IACH,cAGC;CACJ"}

package/src/core/geom/3d/topology/struct/binary/BinaryElementPool.js

@@ -1,6 +1,7 @@
-import { max3 } from "../../../../../math/max3.js";
 import { assert } from "../../../../../assert.js";
+import { align_4 } from "../../../../../binary/align_4.js";
 import { typed_array_copy } from "../../../../../collection/array/typed/typed_array_copy.js";
+import { max3 } from "../../../../../math/max3.js";
 
 /**
  * How many items to reserve by default
@@ -21,19 +22,6 @@ const CAPACITY_GROW_MULTIPLIER = 1.2;
  */
 const CAPACITY_GROW_MIN_STEP = 32;
 
-/**
- * Align on 4 byte boundary
- * @param {number} n
- * @return {number}
- */
-function align_4(n) {
-    const result = ((n + 0x3) >> 2) << 2;
-
-    assert.greaterThanOrEqual(result, n, 'aligned result must be >= input');
-
-    return result;
-}
-
 /**
  * @see https://github.com/blender/blender/blob/master/source/blender/blenlib/intern/BLI_mempool.c
  */
@@ -137,12 +125,24 @@ export class BinaryElementPool {
         return this.__item_size * id;
     }
 
+    /**
+     * Returns word-offset of element
+     * Word size is 4, so this is the same as `element_address(id) / 4`
+     * @param {number} id
+     * @return {number}
+     */
+    element_word(id) {
+        return this.element_address(id) >> 2;
+    }
+
     /**
      * Used alongside iterators to check if element is actually allocated or not
      * @param {number} id
      * @return {boolean}
      */
     is_allocated(id) {
+        assert.isNonNegativeInteger(id, 'id');
+
         if (id >= this.__size) {
             // ID is past allocated region
             return false;