ts-mls/dist/test/test-vectors/treemath.test.js

[](https://github.com/LukaJCB/ts-mls/actions/workflows/ci.yml) [](https://badge.fury.io/js/ts-mls) [![Coverage Status](https://co

import json from "../../test_vectors/tree-math.json";
import { left, nodeWidth, parent, right, root, sibling } from "../../src/treemath";
import { InternalError } from "../../src/mlsError";
for (const [index, x] of json.entries()) {
    test(`tree math test vectors ${index}`, () => {
        treemathTest(x);
    });
}
function treemathTest(t) {
    //n_nodes is the number of nodes in the tree with n_leaves leaves
    expect(nodeWidth(t.n_leaves)).toBe(t.n_nodes);
    //root is the root node index of the tree
    expect(root(t.n_leaves)).toBe(t.root);
    //left[i] is the node index of the left child of the node with index i in a tree with n_leaves leaves
    for (const [i, expected] of t.left.entries()) {
        const leftFn = () => left(i);
        if (expected != null) {
            expect(leftFn()).toBe(expected);
        }
        else {
            expect(leftFn).toThrow(InternalError);
        }
    }
    //right[i] is the node index of the right child of the node with index i in a tree with n_leaves leaves
    for (const [i, expected] of t.right.entries()) {
        const rightFn = () => right(i);
        if (expected != null) {
            expect(rightFn()).toBe(expected);
        }
        else {
            expect(rightFn).toThrow(InternalError);
        }
    }
    //parent[i] is the node index of the parent of the node with index i in a tree with n_leaves leaves
    for (const [i, expected] of t.parent.entries()) {
        const parentFn = () => parent(i, t.n_leaves);
        if (expected != null) {
            expect(parentFn()).toBe(expected);
        }
        else {
            expect(parentFn).toThrow(InternalError);
        }
    }
    //sibling[i] is the node index of the sibling of the node with index i in a tree with n_leaves leaves
    for (const [i, expected] of t.sibling.entries()) {
        const siblingFn = () => sibling(i, t.n_leaves);
        if (expected != null) {
            expect(siblingFn()).toBe(expected);
        }
        else {
            expect(siblingFn).toThrow(InternalError);
        }
    }
}
//# sourceMappingURL=treemath.test.js.map