@woosh/meep-engine 2.110.13 → 2.110.15

package/src/core/geom/2d/hash-grid/SpatialHashGrid.spec.js

@@ -1,254 +0,0 @@
-import { randomFloatBetween } from "../../../math/random/randomFloatBetween.js";
-import { seededRandom } from "../../../math/random/seededRandom.js";
-import { SpatialHashGrid } from "./SpatialHashGrid.js";
-
-test("constructor does not throw", () => {
-    new SpatialHashGrid()
-});
-
-test("new grid should be empty", () => {
-    const grid = new SpatialHashGrid(1, 1);
-
-    expect(grid.is_cell_empty(0, 0)).toBe(true);
-});
-
-test("insert a small tile that fits into a single grid cell", () => {
-    const grid = new SpatialHashGrid(2, 2, 4);
-
-    const el = grid.element_allocate();
-
-    grid.element_set_user_data(el, 7);
-    grid.element_set_bounds_primitive(el, 0.5, 0.5, 1, 1);
-
-    grid.element_insert(el);
-
-    expect(grid.is_cell_empty(0, 0)).toBe(false);
-});
-
-test("insert an element that spans multiple grid cells", () => {
-
-    const grid = new SpatialHashGrid(2, 3, 4);
-
-    const el = grid.element_allocate();
-
-    grid.element_set_user_data(el, 7);
-    grid.element_set_bounds_primitive(el, 0.5, 0.5, 6, 6);
-
-    grid.element_insert(el);
-
-    expect(grid.is_cell_empty(0, 0)).toBe(false);
-    expect(grid.is_cell_empty(0, 1)).toBe(false);
-    expect(grid.is_cell_empty(1, 0)).toBe(false);
-    expect(grid.is_cell_empty(1, 1)).toBe(false);
-    expect(grid.is_cell_empty(0, 2)).toBe(true);
-    expect(grid.is_cell_empty(1, 2)).toBe(true);
-});
-
-test("remove an element that spans multiple grid cells", () => {
-
-    const grid = new SpatialHashGrid(2, 3, 4);
-
-    const el = grid.element_allocate();
-
-    grid.element_set_user_data(el, 7);
-    grid.element_set_bounds_primitive(el, 0.5, 0.5, 6, 6);
-
-    grid.element_insert(el);
-    grid.element_remove(el);
-
-    expect(grid.is_cell_empty(0, 0)).toBe(true);
-    expect(grid.is_cell_empty(0, 1)).toBe(true);
-    expect(grid.is_cell_empty(1, 0)).toBe(true);
-    expect(grid.is_cell_empty(1, 1)).toBe(true);
-    expect(grid.is_cell_empty(0, 2)).toBe(true);
-    expect(grid.is_cell_empty(1, 2)).toBe(true);
-});
-
-test("remove element from grid", () => {
-
-    const grid = new SpatialHashGrid(2, 2, 4);
-
-    const el = grid.element_allocate();
-
-    grid.element_set_user_data(el, 7);
-    grid.element_set_bounds_primitive(el, 0.5, 0.5, 1, 1);
-
-    grid.element_insert(el);
-    grid.element_remove(el);
-
-    expect(grid.is_cell_empty(0, 0)).toBe(true);
-    expect(grid.is_cell_empty(0, 1)).toBe(true);
-    expect(grid.is_cell_empty(1, 0)).toBe(true);
-    expect(grid.is_cell_empty(1, 1)).toBe(true);
-});
-
-test("add 3 element and remove in same order, expect grid to be empty", () => {
-
-    const grid = new SpatialHashGrid(2, 2, 4);
-
-    const a = grid.element_allocate();
-
-    grid.element_set_user_data(a, 3);
-    grid.element_set_bounds_primitive(a, 0.5, 0.5, 1, 1);
-
-    const b = grid.element_allocate();
-
-    grid.element_set_user_data(b, 7);
-    grid.element_set_bounds_primitive(b, 0.5, 0.5, 1, 1);
-
-    const c = grid.element_allocate();
-
-    grid.element_set_user_data(c, 11);
-    grid.element_set_bounds_primitive(c, 0.5, 0.5, 1, 1);
-
-    grid.element_insert(a);
-    grid.element_insert(b);
-    grid.element_insert(c);
-
-    grid.element_remove(a);
-    grid.element_remove(b);
-    grid.element_remove(c);
-
-    expect(grid.is_cell_empty(0, 0)).toBe(true);
-    expect(grid.is_cell_empty(0, 1)).toBe(true);
-    expect(grid.is_cell_empty(1, 0)).toBe(true);
-    expect(grid.is_cell_empty(1, 1)).toBe(true);
-});
-
-test.skip("query performance, line insertion 1m random", () => {
-    const grid = new SpatialHashGrid(100, 100, 1);
-
-    const random = seededRandom(42);
-
-    const N = 1000000;
-
-    const elements = new Uint32Array(N);
-
-    for (let i = 0; i < N; i++) {
-
-        const position_x = randomFloatBetween(random, 0, 98);
-        const position_y = randomFloatBetween(random, 0, 98);
-
-        const size_x = randomFloatBetween(random, 0.1, 2);
-        const size_y = randomFloatBetween(random, 0.1, 2);
-
-        const element = grid.element_allocate();
-
-        grid.element_set_user_data(element, i);
-        grid.element_set_bounds_primitive(element,
-            position_x,
-            position_y,
-            position_x + size_x,
-            position_y + size_y
-        );
-
-        elements[i] = element;
-    }
-
-    // perform insertion
-    const t0 = performance.now();
-
-    for (let i = 0; i < N; i++) {
-        grid.element_insert(elements[i]);
-    }
-
-    const duration = performance.now() - t0;
-
-    const duration_seconds = duration * 1e-3;
-
-    console.log(`Duration ${duration_seconds}s, ${(N / duration_seconds).toFixed(2)} records per second`);
-});
-test("remove element from grid", () => {
-
-    const grid = new SpatialHashGrid(2, 2, 4);
-
-    const el = grid.element_allocate();
-
-    grid.element_set_user_data(el, 7);
-    grid.element_set_bounds_primitive(el, 0.5, 0.5, 1, 1);
-
-    grid.element_insert(el);
-    grid.element_remove(el);
-
-    expect(grid.is_cell_empty(0, 0)).toBe(true);
-    expect(grid.is_cell_empty(0, 1)).toBe(true);
-    expect(grid.is_cell_empty(1, 0)).toBe(true);
-    expect(grid.is_cell_empty(1, 1)).toBe(true);
-});
-
-test("add 3 element and remove in same order, expect grid to be empty", () => {
-
-    const grid = new SpatialHashGrid(2, 2, 4);
-
-    const a = grid.element_allocate();
-
-    grid.element_set_user_data(a, 3);
-    grid.element_set_bounds_primitive(a, 0.5, 0.5, 1, 1);
-
-    const b = grid.element_allocate();
-
-    grid.element_set_user_data(b, 7);
-    grid.element_set_bounds_primitive(b, 0.5, 0.5, 1, 1);
-
-    const c = grid.element_allocate();
-
-    grid.element_set_user_data(c, 11);
-    grid.element_set_bounds_primitive(c, 0.5, 0.5, 1, 1);
-
-    grid.element_insert(a);
-    grid.element_insert(b);
-    grid.element_insert(c);
-
-    grid.element_remove(a);
-    grid.element_remove(b);
-    grid.element_remove(c);
-
-    expect(grid.is_cell_empty(0, 0)).toBe(true);
-    expect(grid.is_cell_empty(0, 1)).toBe(true);
-    expect(grid.is_cell_empty(1, 0)).toBe(true);
-    expect(grid.is_cell_empty(1, 1)).toBe(true);
-});
-
-test.skip("performance, insertion 1m random", () => {
-    const grid = new SpatialHashGrid(100, 100, 1);
-
-    const random = seededRandom(42);
-
-    const N = 1000000;
-
-    const elements = new Uint32Array(N);
-
-    for (let i = 0; i < N; i++) {
-
-        const position_x = randomFloatBetween(random, 0, 98);
-        const position_y = randomFloatBetween(random, 0, 98);
-
-        const size_x = randomFloatBetween(random, 0.1, 2);
-        const size_y = randomFloatBetween(random, 0.1, 2);
-
-        const element = grid.element_allocate();
-
-        grid.element_set_user_data(element, i);
-        grid.element_set_bounds_primitive(element,
-            position_x,
-            position_y,
-            position_x + size_x,
-            position_y + size_y
-        );
-
-        elements[i] = element;
-    }
-
-    // perform insertion
-    const t0 = performance.now();
-
-    for (let i = 0; i < N; i++) {
-        grid.element_insert(elements[i]);
-    }
-
-    const duration = performance.now() - t0;
-
-    const duration_seconds = duration * 1e-3;
-
-    console.log(`Duration ${duration_seconds}s, ${(N / duration_seconds).toFixed(2)} records per second`);
-});

package/src/core/geom/2d/hash-grid/shg_query_elements_circle.spec.js

@@ -1,85 +0,0 @@
-import { randomFloatBetween } from "../../../math/random/randomFloatBetween.js";
-import { seededRandom } from "../../../math/random/seededRandom.js";
-import { shg_query_elements_circle } from "./shg_query_elements_circle.js";
-import { SpatialHashGrid } from "./SpatialHashGrid.js";
-
-test.skip("performance, 10k objects, 1m queries", () => {
-    const OBJECT_COUNT = 30000;
-    const QUERY_COUNT = 1e6;
-
-    const QUERY_DISTANCE_MIN = 0.1;
-    const QUERY_DISTANCE_MAX = 0.2;
-
-    const grid = new SpatialHashGrid(128, 128, 2);
-
-    const grid_bounds_x1 = grid.size_x * grid.scale;
-    const grid_bounds_y1 = grid.size_y * grid.scale;
-
-    const random = seededRandom();
-
-    // fill
-    for (let i = 0; i < OBJECT_COUNT; i++) {
-        const el = grid.element_allocate();
-
-        grid.element_set_user_data(el, i);
-
-        const width = randomFloatBetween(random, 0.2, 1);
-        const height = randomFloatBetween(random, 0.2, 1);
-        const x0 = randomFloatBetween(random, 0, grid_bounds_x1 - width);
-        const y0 = randomFloatBetween(random, 0, grid_bounds_y1 - height);
-
-        grid.element_set_bounds_primitive(el,
-            x0,
-            y0,
-            x0 + width,
-            y0 + height
-        );
-
-        grid.element_insert(el);
-    }
-
-
-    const queries = new Float32Array(QUERY_COUNT * 3);
-
-    // build queries
-    for (let i = 0; i < QUERY_COUNT; i++) {
-
-        const offset = i * 3;
-
-        // pick radius
-        const radius = randomFloatBetween(random, QUERY_DISTANCE_MIN, QUERY_DISTANCE_MAX);
-
-        // pick starting point
-        const ax = randomFloatBetween(random, radius, grid_bounds_x1 - radius);
-        const ay = randomFloatBetween(random, radius, grid_bounds_y1 - radius);
-
-        queries[offset] = ax;
-        queries[offset + 1] = ay;
-
-        queries[offset + 2] = radius;
-    }
-
-    // execute
-    const t0 = performance.now();
-
-    const result = [];
-
-    for (let i = 0; i < QUERY_COUNT; i++) {
-
-        const offset = i * 3;
-
-        shg_query_elements_circle(
-            result, 0, grid,
-            queries[offset],
-            queries[offset + 1],
-            queries[offset + 2],
-        );
-    }
-
-    const duration = performance.now() - t0;
-
-    const duration_seconds = duration * 1e-3;
-
-    console.log(`Duration ${duration_seconds}s, ${(QUERY_COUNT / duration_seconds).toFixed(2)} cycles per second`);
-
-});

package/src/core/geom/2d/hash-grid/shg_query_elements_line.spec.js

@@ -1,102 +0,0 @@
-import { randomFloatBetween } from "../../../math/random/randomFloatBetween.js";
-import { seededRandom } from "../../../math/random/seededRandom.js";
-import { shg_query_elements_line } from "./shg_query_elements_line.js";
-import { SpatialHashGrid } from "./SpatialHashGrid.js";
-
-test.skip("performance, 10k objects, 100k queries", () => {
-    const OBJECT_COUNT = 30000;
-    const QUERY_COUNT = 100000;
-
-    const QUERY_DISTANCE_MIN = 0.1;
-    const QUERY_DISTANCE_MAX = 0.2;
-
-    const grid = new SpatialHashGrid(128, 128, 1);
-
-    const grid_bounds_x1 = grid.size_x * grid.scale;
-    const grid_bounds_y1 = grid.size_y * grid.scale;
-
-    const random = seededRandom();
-
-    // fill
-    for (let i = 0; i < OBJECT_COUNT; i++) {
-        const el = grid.element_allocate();
-
-        grid.element_set_user_data(el, i);
-
-        const width = randomFloatBetween(random, 0.2, 1);
-        const height = randomFloatBetween(random, 0.2, 1);
-        const x0 = randomFloatBetween(random, 0, grid_bounds_x1 - width);
-        const y0 = randomFloatBetween(random, 0, grid_bounds_y1 - height);
-
-        grid.element_set_bounds_primitive(el,
-            x0,
-            y0,
-            x0 + width,
-            y0 + height
-        );
-
-        grid.element_insert(el);
-    }
-
-
-    const queries = new Float32Array(QUERY_COUNT * 4);
-
-    // build queries
-    for (let i = 0; i < QUERY_COUNT; i++) {
-
-        const offset = i * 4;
-
-        // pick starting point
-        const ax = randomFloatBetween(random, 0.001, grid_bounds_x1 - 0.001);
-        const ay = randomFloatBetween(random, 0.001, grid_bounds_y1 - 0.001);
-
-
-        const angle = randomFloatBetween(random, -Math.PI, Math.PI);
-
-        let direction_x = Math.cos(angle);
-        let direction_y = Math.sin(angle);
-
-        if (direction_x * (ax - grid_bounds_x1 * 0.5) > 0) {
-            direction_x = -direction_x;
-        }
-        if (direction_y * (ay - grid_bounds_y1 * 0.5) > 0) {
-            direction_y = -direction_y;
-        }
-
-        const query_distance = randomFloatBetween(random, QUERY_DISTANCE_MIN, QUERY_DISTANCE_MAX);
-
-        const bx = ax + direction_x * query_distance;
-        const by = ay + direction_y * query_distance;
-
-        queries[offset] = ax;
-        queries[offset + 1] = ay;
-
-        queries[offset + 2] = bx;
-        queries[offset + 3] = by;
-    }
-
-    // execute
-    const t0 = performance.now();
-
-    const result = [];
-
-    for (let i = 0; i < QUERY_COUNT; i++) {
-
-        const offset = i * 4;
-
-        shg_query_elements_line(
-            result, 0, grid,
-            queries[offset],
-            queries[offset + 1],
-            queries[offset + 2],
-            queries[offset + 3],
-        );
-    }
-
-    const duration = performance.now() - t0;
-
-    const duration_seconds = duration * 1e-3;
-
-    console.log(`Duration ${duration_seconds}s, ${(QUERY_COUNT / duration_seconds).toFixed(2)} cycles per second`);
-
-});

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

@@ -1,235 +0,0 @@
-import { jest } from "@jest/globals";
-import { randomFloatBetween } from "../../../math/random/randomFloatBetween.js";
-import { seededRandom } from "../../../math/random/seededRandom.js";
-import { QuadTreeDatum } from "./QuadTreeDatum.js";
-import { QuadTreeNode } from "./QuadTreeNode.js";
-
-test('constructor', () => {
-    const tree = new QuadTreeNode(1, 2, 3, 5);
-
-    expect(tree.x0).toEqual(1);
-    expect(tree.y0).toEqual(2);
-    expect(tree.x1).toEqual(3);
-    expect(tree.y1).toEqual(5);
-});
-
-test('inset node', () => {
-    const tree = new QuadTreeNode();
-
-    const datum = new QuadTreeDatum();
-
-    tree.insertDatum(datum);
-
-    expect(datum.parentNode).not.toBeNull();
-});
-
-test('add method creates valid Datum', () => {
-    const tree = new QuadTreeNode();
-
-    const datum = tree.add("a", 1, 2, 3, 4);
-
-    expect(datum).toBeDefined();
-
-    expect(datum.data).toEqual("a");
-
-    expect(datum.x0).toEqual(1);
-    expect(datum.y0).toEqual(2);
-    expect(datum.x1).toEqual(3);
-    expect(datum.y1).toEqual(4);
-
-    expect(datum.parentNode).toEqual(tree);
-});
-
-test('disconnect node', () => {
-    const tree = new QuadTreeNode();
-
-    const datum = new QuadTreeDatum();
-
-    tree.insertDatum(datum);
-
-    datum.disconnect();
-
-    expect(datum.parentNode).toBeNull();
-
-    expect(tree.treeDataCount).toBe(0);
-});
-
-test('tree resized to accommodate new node', () => {
-    const tree = new QuadTreeNode();
-
-    const datum = new QuadTreeDatum(-1, -3, 5, 7);
-
-    tree.insertDatum(datum);
-
-    datum.disconnect();
-
-    expect(datum.parentNode).toBeNull();
-
-    expect(tree.treeDataCount).toBe(0);
-
-    expect(tree.x0).toBe(datum.x0);
-    expect(tree.y0).toBe(datum.y0);
-    expect(tree.x1).toBe(datum.x1);
-    expect(tree.y1).toBe(datum.y1);
-});
-
-test('tree resized to accommodate node being moved', () => {
-    const tree = new QuadTreeNode();
-
-    const datum = new QuadTreeDatum(-1, -3, 5, 7);
-
-    tree.insertDatum(datum);
-
-    datum.move(1, 2);
-
-    expect(tree.x0).toBe(-1);
-    expect(tree.y0).toBe(-3);
-    expect(tree.x1).toBe(6);
-    expect(tree.y1).toBe(9);
-});
-
-test('insert 100 nodes', () => {
-    const tree = new QuadTreeNode();
-
-    const elements = [];
-
-    for (let i = 0; i < 100; i++) {
-        const datum = new QuadTreeDatum(i, i, i + 1, i + 1);
-
-        tree.insertDatum(datum);
-
-        elements.push(datum);
-    }
-
-    for (let i = 0; i < elements.length; i++) {
-        const datum = elements[i];
-
-        expect(datum.parentNode).not.toBeNull();
-    }
-
-    expect(tree.treeDataCount).toBe(100);
-});
-
-test('insert and remove 100 nodes', () => {
-    const tree = new QuadTreeNode();
-
-    const elements = [];
-
-    for (let i = 0; i < 100; i++) {
-        const datum = new QuadTreeDatum(i, i, i + 1, i + 1);
-
-        tree.insertDatum(datum);
-
-        elements.push(datum);
-    }
-
-    //remove elements
-    for (let i = 0; i < elements.length; i++) {
-        const datum = elements[i];
-
-        datum.disconnect();
-    }
-
-    expect(tree.treeDataCount).toBe(0);
-});
-
-test('test traverseRectangleIntersections', () => {
-    const tree = new QuadTreeNode();
-
-    const a = tree.add("a", 0, 0, 1, 1);
-    const b = tree.add("b", 2, 0, 3, 1);
-
-    const c = tree.add("c", 1, 1, 2, 2);
-
-    const d = tree.add("d", 0, 2, 1, 3);
-    const e = tree.add("e", 2, 2, 3, 3);
-
-    const visitor = jest.fn();
-
-    tree.traverseRectangleIntersections(0, 0, 1, 1, visitor);
-
-    expect(visitor).toHaveBeenCalledTimes(1);
-    expect(visitor).toHaveBeenLastCalledWith(a, 0, 0, 1, 1);
-
-    tree.traverseRectangleIntersections(2, 0, 3, 1, visitor);
-
-    expect(visitor).toHaveBeenCalledTimes(2);
-    expect(visitor).toHaveBeenLastCalledWith(b, 2, 0, 3, 1);
-
-    tree.traverseRectangleIntersections(1, 1, 2, 2, visitor);
-
-    expect(visitor).toHaveBeenCalledTimes(3);
-    expect(visitor).toHaveBeenLastCalledWith(c, 1, 1, 2, 2);
-
-    tree.traverseRectangleIntersections(0, 2, 1, 3, visitor);
-
-    expect(visitor).toHaveBeenCalledTimes(4);
-    expect(visitor).toHaveBeenLastCalledWith(d, 0, 2, 1, 3);
-
-    tree.traverseRectangleIntersections(2, 2, 3, 3, visitor);
-
-    expect(visitor).toHaveBeenCalledTimes(5);
-    expect(visitor).toHaveBeenLastCalledWith(e, 2, 2, 3, 3);
-
-    const visitor0 = jest.fn();
-
-    tree.traverseRectangleIntersections(0, 0, 3, 3, visitor0);
-
-    expect(visitor0).toHaveBeenCalledTimes(5);
-    expect(visitor0).toHaveBeenCalledWith(a, 0, 0, 3, 3);
-    expect(visitor0).toHaveBeenCalledWith(b, 0, 0, 3, 3);
-    expect(visitor0).toHaveBeenCalledWith(c, 0, 0, 3, 3);
-    expect(visitor0).toHaveBeenCalledWith(d, 0, 0, 3, 3);
-    expect(visitor0).toHaveBeenCalledWith(e, 0, 0, 3, 3);
-});
-
-test.skip("performance, insertion 1m random", () => {
-    const tree = new QuadTreeNode(0, 0, 100, 100);
-
-    const random = seededRandom(42);
-
-    const N = 1000000;
-
-    const boxes = new Float32Array(N * 4);
-
-    for (let i = 0; i < N; i++) {
-
-        const position_x = randomFloatBetween(random, 0, 98);
-        const position_y = randomFloatBetween(random, 0, 98);
-
-        const size_x = randomFloatBetween(random, 0.1, 2);
-        const size_y = randomFloatBetween(random, 0.1, 2);
-
-
-        const i4 = i * 4;
-        boxes[i4] = position_x;
-        boxes[i4 + 1] = position_y;
-        boxes[i4 + 2] = position_x + size_x;
-        boxes[i4 + 3] = position_y + size_y;
-    }
-
-    // perform insertion
-    const t0 = performance.now();
-
-    for (let i = 0; i < N; i++) {
-        const i4 = i * 4;
-
-        const x0 = boxes[i4];
-        const y0 = boxes[i4 + 1];
-        const x1 = boxes[i4 + 2];
-        const y1 = boxes[i4 + 3];
-
-        tree.add(i,
-            x0,
-            y0,
-            x1,
-            y1
-        );
-    }
-
-    const duration = performance.now() - t0;
-
-    const duration_seconds = duration * 1e-3;
-
-    console.log(`Duration ${duration_seconds}s, ${(N / duration_seconds).toFixed(2)} records per second`);
-});