@woosh/meep-engine 2.110.14 → 2.110.15

package/src/core/collection/heap/BinaryHeap.spec.js

@@ -1,137 +0,0 @@
-import { passThrough } from "../../function/passThrough.js";
-import { returnZero } from "../../function/returnZero.js";
-import { randomIntegerBetween } from "../../math/random/randomIntegerBetween.js";
-import { seededRandom } from "../../math/random/seededRandom.js";
-import BinaryHeap from "./BinaryHeap.js";
-
-test("constructor doesn't throw", () => {
-    new BinaryHeap(returnZero);
-});
-
-test("empty heap has size 0", () => {
-    const h = new BinaryHeap(returnZero);
-
-    expect(h.size()).toBe(0);
-});
-
-test('clear empty', () => {
-    const h = new BinaryHeap(returnZero);
-
-    h.clear();
-
-    expect(h.size()).toBe(0);
-    expect(h.pop()).toBe(undefined);
-});
-
-test('clear heap with 1 element', () => {
-    const h = new BinaryHeap(returnZero);
-
-    h.push(1);
-
-    h.clear();
-
-    expect(h.size()).toBe(0);
-    expect(h.pop()).toBe(undefined);
-});
-
-test("isEmpty", () => {
-    const h = new BinaryHeap(returnZero);
-
-    expect(h.isEmpty()).toBe(true);
-
-    h.push(1);
-
-    expect(h.isEmpty()).toBe(false);
-
-    h.pop();
-
-    expect(h.isEmpty()).toBe(true);
-});
-
-test("push followed by a pop", () => {
-    const h = new BinaryHeap(returnZero);
-
-    h.push(7);
-
-    expect(h.size()).toBe(1);
-
-    const popped = h.pop();
-
-    expect(popped).toBe(7);
-
-    expect(h.size()).toBe(0);
-});
-
-test("contains method", () => {
-    const h = new BinaryHeap(returnZero);
-
-    expect(h.contains(7)).toBe(false);
-
-    h.push(3);
-
-    expect(h.contains(7)).toBe(false);
-
-    h.push(7);
-
-    expect(h.contains(7)).toBe(true);
-
-    h.pop();
-    h.pop();
-
-    expect(h.contains(7)).toBe(false);
-});
-
-test("correct sorting of 4 numbers", () => {
-    const h = new BinaryHeap(passThrough);
-
-    const input = [2, 7, 1, 5];
-
-    input.forEach(i => {
-        h.push(i)
-    });
-
-    const output = [];
-
-    while (h.size() > 0) {
-        output.push(h.pop());
-    }
-
-    expect(output).toEqual([1, 2, 5, 7]);
-});
-
-test.skip("performance 100k random fill -> drain", () => {
-    const h = new BinaryHeap(passThrough);
-
-    const random = seededRandom(42);
-
-    const elements = [];
-
-    const n = 100000;
-
-    //prepare data
-    let i;
-    for (i = 0; i < n; i++) {
-        const index = randomIntegerBetween(random, 0, i);
-        elements.splice(index, 0, i);
-    }
-
-    //fill
-    let t = performance.now();
-    for (i = 0; i < n; i++) {
-        const el = elements[i];
-
-        h.push(el);
-    }
-
-    let d = (performance.now() - t) / 1000;
-    console.log(`Push ${n / d} elements per second`);
-
-    //drain
-    t = performance.now();
-    for (i = 0; i < n; i++) {
-        h.pop();
-    }
-    d = (performance.now() - t) / 1000;
-
-    console.log(`Drain ${n / d} elements per second`);
-});

package/src/core/collection/heap/Uint32Heap.spec.js

@@ -1,172 +0,0 @@
-import { seededRandom } from "../../math/random/seededRandom.js";
-import { Uint32Heap } from "./Uint32Heap.js";
-
-test('initial capacity setting via constructor', () => {
-    const heap = new Uint32Heap(3);
-
-    expect(heap.capacity).toBe(3);
-});
-
-test('heap capacity grows as needed', () => {
-    const heap = new Uint32Heap(0);
-
-    heap.insert(1, 1);
-
-    expect(heap.capacity).toBeGreaterThanOrEqual(1);
-});
-
-test('initial heap size is 0', () => {
-    const heap = new Uint32Heap();
-
-    expect(heap.size).toBe(0);
-});
-
-test('insert operation increases size by 1', () => {
-    const heap = new Uint32Heap();
-
-    const s0 = heap.size;
-
-    heap.insert(0, 0);
-
-    expect(heap.size).toBe(s0 + 1);
-});
-
-test('pop operation reduces size by 1', () => {
-    const heap = new Uint32Heap();
-
-    heap.insert(0, 0);
-
-    const s0 = heap.size;
-
-    heap.pop_min();
-
-    expect(heap.size).toBe(s0 - 1);
-});
-
-test('insert 5 out of order, retrieve in order', () => {
-    const heap = new Uint32Heap();
-
-    heap.insert(3, 4);
-    heap.insert(5, 5);
-    heap.insert(7, 2);
-    heap.insert(11, 3);
-    heap.insert(13, 1);
-
-    expect(heap.pop_min()).toBe(13);
-    expect(heap.pop_min()).toBe(7);
-    expect(heap.pop_min()).toBe(11);
-    expect(heap.pop_min()).toBe(3);
-    expect(heap.pop_min()).toBe(5);
-});
-
-test("remove", () => {
-
-    const heap = new Uint32Heap();
-
-    expect(heap.remove(7)).toBe(false);
-
-    heap.insert(7, 3);
-
-    expect(heap.remove(7)).toBe(true);
-
-    expect(heap.is_empty()).toBe(true);
-});
-
-test("is_empty", () => {
-
-    const heap = new Uint32Heap();
-
-    expect(heap.is_empty()).toBe(true);
-
-    heap.insert(7, 0);
-
-    expect(heap.is_empty()).toBe(false);
-});
-
-test("update_score", () => {
-
-    const heap = new Uint32Heap();
-
-    heap.insert(1, 3);
-    heap.insert(7, 11);
-
-    heap.update_score(7, -1);
-
-    expect(heap.pop_min()).toEqual(7);
-    expect(heap.pop_min()).toEqual(1);
-
-    // expect request to a missing element to throw
-    expect(() => heap.update_score(7, 0)).toThrow();
-});
-
-test("get_score", () => {
-
-    const heap = new Uint32Heap();
-
-    expect(heap.get_score(7)).toBeNaN();
-
-    heap.insert(7, 31);
-
-    expect(heap.get_score(7)).toBe(31);
-});
-
-test("insert_or_update", () => {
-
-    const heap = new Uint32Heap();
-
-    heap.insert_or_update(7, 1);
-
-    expect(heap.size).toBe(1);
-    expect(heap.get_score(7)).toBe(1);
-
-    heap.insert_or_update(7, 17);
-
-    expect(heap.size).toBe(1);
-    expect(heap.get_score(7)).toBe(17);
-
-});
-
-test("clear should make heap empty", () => {
-    const heap = new Uint32Heap();
-
-    heap.clear();
-
-    expect(heap.is_empty()).toBe(true);
-
-    heap.insert(1, 7);
-
-    heap.clear();
-
-    expect(heap.is_empty()).toBe(true);
-});
-
-test.skip("performance 1,000,000 random element fill / drain", () => {
-
-    const random = seededRandom(7);
-
-    const COUNT = 1000000;
-
-    const random_values = new Float32Array(COUNT);
-
-    for (let i = 0; i < COUNT; i++) {
-        random_values[i] = random();
-    }
-
-    const heap = new Uint32Heap();
-
-    const t0 = performance.now();
-    for (let i = 0; i < COUNT; i++) {
-        heap.insert(i, random_values[i]);
-    }
-    const t1 = performance.now();
-
-    for (let i = 0; i < COUNT; i++) {
-        heap.pop_min();
-    }
-    const t2 = performance.now();
-
-    const fill_time = t1 - t0;
-    const drain_time = t2 - t1;
-
-    console.log(`Fill took ${fill_time}ms (${COUNT / (fill_time * 0.001)} elements per second), drain took ${drain_time}ms (${COUNT / (drain_time * 0.001)} elements per second)`);
-});