@woosh/meep-engine 2.110.13 → 2.110.15

package/src/core/geom/2d/bvh/BVH2D.spec.js

@@ -1,359 +0,0 @@
-import { randomFloatBetween } from "../../../math/random/randomFloatBetween.js";
-import { seededRandom } from "../../../math/random/seededRandom.js";
-import { BVH2D, NULL_NODE } from "./BVH2D.js";
-
-test("constructor doesn't throw", () => {
-    expect(() => new BVH2D()).not.toThrow();
-});
-
-test("initial root is NULL", () => {
-    const bvh = new BVH2D();
-
-    expect(bvh.root).toBe(NULL_NODE);
-});
-
-test("allocate a node", () => {
-    const bvh = new BVH2D();
-
-    const id = bvh.allocate_node();
-
-    expect(typeof id).toBe("number");
-    expect(Number.isInteger(id)).toBe(true);
-    expect(id).toBeGreaterThanOrEqual(0);
-});
-
-test("set/get aabb", () => {
-    const bvh = new BVH2D();
-
-    const node = bvh.allocate_node();
-
-    bvh.node_set_aabb(node, [1, -2, -5, 7]);
-
-    const result = [];
-
-    bvh.node_get_aabb(node, result);
-
-    expect(result).toEqual([
-        1, -2, -5, 7
-    ]);
-});
-
-test("insert one leaf", () => {
-    const bvh = new BVH2D();
-
-    const node = bvh.allocate_node();
-
-    bvh.insert_leaf(node);
-
-    expect(bvh.root).toBe(node);
-});
-
-test("node reuse after de-allocation", () => {
-
-    const bvh = new BVH2D();
-
-    const a = bvh.allocate_node();
-
-    bvh.release_node(a);
-
-    const b = bvh.allocate_node();
-
-    expect(b).toEqual(a);
-});
-
-test("insert two leaves", () => {
-
-    const bvh = new BVH2D();
-
-    const a = bvh.allocate_node();
-    bvh.insert_leaf(a);
-
-    const b = bvh.allocate_node();
-    bvh.insert_leaf(b);
-
-    const nodes = [];
-    bvh.collect_nodes_all(nodes, 0);
-
-    expect(nodes).toContain(a);
-    expect(nodes).toContain(b);
-});
-
-
-test("set/get user data", () => {
-
-    const bvh = new BVH2D();
-
-    const a = bvh.allocate_node();
-
-    bvh.node_set_user_data(a, 42);
-
-    expect(bvh.node_get_user_data(a)).toBe(42);
-});
-
-test("remove single leaf", () => {
-    const bvh = new BVH2D();
-
-    const a = bvh.allocate_node();
-    bvh.insert_leaf(a);
-
-    bvh.remove_leaf(a);
-
-    const nodes = [];
-    bvh.collect_nodes_all(nodes, 0);
-
-    expect(nodes).not.toContain(a);
-});
-
-test("add and remove 5 nodes", () => {
-
-    const bvh = new BVH2D();
-
-    const leaves = [];
-    const removed_leaves = [];
-
-    for (let i = 0; i < 5; i++) {
-        const a = bvh.allocate_node();
-        bvh.node_set_user_data(a, a);
-        bvh.insert_leaf(a);
-
-        leaves.push(a);
-    }
-
-    while (leaves.length > 0) {
-        const nodes = [];
-        bvh.collect_nodes_all(nodes, 0);
-
-        for (let j = 0; j < leaves.length; j++) {
-            const leaf = leaves[j];
-            expect(nodes).toContain(leaf);
-        }
-
-        const leaf = leaves.shift();
-
-        expect(bvh.node_get_user_data(leaf)).toBe(leaf);
-
-        bvh.remove_leaf(leaf);
-
-        removed_leaves.push(leaf);
-
-    }
-
-    const nodes = [];
-    bvh.collect_nodes_all(nodes, 0);
-    for (let i = 0; i < removed_leaves.length; i++) {
-        expect(nodes).not.toContain(removed_leaves[i]);
-    }
-
-});
-
-
-test("release_all from empty doesn't throw", () => {
-    const bvh = new BVH2D();
-
-    expect(() => bvh.release_all()).not.toThrow();
-});
-
-test("release_all with 1 leaf", () => {
-    const bvh = new BVH2D();
-
-    const a = bvh.allocate_node();
-
-    bvh.insert_leaf(a);
-
-    bvh.release_all();
-
-    expect(bvh.root).toBe(NULL_NODE);
-});
-
-test("capacity grows as necessary when allocating", () => {
-    const bvh = new BVH2D();
-
-    bvh.node_capacity = 1;
-
-    bvh.allocate_node();
-
-    bvh.allocate_node();
-
-    expect(bvh.node_capacity).toBeGreaterThanOrEqual(2);
-});
-
-test("trim sets capacity to exact allocated size", () => {
-    const bvh = new BVH2D();
-
-    bvh.node_capacity = 1;
-
-    bvh.allocate_node();
-
-    bvh.allocate_node();
-
-    bvh.trim();
-
-    expect(bvh.node_capacity).toBe(2);
-});
-
-
-test("node property setters/getters", () => {
-
-    const bvh = new BVH2D();
-
-    const node = bvh.allocate_node();
-
-    bvh.node_set_user_data(node, 3);
-
-    expect(bvh.node_get_user_data(node)).toBe(3);
-
-    bvh.node_set_child1(node, 7);
-    bvh.node_set_child2(node, 11);
-    bvh.node_set_parent(node, 13);
-    bvh.node_set_height(node, 17);
-
-    const expected_aabb = new Float32Array([1.1, 3.2, 11.4, 13.5]);
-    bvh.node_set_aabb(node, expected_aabb);
-
-    expect(bvh.node_get_child1(node)).toBe(7);
-    expect(bvh.node_get_child2(node)).toBe(11);
-    expect(bvh.node_get_parent(node)).toBe(13);
-    expect(bvh.node_get_height(node)).toBe(17);
-
-    const actual_aabb = [];
-    bvh.node_get_aabb(node, actual_aabb)
-
-    expect(actual_aabb).toEqual(Array.from(expected_aabb));
-});
-
-
-test("node_set_aabb_primitive", () => {
-    const bvh = new BVH2D();
-
-    const node = bvh.allocate_node();
-
-    bvh.node_set_aabb_primitive(node, -1, -3, 7, 11);
-
-    const aabb = [];
-
-    bvh.node_get_aabb(node, aabb);
-
-    expect(aabb).toEqual([-1, -3, 7, 11]);
-});
-
-test("swap two detached nodes", () => {
-    const bvh = new BVH2D();
-
-    const a = bvh.allocate_node();
-    const b = bvh.allocate_node();
-
-    bvh.node_set_user_data(a, 7);
-    bvh.node_set_user_data(b, 11);
-
-    bvh.swap_nodes(a, b);
-
-    expect(bvh.node_get_user_data(a)).toBe(11);
-    expect(bvh.node_get_user_data(b)).toBe(7);
-});
-
-test("setting capacity", () => {
-    const bvh = new BVH2D();
-
-    bvh.node_capacity = 3;
-
-    expect(bvh.node_capacity).toEqual(3);
-
-    bvh.node_capacity = 3;
-
-    expect(bvh.node_capacity).toEqual(3);
-
-    bvh.node_capacity = 0;
-
-    expect(bvh.node_capacity).toEqual(0);
-
-    bvh.allocate_node();
-
-    bvh.node_capacity = 3;
-
-    expect(bvh.node_capacity).toEqual(3);
-
-    bvh.node_capacity = 1;
-
-    expect(bvh.node_capacity).toEqual(1);
-
-    expect(() => bvh.node_capacity = 0).toThrow();
-});
-
-test("move leaf node", () => {
-    const bvh = new BVH2D();
-
-    const a = bvh.allocate_node();
-    const b = bvh.allocate_node();
-
-    bvh.node_set_aabb(a, [-1.1, -1.2, 2.1, 2.2]);
-    bvh.node_set_aabb(b, [3.1, 3.2, 5.1, 5.2]);
-
-    bvh.insert_leaf(a);
-    bvh.insert_leaf(b);
-
-    // convert to float32 and back to account for rounding errors when checking results
-    const a_new_bounds = Array.from(new Float32Array([
-        7.1, 7.2,
-        11.1, 11.2
-    ]));
-
-    bvh.node_move_aabb(a, a_new_bounds);
-
-    const actual_bounds = [];
-    bvh.node_get_aabb(a, actual_bounds);
-
-    expect(actual_bounds).toEqual(a_new_bounds);
-});
-
-test.skip("performance, insert 1m random nodes", () => {
-
-    const random = seededRandom(1);
-
-    const bvh = new BVH2D();
-
-    const min_bound = 1;
-    const max_bound = 99;
-
-    const OBJECT_COUNT = 1000000;
-
-    const leaves = new Uint32Array(OBJECT_COUNT);
-    for (let i = 0; i < OBJECT_COUNT; i++) {
-        const node = bvh.allocate_node();
-
-        bvh.node_set_user_data(node, i);
-
-        const x = randomFloatBetween(random, min_bound, max_bound);
-        const y = randomFloatBetween(random, min_bound, max_bound);
-
-        const extents_x = randomFloatBetween(random, 0.05, 1);
-        const extents_y = randomFloatBetween(random, 0.05, 1);
-
-        const x0 = x - extents_x;
-        const y0 = y - extents_y;
-
-        const x1 = x + extents_x;
-        const y1 = y + extents_y;
-
-        // console.log([x0, y0, z0, x1, y1, z1].join(', '))
-
-        bvh.node_set_aabb_primitive(
-            node,
-            x0, y0,
-            x1, y1,
-        );
-    }
-
-    const t0 = performance.now();
-    for (let i = 0; i < OBJECT_COUNT; i++) {
-        const node = leaves[i];
-
-        bvh.insert_leaf(node);
-    }
-
-    const duration = performance.now() - t0;
-
-    const duration_seconds = duration * 1e-3;
-
-    console.log(`Duration ${duration_seconds}s, ${(OBJECT_COUNT / duration_seconds).toFixed(2)} records per second`);
-
-});

package/src/core/geom/2d/bvh/bvh2d_query_all_data_by_circle.spec.js

@@ -1,89 +0,0 @@
-import { randomFloatBetween } from "../../../math/random/randomFloatBetween.js";
-import { seededRandom } from "../../../math/random/seededRandom.js";
-import { BVH2D } from "./BVH2D.js";
-import { bvh2d_query_all_data_by_circle } from "./bvh2d_query_all_data_by_circle.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_bounds_x1 = 256;
-    const grid_bounds_y1 = 256;
-
-    const bvh = new BVH2D();
-
-    const random = seededRandom();
-
-    // fill
-    for (let i = 0; i < OBJECT_COUNT; 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);
-
-        const node = bvh.allocate_node();
-
-        bvh.node_set_user_data(node, i);
-        bvh.node_set_aabb_primitive(
-            node,
-            x0,
-            y0,
-            x0 + width,
-            y0 + height
-        );
-
-        bvh.insert_leaf(node);
-    }
-
-
-    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;
-
-        bvh2d_query_all_data_by_circle(
-            bvh,
-            bvh.root,
-            result,
-            0,
-            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/circle/circle_compute_circle_intersection.spec.js

@@ -1,79 +0,0 @@
-import { circle_compute_circle_intersection } from "./circle_compute_circle_intersection.js";
-
-test("non-intersecting point circles", () => {
-    expect(
-        circle_compute_circle_intersection(
-            [], 0,
-            0, 0, 0,
-            1, 0, 0
-        )
-    ).toBe(false);
-
-    expect(
-        circle_compute_circle_intersection(
-            [], 0,
-            1, 0, 0,
-            0, 0, 0
-        )
-    ).toBe(false);
-
-    expect(
-        circle_compute_circle_intersection(
-            [], 0,
-            0, 1, 0,
-            0, 0, 0
-        )
-    ).toBe(false);
-
-    expect(
-        circle_compute_circle_intersection(
-            [], 0,
-            0, 0, 0,
-            0, 1, 0
-        )
-    ).toBe(false);
-});
-
-test("circle inside circle", () => {
-
-
-    expect(
-        circle_compute_circle_intersection(
-            [], 0,
-            2, 3, 5,
-            3, 4, 11
-        )
-    ).toBe(false);
-
-
-});
-
-test("touching case", () => {
-
-    const result = [];
-
-    expect(
-        circle_compute_circle_intersection(
-            result, 0,
-            1, 3, 5,
-            7, 3, 1
-        )
-    ).toBe(true);
-
-    expect(result).toEqual([6, 3, 6, 3]);
-});
-
-test("2 intersection points", () => {
-
-    const result = [];
-
-    expect(
-        circle_compute_circle_intersection(
-            result, 0,
-            -0.5, 0, 1,
-            0.5, 0, 1
-        )
-    ).toBe(true);
-
-    expect(result).toEqual([0, -0.5 * Math.sqrt(3), 0, +0.5 * Math.sqrt(3)]);
-});

package/src/core/geom/2d/compute_polygon_area_2d.spec.js

@@ -1,10 +0,0 @@
-import { compute_polygon_area_2d } from "./compute_polygon_area_2d.js";
-
-test("square", () => {
-    expect(compute_polygon_area_2d([
-        0, 0,
-        1, 0,
-        1, 1,
-        0, 1
-    ], 4)).toBeCloseTo(1);
-});

package/src/core/geom/2d/compute_triangle_area_2d.spec.js

@@ -1,9 +0,0 @@
-import { compute_triangle_area_2d } from "./compute_triangle_area_2d.js";
-
-test("half-square", () => {
-    expect(compute_triangle_area_2d(
-        0, 0,
-        1, 0,
-        1, 1
-    )).toBeCloseTo(0.5);
-});

package/src/core/geom/2d/convex-hull/convex_hull_jarvis_2d.spec.js

@@ -1,33 +0,0 @@
-import { convex_hull_jarvis_2d } from "./convex_hull_jarvis_2d.js";
-
-test("box with extra points", () => {
-    const hull = convex_hull_jarvis_2d([
-        0, 1,
-        -1, 0,
-        1, 0,
-        0, -1,
-        // extra points inside
-        0.3, 0.3,
-        -0.3, -0.3,
-        0.3, -0.3,
-        -0.3, 0.3
-    ]);
-
-    expect(hull.length).toBe(4);
-
-    expect(hull).toContain(0);
-    expect(hull).toContain(1);
-    expect(hull).toContain(2);
-    expect(hull).toContain(3);
-});
-
-
-test("exact triangle", () => {
-    const hull = convex_hull_jarvis_2d([
-        0, 0,
-        1, 0,
-        1, 1,
-    ]);
-
-    expect(hull.length).toBe(3);
-});

package/src/core/geom/2d/convex-hull/convex_hull_monotone_2d.spec.js

@@ -1,33 +0,0 @@
-import { convex_hull_monotone_2d } from "./convex_hull_monotone_2d.js";
-
-test("box with extra points", () => {
-    const hull = convex_hull_monotone_2d([
-        0, 1,
-        -1, 0,
-        1, 0,
-        0, -1,
-        // extra points inside
-        0.3, 0.3,
-        -0.3, -0.3,
-        0.3, -0.3,
-        -0.3, 0.3
-    ]);
-
-    expect(hull.length).toBe(4);
-
-    expect(hull).toContain(0);
-    expect(hull).toContain(1);
-    expect(hull).toContain(2);
-    expect(hull).toContain(3);
-});
-
-
-test("exact triangle", () => {
-    const hull = convex_hull_monotone_2d([
-        0, 0,
-        1, 0,
-        1, 1,
-    ]);
-
-    expect(hull.length).toBe(3);
-});