@woosh/meep-engine 2.119.16 → 2.119.19

package/src/engine/intelligence/behavior/ecs/BehaviorComponent.js

@@ -1,31 +1,28 @@
 import { assert } from "../../../../core/assert.js";
-import { ClockChannelType } from "./ClockChannelType.js";
 import { RepeatBehavior } from "../decorator/RepeatBehavior.js";
 import { ActionBehavior } from "../primitive/ActionBehavior.js";
-import { SequenceBehavior } from "../composite/SequenceBehavior.js";
+import { ClockChannelType } from "./ClockChannelType.js";
 
 export class BehaviorComponent {
-    constructor() {
-
-        /**
-         * What clock should be used for ticking associated behavior
-         * @type {ClockChannelType|number}
-         */
-        this.clock = ClockChannelType.Simulation;
-
-        /**
-         *
-         * @type {number}
-         */
-        this.flags = 0;
-
-        /**
-         *
-         * @type {Behavior|null}
-         * @private
-         */
-        this.__behavior = null;
-    }
+
+    /**
+     * What clock should be used for ticking associated behavior
+     * @type {ClockChannelType|number}
+     */
+    clock = ClockChannelType.Simulation;
+
+    /**
+     *
+     * @type {number}
+     */
+    flags = 0;
+
+    /**
+     *
+     * @type {Behavior|null}
+     * @private
+     */
+    __behavior = null;
 
     /**
      *
@@ -83,35 +80,6 @@ export class BehaviorComponent {
         this.__behavior = v;
     }
 
-    /**
-     * @deprecated
-     * @returns {Readonly<Behavior[]>}
-     */
-    get list() {
-        if (this.__behavior !== null) {
-            return [this.__behavior];
-        } else {
-            return [];
-        }
-    }
-
-    /**
-     * @deprecated
-     * @param {Behavior[]} v
-     */
-    set list(v) {
-        console.warn('.list is deprecated, use SequenceBehavior instead');
-        if (v.length > 1) {
-            console.warn('.list is deprecated, converting to sequence instead');
-            this.__behavior = SequenceBehavior.from(v);
-        } else if (v.length === 1) {
-            this.__behavior = v[0];
-        } else {
-            this.__behavior = null;
-        }
-    }
-
-
     /**
      *
      * @param {function(timeDelta:number)} f
@@ -130,8 +98,8 @@ export class BehaviorComponent {
      * @returns {BehaviorComponent}
      */
     static fromOne(b) {
-        assert.defined(b,  'behavior');
-        assert.notNull(b,  'behavior');
+        assert.defined(b, 'behavior');
+        assert.notNull(b, 'behavior');
         assert.equal(b.isBehavior, true, 'b.isBehavior !== true');
 
         const result = new BehaviorComponent();

package/src/engine/intelligence/behavior/ecs/DieBehavior.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"DieBehavior.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/intelligence/behavior/ecs/DieBehavior.js"],"names":[],"mappings":"AAGA;IAGI,6BAEC;IAED,qCAcC;CACJ;+BAzB8B,qBAAqB;+BACrB,sBAAsB"}
+{"version":3,"file":"DieBehavior.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/intelligence/behavior/ecs/DieBehavior.js"],"names":[],"mappings":"AAGA;IAGI,6BAEC;IAED,qCASC;CACJ;+BAnB8B,qBAAqB;+BADrB,sBAAsB"}

package/src/engine/intelligence/behavior/ecs/DieBehavior.js

@@ -1,5 +1,5 @@
-import { EntityBehavior } from "./EntityBehavior.js";
 import { BehaviorStatus } from "../BehaviorStatus.js";
+import { EntityBehavior } from "./EntityBehavior.js";
 
 export class DieBehavior extends EntityBehavior {
 
@@ -13,14 +13,9 @@ export class DieBehavior extends EntityBehavior {
         const entity = this.entity;
         const ecd = this.ecd;
 
-        if (!ecd.entityExists(entity)) {
-            //entity doesn't exist, count as success
-
-            return BehaviorStatus.Succeeded;
-        }
-
         ecd.removeEntity(entity);
 
         return BehaviorStatus.Succeeded;
+
     }
 }

package/src/engine/intelligence/behavior/ecs/SendEventBehavior.d.ts

@@ -1,5 +1,9 @@
 export class SendEventBehavior extends EntityBehavior {
     static fromJSON(j: any): SendEventBehavior;
+    /**
+     * ID of the event
+     * @type {string}
+     */
     event: string;
     data: {};
     target: number;

package/src/engine/intelligence/behavior/ecs/SendEventBehavior.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"SendEventBehavior.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/intelligence/behavior/ecs/SendEventBehavior.js"],"names":[],"mappings":"AAIA;IAiBI,2CAMC;IAnBG,cAAe;IACf,SAAc;IACd,eAAgB;IAGpB;;;;aAMC;IAcD,qCAQC;CACJ;+BAxC8B,qBAAqB;+BADrB,sBAAsB"}
+{"version":3,"file":"SendEventBehavior.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/intelligence/behavior/ecs/SendEventBehavior.js"],"names":[],"mappings":"AAIA;IAkBI,2CAMC;IAtBD;;;OAGG;IACH,OAFU,MAAM,CAEL;IACX,SAAU;IACV,eAAY;IAEZ;;;;aAMC;IAcD,qCAQC;CACJ;+BAzC8B,qBAAqB;+BADrB,sBAAsB"}

package/src/engine/intelligence/behavior/ecs/SendEventBehavior.js

@@ -3,16 +3,17 @@ import { BehaviorStatus } from "../BehaviorStatus.js";
 import { EntityBehavior } from "./EntityBehavior.js";
 
 export class SendEventBehavior extends EntityBehavior {
-    constructor() {
-        super();
 
-        this.event = "";
-        this.data = {};
-        this.target = -1;
-    }
+    /**
+     * ID of the event
+     * @type {string}
+     */
+    event = "";
+    data = {};
+    target = -1;
 
     fromJSON({ event, data = {}, target = -1 }) {
-        assert.typeOf(event, 'string', 'event');
+        assert.isString(event, 'event');
 
         this.event = event;
         this.data = data;

package/src/engine/intelligence/behavior/ecs/WaitForEventBehavior.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"WaitForEventBehavior.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/intelligence/behavior/ecs/WaitForEventBehavior.js"],"names":[],"mappings":"AAIA;IA8BI;;;;OAIG;IACH,4BAFY,oBAAoB,CAQ/B;IArCG;;;OAGG;IACH,OAFU,MAAM,CAED;IAEf;;;OAGG;IACH,UAFU,OAAO,CAEI;IAErB;;;OAGG;IACH,QAFU,MAAM,CAEA;IAGpB;;;aAKC;IAeD,wEAMC;IAED;;OAEG;IACH,iBAIC;CAoBJ;;kBAIS,MAAM;;+BAtFe,qBAAqB;+BACrB,sBAAsB"}
+{"version":3,"file":"WaitForEventBehavior.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/intelligence/behavior/ecs/WaitForEventBehavior.js"],"names":[],"mappings":"AAIA;IA6BI;;;;OAIG;IACH,4BAFY,oBAAoB,CAQ/B;IArCD;;;OAGG;IACH,OAFU,MAAM,CAEL;IAEX;;;OAGG;IACH,UAFU,OAAO,CAEA;IAEjB;;;OAGG;IACH,QAFU,MAAM,CAEJ;IAGZ;;;aAKC;IAeD,wEAMC;IAED;;OAEG;IACH,iBAIC;CAoBJ;;kBAIS,MAAM;;+BAnFe,qBAAqB;+BADrB,sBAAsB"}

package/src/engine/intelligence/behavior/ecs/WaitForEventBehavior.js

@@ -1,29 +1,28 @@
-import { EntityBehavior } from "./EntityBehavior.js";
-import { BehaviorStatus } from "../BehaviorStatus.js";
 import { assert } from "../../../../core/assert.js";
+import { BehaviorStatus } from "../BehaviorStatus.js";
+import { EntityBehavior } from "./EntityBehavior.js";
 
 export class WaitForEventBehavior extends EntityBehavior {
-    constructor() {
-        super();
-
-        /**
-         * Event name
-         * @type {string}
-         */
-        this.event = "";
-
-        /**
-         *
-         * @type {boolean}
-         */
-        this.detected = false;
 
-        /**
-         * Entity to listen event on
-         * @type {number}
-         */
-        this.target = -1;
-    }
+
+    /**
+     * Event name
+     * @type {string}
+     */
+    event = "";
+
+    /**
+     *
+     * @type {boolean}
+     */
+    detected = false;
+
+    /**
+     * Entity to listen event on
+     * @type {number}
+     */
+    target = -1;
+
 
     fromJSON({ event, target = -1 }) {
         assert.isString(event, 'event');

package/src/core/bvh2/bvh3/query/cache/BVH_QUERY_CACHE_SIZE.d.ts

@@ -1,2 +0,0 @@
-export const BVH_QUERY_CACHE_SIZE: number;
-//# sourceMappingURL=BVH_QUERY_CACHE_SIZE.d.ts.map

package/src/core/bvh2/bvh3/query/cache/BVH_QUERY_CACHE_SIZE.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"BVH_QUERY_CACHE_SIZE.d.ts","sourceRoot":"","sources":["../../../../../../../src/core/bvh2/bvh3/query/cache/BVH_QUERY_CACHE_SIZE.js"],"names":[],"mappings":"AAAA,0CAA0C"}

package/src/core/bvh2/bvh3/query/cache/BVH_QUERY_CACHE_SIZE.js

@@ -1 +0,0 @@
-export const BVH_QUERY_CACHE_SIZE = 2**12;

package/src/core/bvh2/bvh3/query/cache/bvh_query_cache_hash_v3.d.ts

@@ -1,9 +0,0 @@
-/**
- *
- * @param {number} x
- * @param {number} y
- * @param {number} z
- * @returns {number}
- */
-export function bvh_query_cache_hash_v3(x: number, y: number, z: number): number;
-//# sourceMappingURL=bvh_query_cache_hash_v3.d.ts.map

package/src/core/bvh2/bvh3/query/cache/bvh_query_cache_hash_v3.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bvh_query_cache_hash_v3.d.ts","sourceRoot":"","sources":["../../../../../../../src/core/bvh2/bvh3/query/cache/bvh_query_cache_hash_v3.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,2CALW,MAAM,KACN,MAAM,KACN,MAAM,GACJ,MAAM,CAuBlB"}

package/src/core/bvh2/bvh3/query/cache/bvh_query_cache_hash_v3.js

@@ -1,31 +0,0 @@
-import { BVH_QUERY_CACHE_SIZE } from "./BVH_QUERY_CACHE_SIZE.js";
-
-/**
- *
- * @param {number} x
- * @param {number} y
- * @param {number} z
- * @returns {number}
- */
-export function bvh_query_cache_hash_v3(x, y, z) {
-
-    //
-    // const i0 = computeHashFloat(x);
-    // const i1 = computeHashFloat(y);
-    // const i2 = computeHashFloat(z);
-    //
-    // const key = ((i0 * 0xB5297A4D) ^ (i1 * 0x68E31DA4) ^ (i2 * 0x1B56C4E9))
-    //     & (BVH_QUERY_CACHE_SIZE - 1);
-
-    const s = 16;
-
-    const i0 = x*s;
-    const i1 = y*s;
-    const i2 = z*s;
-
-    const key = ((i0 * 73856093) ^ (i1 * 19349663) ^ (i2 * 83492791))
-        & (BVH_QUERY_CACHE_SIZE - 1);
-
-    // convert to unsigned
-    return key >>> 0;
-}

package/src/core/geom/2d/lt-grid/LooseTightGrid.d.ts

@@ -1,55 +0,0 @@
-/**
- *
- *  NOTE: THIS CODE IS UNFINISHED, IT IS ONLY A SKETCH
- *  TODO finish implementation
- *
- * Inspired by Makyen's post on stackoverflow: https://stackoverflow.com/a/48384354
- * Core idea is to have dynamically-sized bounding volumes that contain our AABBs, and then have a grid-aligned index that stores pointers to these volumes
- * Makyren called it "Loose/Tight Double-Grid", where "loose" refers to dynamic bounding volumes and tight refers to the grid
- *
- * Invariants:
- *  - An element inserted into the structure will belong to exactly one "loose" cell
- *
- */
-export class LooseTightGrid {
-    /**
-     *
-     * @param {number} v
-     */
-    set grid_scale(arg: number);
-    /**
-     *
-     * @returns {number}
-     */
-    get grid_scale(): number;
-    /**
-     *
-     * @param {number} size_x
-     * @param {number} size_y
-     */
-    resize(size_x: number, size_y: number): void;
-    /**
-     *
-     * @param {number} x
-     * @param {number} y
-     * @returns {number}
-     */
-    cell_position_to_index(x: number, y: number): number;
-    /**
-     *
-     * @param {number[]} out
-     * @param {number} out_offset
-     * @param {number} index
-     */
-    cell_index_to_position(out: number[], out_offset: number, index: number): void;
-    allocate_datum(): void;
-    insert(): void;
-    /**
-     * Rebuild structure from ground-up
-     * This is an expensive operation
-     * Generally you'll never want to call it explicitly, it is used internally when underlying structure changes
-     */
-    rebuild(): void;
-    #private;
-}
-//# sourceMappingURL=LooseTightGrid.d.ts.map

package/src/core/geom/2d/lt-grid/LooseTightGrid.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"LooseTightGrid.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/lt-grid/LooseTightGrid.js"],"names":[],"mappings":"AAiBA;;;;;;;;;;;;GAYG;AACH;IAcI;;;OAGG;IACH,4BAYC;IAED;;;OAGG;IACH,yBAEC;IAED;;;;OAIG;IACH,eAHW,MAAM,UACN,MAAM,QAehB;IAED;;;;;OAKG;IACH,0BAJW,MAAM,KACN,MAAM,GACJ,MAAM,CAUlB;IAED;;;;;OAKG;IACH,4BAJW,MAAM,EAAE,cACR,MAAM,SACN,MAAM,QAOhB;IAED,uBAEC;IAED,eAEC;IAwDD;;;;OAIG;IACH,gBAgCC;;CAEJ"}

package/src/core/geom/2d/lt-grid/LooseTightGrid.js

@@ -1,221 +0,0 @@
-import { assert } from "../../../assert.js";
-import { de_interleave_2_bits } from "../../../binary/de_interleave_2_bits.js";
-import { split_by_2 } from "../../../binary/split_by_2.js";
-import { UINT32_MAX } from "../../../binary/UINT32_MAX.js";
-import { SCRATCH_UINT32_TRAVERSAL_STACK } from "../../../collection/SCRATCH_UINT32_TRAVERSAL_STACK.js";
-import { BinaryElementPool } from "../../3d/topology/struct/binary/BinaryElementPool.js";
-
-const NULL_POINTER = UINT32_MAX;
-
-const COLUMN_PARENT = 0;
-const COLUMN_CHILD_1 = 1;
-const COLUMN_CHILD_2 = 2;
-const COLUMN_HEIGHT = 3;
-const COLUMN_AABB_OFFSET = 4;
-
-const COLUMN_USER_DATA = COLUMN_CHILD_2;
-
-/**
- *
- *  NOTE: THIS CODE IS UNFINISHED, IT IS ONLY A SKETCH
- *  TODO finish implementation
- *
- * Inspired by Makyen's post on stackoverflow: https://stackoverflow.com/a/48384354
- * Core idea is to have dynamically-sized bounding volumes that contain our AABBs, and then have a grid-aligned index that stores pointers to these volumes
- * Makyren called it "Loose/Tight Double-Grid", where "loose" refers to dynamic bounding volumes and tight refers to the grid
- *
- * Invariants:
- *  - An element inserted into the structure will belong to exactly one "loose" cell
- *
- */
-export class LooseTightGrid {
-
-    #resolution_x = 0
-    #resolution_y = 0
-
-    // amount of space covered by a single grid cell
-    #grid_scale = 1
-
-    #node_pool = new BinaryElementPool(10 * 4)
-    #grid_data = new Uint32Array(0);
-
-    constructor() {
-    }
-
-    /**
-     *
-     * @param {number} v
-     */
-    set grid_scale(v) {
-        assert.isNumber(v, 'v');
-        assert.greaterThan(v, 0, 'v');
-
-        if (this.#grid_scale === v) {
-            // no change
-            return;
-        }
-
-        this.#grid_scale = v;
-
-        this.rebuild();
-    }
-
-    /**
-     *
-     * @returns {number}
-     */
-    get grid_scale() {
-        return this.#grid_scale;
-    }
-
-    /**
-     *
-     * @param {number} size_x
-     * @param {number} size_y
-     */
-    resize(size_x, size_y) {
-        assert.isNonNegativeInteger(size_x, 'size_x');
-        assert.isNonNegativeInteger(size_y, 'size_y');
-
-        if (this.#resolution_x === size_x && this.#resolution_y === size_y) {
-            // no change
-            return;
-        }
-
-        this.#resolution_x = size_x;
-        this.#resolution_y = size_y;
-
-        this.rebuild();
-    }
-
-    /**
-     *
-     * @param {number} x
-     * @param {number} y
-     * @returns {number}
-     */
-    cell_position_to_index(x, y) {
-        assert.isNonNegativeInteger(x, 'x');
-        assert.isNonNegativeInteger(y, 'y');
-
-        const _x = split_by_2(x);
-        const _y = split_by_2(y);
-
-        return _x | (_y << 1);
-    }
-
-    /**
-     *
-     * @param {number[]} out
-     * @param {number} out_offset
-     * @param {number} index
-     */
-    cell_index_to_position(out, out_offset, index) {
-
-        out[out_offset] = de_interleave_2_bits(index)
-        out[out_offset + 1] = de_interleave_2_bits(index >> 1)
-
-    }
-
-    allocate_datum() {
-
-    }
-
-    insert() {
-
-    }
-
-    /**
-     *
-     * @param {number} node
-     */
-    #node_is_leaf(node) {
-        const address = this.#node_pool.element_word(node);
-
-        return this.#node_pool.data_uint32[address + COLUMN_CHILD_1] === NULL_POINTER;
-    }
-
-    /**
-     * Collect leaves and de-allocate all intermediate nodes
-     * @param {number[]} output
-     * @param {number} output_offset
-     * @param {number} node
-     */
-    #erase_tree_structure(output, output_offset, node) {
-        const pool = this.#node_pool;
-
-        const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
-        const top = SCRATCH_UINT32_TRAVERSAL_STACK.pointer;
-
-        stack[stack.pointer++] = node;
-
-        let result_count = 0;
-
-        while (stack.pointer > top) {
-
-            stack.pointer--;
-
-            const n = stack[stack.pointer];
-
-            const node_address = pool.element_word(n);
-
-            const child_1 = pool.data_uint32[node_address + COLUMN_CHILD_1];
-            const child_2 = pool.data_uint32[node_address + COLUMN_CHILD_2];
-
-            if (child_1 === NULL_POINTER) {
-                // leaf node
-                output[output_offset + result_count] = n;
-                result_count++;
-            } else {
-                // binary node
-                stack[stack.pointer++] = child_2;
-                stack[stack.pointer++] = child_1;
-
-                // de-allocate node
-                pool.release(n);
-            }
-        }
-
-        return result_count;
-    }
-
-    /**
-     * Rebuild structure from ground-up
-     * This is an expensive operation
-     * Generally you'll never want to call it explicitly, it is used internally when underlying structure changes
-     */
-    rebuild() {
-        //TODO implement
-
-        let leaf_count = 0;
-        const leaf_nodes = [];
-        // traverse previous grid
-        for (let i = 0; i < this.#grid_data.length; i++) {
-            const node = this.#grid_data[i];
-
-            if (node === NULL_POINTER) {
-                // empty grid cell
-                continue;
-            }
-
-            leaf_count += this.#erase_tree_structure(leaf_nodes, leaf_count, node);
-        }
-
-
-        const resolution_y = this.#resolution_y;
-        const resolution_x = this.#resolution_x;
-
-        const grid_cell_count = resolution_x * resolution_y;
-
-        if (grid_cell_count !== this.#grid_data.length) {
-            this.#grid_data = new Uint32Array(grid_cell_count);
-        }
-
-        // drop all roots
-        this.#grid_data.fill(NULL_POINTER);
-
-        // re-insert all leaves
-
-    }
-
-}