@woosh/meep-engine 2.39.27 → 2.39.30

package/core/bvh2/BVHTasks.js

@@ -1,6 +1,6 @@
 import { RingBuffer } from "../collection/RingBuffer.js";
 import Task from "../process/task/Task.js";
-import TaskSignal from "../process/task/TaskSignal.js";
+import { TaskSignal } from "../process/task/TaskSignal.js";
 import { optimize } from "./transform/RotationOptimizer.js";
 
 

package/core/bvh2/aabb3/AABB3.js

@@ -14,6 +14,7 @@ import { aabb3_intersects_ray } from "./aabb3_intersects_ray.js";
 import { aabb3_compute_surface_area } from "./aabb3_compute_surface_area.js";
 import { aabb3_intersects_frustum_array } from "./aabb3_intersects_frustum_array.js";
 import { aabb3_matrix4_project } from "../../geom/3d/aabb/aabb3_matrix4_project.js";
+import { aabb3_signed_distance_sqr_to_point } from "./aabb3_signed_distance_sqr_to_point.js";
 
 
 export class AABB3 {
@@ -209,35 +210,15 @@ export class AABB3 {
      * @returns {number} Squared distance to point, value is negative if the point is inside the box
      */
     distanceToPoint2(x, y, z) {
-        const _x0 = this.x0;
-        const _y0 = this.y0;
-        const _z0 = this.z0;
-        const _x1 = this.x1;
-        const _y1 = this.y1;
-        const _z1 = this.z1;
-
-        //do projection
-        const xp0 = _x0 - x;
-        const xp1 = x - _x1;
-        const yp0 = _y0 - y;
-        const yp1 = y - _y1;
-        const zp0 = _z0 - z;
-        const zp1 = z - _z1;
-
-        //calculate separation in each axis
-        const dx = Math.max(xp0, xp1);
-        const dy = Math.max(yp0, yp1);
-        const dz = Math.max(zp0, zp1);
-
-        //straight-line distance
-        const distance2 = dx * dx + dy * dy + dz * dz;
-
-        if (dx < 0 && dy < 0 && dz < 0) {
-            //penetration
-            return -distance2;
-        } else {
-            return distance2;
-        }
+        return aabb3_signed_distance_sqr_to_point(
+            this.x0,
+            this.y0,
+            this.z0,
+            this.x1,
+            this.y1,
+            this.z1,
+            x, y, z
+        );
     }
 
     /**

package/core/bvh2/aabb3/aabb3_signed_distance_sqr_to_point.js

@@ -0,0 +1,39 @@
+import { max2 } from "../../math/max2.js";
+
+/**
+ * Compute squared distance to point, value is negative if the point is inside the box
+ * @param {number} x0
+ * @param {number} y0
+ * @param {number} z0
+ * @param {number} x1
+ * @param {number} y1
+ * @param {number} z1
+ * @param {number} point_x
+ * @param {number} point_y
+ * @param {number} point_z
+ * @returns {number}
+ */
+export function aabb3_signed_distance_sqr_to_point(x0, y0, z0, x1, y1, z1, point_x, point_y, point_z) {
+    //do projection
+    const xp0 = x0 - point_x;
+    const xp1 = point_x - x1;
+    const yp0 = y0 - point_y;
+    const yp1 = point_y - y1;
+    const zp0 = z0 - point_z;
+    const zp1 = point_z - z1;
+
+    //calculate separation in each axis
+    const dx = max2(xp0, xp1);
+    const dy = max2(yp0, yp1);
+    const dz = max2(zp0, zp1);
+
+    //straight-line distance
+    const distance_sqr = dx * dx + dy * dy + dz * dz;
+
+    if (dx < 0 && dy < 0 && dz < 0) {
+        //penetration, negative distance
+        return -distance_sqr;
+    } else {
+        return distance_sqr;
+    }
+}

package/core/bvh2/bvh3/ExplicitBinaryBoundingVolumeHierarchy.d.ts

@@ -0,0 +1,3 @@
+export class ExplicitBinaryBoundingVolumeHierarchy {
+
+}

package/core/bvh2/bvh3/ExplicitBinaryBoundingVolumeHierarchy.js

@@ -49,6 +49,12 @@ const ELEMENT_WORD_COUNT = 10;
  */
 const INITIAL_CAPACITY = 128;
 
+/**
+ *
+ * @type {number[]}
+ */
+const scratch_stack = [];
+
 /**
  * Bounding Volume Hierarchy implementation. Stores unsigned integer values at leaves, these are typically IDs or Index values.
  * Highly optimized both in terms of memory usage and CPU. Most of the code inlined. No allocation are performed during usage (except for growing the tree capacity).
@@ -874,6 +880,40 @@ export class ExplicitBinaryBoundingVolumeHierarchy {
         return iA;
     }
 
+    /**
+     * Release all nodes, this essentially resets the tree to empty state
+     */
+    release_all() {
+        let cursor = 0;
+        const stack = scratch_stack;
+
+        const root = this.__root;
+
+        if (root !== NULL_NODE) {
+            stack[cursor++] = root;
+        }
+
+        const uint32 = this.__data_uint32;
+
+        while (cursor > 0) {
+            cursor--;
+
+            const node = stack[cursor];
+
+            const node_address = node * ELEMENT_WORD_COUNT;
+
+            const child1 = uint32[node_address + COLUMN_CHILD_1];
+            const child2 = uint32[node_address + COLUMN_CHILD_2];
+
+            if (child1 !== NULL_NODE) {
+                stack[cursor++] = child2;
+                stack[cursor++] = child1;
+            }
+
+            this.release_node(node);
+        }
+    }
+
     /**
      *
      * @param {(node:number, tree:ExplicitBinaryBoundingVolumeHierarchy)=>void} callback

package/core/bvh2/bvh3/bvh_query_user_data_generic.js

@@ -46,7 +46,7 @@ export function bvh_query_user_data_generic(
          */
         const node = traversal_stack[traversal_cursor];
 
-        // test node against the ray
+        // test node against the query
         const pass = query.evaluate(node, bvh);
 
         if (!pass) {

package/core/bvh2/bvh3/bvh_query_user_data_nearest_to_point.js

@@ -0,0 +1,96 @@
+import { NULL_NODE } from "./ExplicitBinaryBoundingVolumeHierarchy.js";
+import { aabb3_signed_distance_sqr_to_point } from "../aabb3/aabb3_signed_distance_sqr_to_point.js";
+import { max2 } from "../../math/max2.js";
+
+/**
+ *
+ * @type {number[]}
+ */
+const traversal_stack = [];
+
+/**
+ *
+ * @type {number[]}
+ */
+const scratch_aabb = [];
+
+/**
+ *
+ * @type {number}
+ */
+let traversal_cursor = 0;
+
+/**
+ *
+ * @param {ExplicitBinaryBoundingVolumeHierarchy} bvh
+ * @param {number} x
+ * @param {number} y
+ * @param {number} z
+ * @param {number} [max_distance=Infinity] how far to search
+ * @returns {number} user data of the leaf, or -1 if not found
+ */
+export function bvh_query_user_data_nearest_to_point(bvh, x, y, z, max_distance = Infinity) {
+    const stack_frame_address = traversal_cursor;
+
+    const root = bvh.root;
+
+    if (root === NULL_NODE) {
+        return -1;
+    }
+
+    traversal_stack[traversal_cursor++] = root;
+
+    let best_leaf_data = -1;
+    let best_distance = max_distance;
+
+    while (traversal_cursor > stack_frame_address) {
+        traversal_cursor--;
+
+        /**
+         *
+         * @type {number}
+         */
+        const node = traversal_stack[traversal_cursor];
+
+        bvh.node_get_aabb(node, scratch_aabb);
+
+        // compute distance to box
+        const distance = max2(0, aabb3_signed_distance_sqr_to_point(
+            scratch_aabb[0], scratch_aabb[1], scratch_aabb[2],
+            scratch_aabb[3], scratch_aabb[4], scratch_aabb[5],
+            x, y, z
+        ));
+
+        if (distance > best_distance) {
+            // node is too far
+            continue;
+        }
+
+        const node_is_leaf = bvh.node_is_leaf(node);
+
+        if (!node_is_leaf) {
+
+            // read in-order
+            const child1 = bvh.node_get_child1(node);
+            const child2 = bvh.node_get_child2(node);
+
+            // write to stack in reverse order, so that fist child ends up being visited first
+            traversal_stack[traversal_cursor++] = child1;
+            traversal_stack[traversal_cursor++] = child2;
+
+        } else {
+
+            // leaf node
+            if (distance < best_distance) {
+                best_distance = distance;
+                best_leaf_data = bvh.node_get_user_data(node);
+            }
+
+        }
+    }
+
+    // drop stack frame
+    traversal_cursor = stack_frame_address;
+
+    return best_leaf_data;
+}

package/core/process/executor/ConcurrentExecutor.js

@@ -5,7 +5,7 @@ import { assert } from "../../assert.js";
 import Signal from "../../events/signal/Signal.js";
 import { IllegalStateException } from "../../fsm/exceptions/IllegalStateException.js";
 import { objectKeyByValue } from "../../model/object/objectKeyByValue.js";
-import TaskSignal from "../task/TaskSignal.js";
+import { TaskSignal } from "../task/TaskSignal.js";
 import TaskState from "../task/TaskState.js";
 import { clamp } from "../../math/clamp.js";
 

package/core/process/executor/ConcurrentExecutor.spec.js

@@ -1,7 +1,7 @@
 import { jest } from "@jest/globals";
 import Task from "../task/Task.js"
 import TaskGroup from "../task/TaskGroup.js";
-import TaskSignal from "../task/TaskSignal.js";
+import { TaskSignal } from "../task/TaskSignal.js";
 import TaskState from "../task/TaskState.js";
 import { emptyTask, failingTask } from "../task/TaskUtils.js";
 import ConcurrentExecutor from "./ConcurrentExecutor.js";

package/core/process/task/Task.d.ts

@@ -1,5 +1,15 @@
 import {ITask} from "./ITask";
+import {TaskSignal} from "./TaskSignal";
 
 export default class Task extends ITask {
-    readonly isTask:boolean
+    constructor(opt: {
+        name: string,
+        initializer?: () => any,
+        cycleFunction: () => TaskSignal,
+        computeProgress?: () => number
+        dependencies?: ITask[],
+        estimatedDuration?: number
+    })
+
+    readonly isTask: boolean
 }

package/core/process/task/Task.js

@@ -7,7 +7,7 @@ import { assert } from "../../assert.js";
 import Signal from "../../events/signal/Signal.js";
 import { noop, returnZero } from "../../function/Functions.js";
 import ObservedInteger from "../../model/ObservedInteger.js";
-import TaskSignal from "./TaskSignal.js";
+import { TaskSignal } from "./TaskSignal.js";
 import TaskState from "./TaskState.js";
 
 

package/core/process/task/TaskGroup.d.ts

@@ -1,5 +1,5 @@
 import {ITask} from "./ITask";
 
-export default class TaskGroup extends ITask{
-
+export default class TaskGroup extends ITask {
+    constructor(subtasks: ITask[], name?: string)
 }

package/core/process/task/TaskSignal.d.ts

@@ -0,0 +1,6 @@
+export enum TaskSignal{
+    EndSuccess,
+    EndFailure,
+    Continue,
+    Yield
+}

package/core/process/task/TaskSignal.js

@@ -7,11 +7,9 @@
  * @readonly
  * @enum {number}
  */
-const TaskSignal = {
+export const TaskSignal = {
     EndSuccess: 0,
     EndFailure: 1,
     Continue: 2,
     Yield: 3
 };
-
-export default TaskSignal;

package/core/process/task/TaskUtils.js

@@ -4,7 +4,7 @@
 import { randomizeArrayElementOrder } from "../../collection/ArrayUtils.js";
 import { seededRandom } from "../../math/random/seededRandom.js";
 import Task from "./Task.js";
-import TaskSignal from "./TaskSignal.js";
+import { TaskSignal } from "./TaskSignal.js";
 import { clamp01 } from "../../math/clamp01.js";
 
 /**

package/editor/process/symbolic/makeGridPositionSymbolDisplay.js

@@ -1,7 +1,7 @@
 import { max2 } from "../../../core/math/max2.js";
 import { min2 } from "../../../core/math/min2.js";
 import Task from "../../../core/process/task/Task.js";
-import TaskSignal from "../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../core/process/task/TaskSignal.js";
 import EntityBuilder from "../../../engine/ecs/EntityBuilder.js";
 import { BufferGeometry, Float32BufferAttribute, Line, LineBasicMaterial } from "three";
 import Renderable from "../../../engine/ecs/components/Renderable.js";

package/editor/tools/paint/prototypeTerrainEditor.js

@@ -13,7 +13,6 @@ import { TerrainLayer } from "../../../engine/ecs/terrain/ecs/layers/TerrainLaye
 import Terrain from "../../../engine/ecs/terrain/ecs/Terrain.js";
 import Vector3 from "../../../core/geom/Vector3.js";
 import { BlenderCameraOrientationGizmo } from "../v2/BlenderCameraOrientationGizmo.js";
-import Quaternion from "../../../core/geom/Quaternion.js";
 import { Transform } from "../../../engine/ecs/transform/Transform.js";
 import TopDownCameraController from "../../../engine/graphics/ecs/camera/topdown/TopDownCameraController.js";
 

package/engine/ecs/foliage/ecs/InstancedMeshUtils.js

@@ -6,7 +6,7 @@ import { InstancedMeshComponent } from "./InstancedMeshComponent.js";
 import { InstancedFoliage } from "../InstancedFoliage.js";
 import { buildTreeOptimizationTask } from "../../../../core/bvh2/BVHTasks.js";
 import Task from "../../../../core/process/task/Task.js";
-import TaskSignal from "../../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../../core/process/task/TaskSignal.js";
 import { countTask, promiseTask } from "../../../../core/process/task/TaskUtils.js";
 import { assert } from "../../../../core/assert.js";
 import { InstancedMeshLayer } from "./InstancedMeshLayer.js";

package/engine/ecs/storage/BinaryBufferDeSerializer.js

@@ -1,6 +1,6 @@
 import { emptyTask } from "../../../core/process/task/TaskUtils.js";
 import Task from "../../../core/process/task/Task.js";
-import TaskSignal from "../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../core/process/task/TaskSignal.js";
 import { assert } from "../../../core/assert.js";
 import { BinaryCollectionDeSerializer } from "./binary/collection/BinaryCollectionDeSerializer.js";
 import { BinaryObjectSerializationAdapter } from "./binary/object/BinaryObjectSerializationAdapter.js";

package/engine/ecs/terrain/ecs/splat/SplatMapOptimizer.js

@@ -7,7 +7,7 @@ import { validateGraphColoring } from "../../../../../core/graph/coloring/valida
 import ConcurrentExecutor from "../../../../../core/process/executor/ConcurrentExecutor.js";
 import Task from "../../../../../core/process/task/Task.js";
 import { actionTask, countTask } from "../../../../../core/process/task/TaskUtils.js";
-import TaskSignal from "../../../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../../../core/process/task/TaskSignal.js";
 
 /**
  * We convert splat mapping into a graph of connecting material patches and solve the overlaps as a "Graph Coloring" problem

package/engine/ecs/terrain/util/loadVisibleTerrainTiles.js

@@ -4,7 +4,7 @@ import { obtainTerrain } from "./obtainTerrain.js";
 import { assert } from "../../../../core/assert.js";
 import TerrainSystem from "../ecs/TerrainSystem.js";
 import Task from "../../../../core/process/task/Task.js";
-import TaskSignal from "../../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../../core/process/task/TaskSignal.js";
 
 /**
  *

package/engine/graphics/ecs/compileAllMaterials.js

@@ -1,6 +1,6 @@
 import { Mesh, PlaneBufferGeometry } from "three";
 import Task from "../../../core/process/task/Task.js";
-import TaskSignal from "../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../core/process/task/TaskSignal.js";
 import { collectIteratorValueToArray } from "../../../core/collection/IteratorUtils.js";
 import { clamp01 } from "../../../core/math/clamp01.js";
 

package/engine/graphics/ecs/mesh/createTaskWaitForMeshesToLoad.js

@@ -1,7 +1,7 @@
 import { max2 } from "../../../../core/math/max2.js";
 import Mesh from "./Mesh.js";
 import Task from "../../../../core/process/task/Task.js";
-import TaskSignal from "../../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../../core/process/task/TaskSignal.js";
 import { assert } from "../../../../core/assert.js";
 import { assetTypeByPath } from "./assetTypeByPath.js";
 import { collectIteratorValueToArray } from "../../../../core/collection/IteratorUtils.js";

package/engine/graphics/ecs/mesh-v2/ShadedGeometrySystem.d.ts

@@ -2,10 +2,13 @@ import {System} from "../../../ecs/System";
 import Engine from "../../../Engine";
 import {ShadedGeometry} from "./ShadedGeometry";
 import {SurfacePoint3} from "../../../../core/geom/3d/SurfacePoint3";
+import {ExplicitBinaryBoundingVolumeHierarchy} from "../../../../core/bvh2/bvh3/ExplicitBinaryBoundingVolumeHierarchy";
 
 export class ShadedGeometrySystem extends System<ShadedGeometry> {
     constructor(engine: Engine)
 
+    readonly bvh: ExplicitBinaryBoundingVolumeHierarchy
+
     raycastNearest(
         contact: SurfacePoint3,
         origin_x: number, origin_y: number, origin_z: number,

package/engine/graphics/ecs/mesh-v2/ShadedGeometrySystem.js

@@ -15,7 +15,7 @@ import { bvh_query_leaves_generic } from "../../../../core/bvh2/bvh3/bvh_query_l
 import { BVHQueryIntersectsRay } from "../../../../core/bvh2/bvh3/query/BVHQueryIntersectsRay.js";
 import Task from "../../../../core/process/task/Task.js";
 import { RuntimeDrawMethodOptimizer } from "./render/optimization/RuntimeDrawMethodOptimizer.js";
-import TaskSignal from "../../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../../core/process/task/TaskSignal.js";
 import TaskState from "../../../../core/process/task/TaskState.js";
 import {
     bvh_query_user_data_overlaps_frustum
@@ -108,6 +108,14 @@ export class ShadedGeometrySystem extends System {
         });
     }
 
+    /**
+     *
+     * @returns {ExplicitBinaryBoundingVolumeHierarchy}
+     */
+    get bvh() {
+        return this.__bvh_binary;
+    }
+
     /**
      * NOTE: DO NOT MODIFY RESULTS
      * @returns {Map<number,number>}
@@ -386,7 +394,7 @@ export class ShadedGeometrySystem extends System {
                 direction_x, direction_y, direction_z
             );
 
-            const geometry_hit_found = sg.query_raycast_nearest(scratch_point,scratch_ray_0,m4);
+            const geometry_hit_found = sg.query_raycast_nearest(scratch_point, scratch_ray_0, m4);
 
             if (!geometry_hit_found) {
                 continue;
@@ -467,7 +475,7 @@ export class ShadedGeometrySystem extends System {
                 direction_x, direction_y, direction_z
             );
 
-            const geometry_hit_found = sg.query_raycast_nearest(scratch_point,scratch_ray_0,m4);
+            const geometry_hit_found = sg.query_raycast_nearest(scratch_point, scratch_ray_0, m4);
 
             if (!geometry_hit_found) {
                 continue;

package/engine/intelligence/optimization/OptimizationTask.js

@@ -1,5 +1,5 @@
 import Task from "../../../core/process/task/Task.js";
-import TaskSignal from "../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../core/process/task/TaskSignal.js";
 
 export class OptimizationTask extends Task {
     /**

package/engine/knowledge/database/StaticKnowledgeDataTable.js

@@ -2,7 +2,7 @@ import { noop } from "../../../core/function/Functions.js";
 import { countTask } from "../../../core/process/task/TaskUtils.js";
 import Task from "../../../core/process/task/Task.js";
 import { assert } from "../../../core/assert.js";
-import TaskSignal from "../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../core/process/task/TaskSignal.js";
 
 let id_seed = 0;
 

package/generation/grid/generation/GridTaskApplyActionToCells.js

@@ -3,7 +3,7 @@ import { assert } from "../../../core/assert.js";
 import { actionTask } from "../../../core/process/task/TaskUtils.js";
 import TaskGroup from "../../../core/process/task/TaskGroup.js";
 import Task from "../../../core/process/task/Task.js";
-import TaskSignal from "../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../core/process/task/TaskSignal.js";
 
 export class GridTaskApplyActionToCells extends GridTaskGenerator {
     constructor() {

package/generation/grid/generation/GridTaskDensityMarkerDistribution.js

@@ -3,7 +3,7 @@ import { min2 } from "../../../core/math/min2.js";
 import { seededRandom } from "../../../core/math/random/seededRandom.js";
 import { GridTaskGenerator } from "../GridTaskGenerator.js";
 import Task from "../../../core/process/task/Task.js";
-import TaskSignal from "../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../core/process/task/TaskSignal.js";
 import { NumericInterval } from "../../../core/math/interval/NumericInterval.js";
 import { MarkerNodeMatcherAny } from "../../markers/matcher/MarkerNodeMatcherAny.js";
 import { assert } from "../../../core/assert.js";

package/generation/grid/generation/GridTaskExecuteRuleTimes.js

@@ -1,7 +1,7 @@
 import { seededRandom } from "../../../core/math/random/seededRandom.js";
 import { GridTaskGenerator } from "../GridTaskGenerator.js";
 import Task from "../../../core/process/task/Task.js";
-import TaskSignal from "../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../core/process/task/TaskSignal.js";
 import { BitSet } from "../../../core/binary/BitSet.js";
 import { PI_HALF } from "../../../core/math/MathUtils.js";
 import { actionTask } from "../../../core/process/task/TaskUtils.js";

package/generation/grid/generation/discrete/GridTaskConnectRooms.js

@@ -2,7 +2,7 @@ import { min2 } from "../../../../core/math/min2.js";
 import { GridTaskGenerator } from "../../GridTaskGenerator.js";
 import { BitSet } from "../../../../core/binary/BitSet.js";
 import Task from "../../../../core/process/task/Task.js";
-import TaskSignal from "../../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../../core/process/task/TaskSignal.js";
 import Vector2 from "../../../../core/geom/Vector2.js";
 import BinaryHeap from "../../../../core/collection/heap/FastBinaryHeap.js";
 import { passThrough } from "../../../../core/function/Functions.js";

package/generation/grid/generation/discrete/layer/GridTaskBuildSourceDistanceMap.js

@@ -2,7 +2,7 @@ import { actionTask, countTask } from "../../../../../core/process/task/TaskUtil
 import Task from "../../../../../core/process/task/Task.js";
 import { BitSet } from "../../../../../core/binary/BitSet.js";
 import TaskGroup from "../../../../../core/process/task/TaskGroup.js";
-import TaskSignal from "../../../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../../../core/process/task/TaskSignal.js";
 import BinaryHeap from "../../../../../core/collection/heap/FastBinaryHeap.js";
 import { GridTaskGenerator } from "../../../GridTaskGenerator.js";
 import { assert } from "../../../../../core/assert.js";

package/generation/markers/actions/MarkerNodeProcessingRuleSet.js

@@ -1,5 +1,5 @@
 import Task from "../../../core/process/task/Task.js";
-import TaskSignal from "../../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../../core/process/task/TaskSignal.js";
 import { assert } from "../../../core/assert.js";
 
 export class MarkerNodeProcessingRuleSet {

package/generation/theme/ThemeEngine.js

@@ -5,7 +5,7 @@ import { TerrainLayerRuleAggregator } from "./TerrainLayerRuleAggregator.js";
 import { actionTask, countTask, emptyTask, futureTask } from "../../core/process/task/TaskUtils.js";
 import { Sampler2D } from "../../engine/graphics/texture/sampler/Sampler2D.js";
 import Task from "../../core/process/task/Task.js";
-import TaskSignal from "../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../core/process/task/TaskSignal.js";
 import { compareNumbers } from "../../core/primitives/numbers/compareNumbers.js";
 import TaskGroup from "../../core/process/task/TaskGroup.js";
 import Future from "../../core/process/Future.js";

package/package.json

@@ -5,7 +5,7 @@
   "productName": "Meep",
   "description": "production-ready JavaScript game engine based on Entity Component System Architecture",
   "author": "Alexander Goldring",
-  "version": "2.39.27",
+  "version": "2.39.30",
   "dependencies": {
     "gl-matrix": "3.4.3",
     "fast-levenshtein": "2.0.6",

package/view/tooltip/TooltipManager.js

@@ -6,7 +6,7 @@ import EmptyView from "../elements/EmptyView.js";
 import AABB2 from "../../core/geom/AABB2.js";
 import Task from "../../core/process/task/Task.js";
 import ConcurrentExecutor from "../../core/process/executor/ConcurrentExecutor.js";
-import TaskSignal from "../../core/process/task/TaskSignal.js";
+import { TaskSignal } from "../../core/process/task/TaskSignal.js";
 import TooltipView from "./TooltipView.js";
 import { PointerDevice } from "../../engine/input/devices/PointerDevice.js";
 import List from "../../core/collection/list/List.js";