functionalscript 0.43.0 → 0.44.0

package/fjs/types/bit_vec/proof.f.js

@@ -1,465 +0,0 @@
-import { assert, assertEq } from '../../asserts/module.f.js';
-import { mask } from '../bigint/module.f.js';
-import { asBase, asNominal } from '../nominal/module.f.js';
-import { length, empty, uint, vec, lsb, msb, repeat, vec8, maxLength, u8ListToVec, tryU8ListToVec, u8List, chunkList, fromSentinel } from './module.f.js';
-import { repeat as listRepeat, toArray } from '../list/module.f.js';
-const unsafeVec = (a) => asNominal(a);
-// 0x8 = 0b1000 = 0 + 8
-// 0x9 = 0b1001 = 1 + 8
-// 0xA = 0b1010 = 2 + 8
-// 0xB = 0b1011 = 3 + 8
-// 0xC = 0b1100 = 4 + 8
-// 0xD = 0b1101 = 5 + 8
-// 0xE = 0b1110 = 6 + 8
-// 0xF = 0b1111 = 7 + 8
-const assertEq2 = ([a0, a1], [b0, b1]) => {
-    assertEq(a0, b0);
-    assertEq(a1, b1);
-};
-const frontTest = (e) => (r0) => (r1) => () => {
-    const vector = vec(8n)(0xf5n); // 0xF5n
-    assertEq(vector, unsafeVec(0xf5n));
-    const result = e.front(4n)(vector);
-    assertEq(result, r0);
-    const result2 = e.front(16n)(vector);
-    assertEq(result2, r1);
-};
-const popFront = (e) => ([r00, r01]) => ([r10, r11]) => () => {
-    const vector = vec(8n)(0xf5n); // 0xF5n
-    const [result, rest] = e.popFront(4n)(vector);
-    assertEq(result, r00);
-    assertEq(rest, unsafeVec(r01));
-    const [result2, rest2] = e.popFront(16n)(vector);
-    assertEq(result2, r10);
-    assertEq(rest2, unsafeVec(r11));
-};
-const removeFront = (e) => (r0) => (r1) => () => {
-    const v = vec(16n)(0x3456n); // -0xB456n
-    assertEq(v, unsafeVec(-0xb456n));
-    const r = e.removeFront(4n)(v);
-    assertEq(r, r0);
-    const r2 = e.removeFront(24n)(v);
-    assertEq(r2, r1);
-};
-const concat = (e) => (r) => () => {
-    const u8 = vec(8n);
-    const a = u8(0x45n); // -0xC5n
-    assertEq(a, unsafeVec(-0xc5n));
-    const b = u8(0x89n); // 0x89n
-    assertEq(b, unsafeVec(0x89n));
-    const ab = e.concat(a)(b); // 0x8945n
-    assertEq(ab, r);
-};
-export const proof = {
-    fromSentinel: () => {
-        // Two data bytes; the leading 0x1 nibble is the sentinel, stripped out.
-        const v = fromSentinel(0x18950n);
-        assertEq(length(v), 16n);
-        assertEq(uint(v), 0x8950n);
-        // Leading zero bytes survive because the sentinel pins the length.
-        const z = fromSentinel(0x10005n);
-        assertEq(length(z), 16n);
-        assertEq(uint(z), 0x0005n);
-        // A bare sentinel yields the empty vector.
-        assertEq(fromSentinel(0x1n), empty);
-    },
-    examples: {
-        vec: () => {
-            const vec4 = vec(4n);
-            const v0 = vec4(5n); // 0b0101 => -0b1101
-            assertEq(v0, unsafeVec(-0xdn));
-            const v1 = vec4(0x5fen); // 0xEn
-            assertEq(v1, unsafeVec(0xen));
-        },
-        uint: () => {
-            const vector = vec(8n)(0x5n); // -0x85n
-            assertEq(vector, unsafeVec(-0x85n));
-            const result = uint(vector); // result is 0x5n
-            assertEq(result, 0x5n);
-        },
-        front: () => {
-            const vector = vec(8n)(0xf5n); // 0xF5n
-            assertEq(lsb.front(4n)(vector), 5n);
-            assertEq(lsb.front(16n)(vector), 0xf5n);
-            assertEq(msb.front(4n)(vector), 0xfn);
-            assertEq(msb.front(16n)(vector), 0xf500n);
-        },
-        removeFront: () => {
-            const v = vec(16n)(0x3456n); // -0xB456n
-            assertEq(lsb.removeFront(4n)(v), asNominal(-0xb45n));
-            assertEq(lsb.removeFront(24n)(v), empty);
-            assertEq(msb.removeFront(4n)(v), asNominal(-0xc56n));
-            assertEq(msb.removeFront(24n)(v), empty);
-        },
-        popFront: () => {
-            const vector = vec(8n)(0xf5n); // 0xF5n
-            assertEq2(lsb.popFront(4n)(vector), [5n, asNominal(0xfn)]);
-            assertEq2(lsb.popFront(16n)(vector), [0xf5n, empty]);
-            assertEq2(msb.popFront(4n)(vector), [0xfn, asNominal(-0xdn)]);
-            assertEq2(msb.popFront(16n)(vector), [0xf500n, empty]);
-        },
-        concat: () => {
-            const u8 = vec(8n);
-            const a = u8(0x45n); // -0xC5n
-            const b = u8(0x89n); // 0x89n
-            assertEq(lsb.concat(a)(b), asNominal(0x8945n));
-            assertEq(msb.concat(a)(b), asNominal(-0xc589n));
-        }
-    },
-    front: {
-        lsbf: frontTest(lsb)(5n)(0xf5n),
-        msbf: frontTest(msb)(0xfn)(0xf500n),
-    },
-    popFront: {
-        lsbm: popFront(lsb)([5n, 0xfn])([0xf5n, 0n]),
-        msbm: popFront(msb)([0xfn, -0xdn])([0xf500n, 0n]),
-    },
-    removeFront: {
-        lsbm: removeFront(lsb)(asNominal(-0xb45n))(empty),
-        msbm: removeFront(msb)(asNominal(-0xc56n))(empty),
-    },
-    concat: {
-        lsbm: concat(lsb)(asNominal(0x8945n)),
-        msbm: concat(msb)(asNominal(-0xc589n)),
-    },
-    uintLsb: () => {
-        const vector = asNominal(53n);
-        const extract3Bits = lsb.front(3n);
-        const result = extract3Bits(vector); // result is 0b101n (5n)
-        assertEq(result, 5n);
-    },
-    uintSmall: () => {
-        const vector = asNominal(1n);
-        const extract3Bits = lsb.front(3n)(vector);
-        assertEq(extract3Bits, 1n);
-    },
-    vecExample: () => {
-        const createVector = vec(4n);
-        const vector = createVector(5n); // vector is -0b1101n
-        assertEq(vector, unsafeVec(-13n));
-    },
-    length: () => {
-        const len = length(empty);
-        assertEq(len, 0n);
-    },
-    bitset: () => {
-        const v = vec(8n)(0x5fen);
-        assertEq(v, unsafeVec(0xfen));
-        assertEq(length(v), 8n, 'len');
-        const u = lsb.front(8n)(v);
-        assertEq(u, 0xfen, v);
-    },
-    appendBack: () => {
-        const vec8 = vec(8n);
-        const a = vec8(0x345n);
-        const b = vec8(0x789n);
-        const ab = lsb.concat(a)(b);
-        assertEq(ab, unsafeVec(0x8945n));
-        const s = length(ab);
-        if (s !== 16n) {
-            throw `appendBack: ${s}`;
-        }
-    },
-    removeBack: () => {
-        const v = vec(17n)(0x12345n);
-        assertEq(v, unsafeVec(0x12345n), asBase(v).toString(16));
-        const r = lsb.removeFront(9n)(v);
-        assertEq(r, unsafeVec(0x91n), asBase(r).toString(16));
-    },
-    uint: [
-        // 0
-        () => {
-            const x = uint(asNominal(0n));
-            assertEq(x, 0n);
-        },
-        // 1
-        () => {
-            const v = asNominal(1n);
-            const x = uint(v);
-            assertEq(x, 1n);
-            const len = length(v);
-            assertEq(len, 1n);
-        },
-        // 2
-        () => {
-            const v = asNominal(2n);
-            const x = uint(v);
-            assertEq(x, 2n);
-            const len = length(v);
-            assertEq(len, 2n);
-        },
-        // 3
-        () => {
-            const v = asNominal(3n);
-            const x = uint(v);
-            assertEq(x, 3n);
-            const len = length(v);
-            assertEq(len, 2n);
-        },
-        // 4
-        () => {
-            const v = asNominal(-1n);
-            const x = uint(v);
-            assertEq(x, 0n);
-            const len = length(v);
-            assertEq(len, 1n);
-        },
-        () => {
-            const v = asNominal(-2n);
-            const x = uint(v);
-            assertEq(x, 0n);
-            const len = length(v);
-            assertEq(len, 2n);
-        },
-        () => {
-            const v = asNominal(-3n);
-            const x = uint(v);
-            assertEq(x, 1n);
-            const len = length(v);
-            assertEq(len, 2n);
-        }
-    ],
-    vec: [
-        // 0
-        () => {
-            const v = asBase(vec(0n)(0n));
-            assertEq(v, 0n);
-        },
-        () => {
-            const v = asBase(vec(0n)(1n));
-            assertEq(v, 0n);
-        },
-        () => {
-            const v = asBase(vec(0n)(-1n));
-            assertEq(v, 0n);
-        },
-        // 1
-        () => {
-            const v = asBase(vec(1n)(0n));
-            assertEq(v, -1n);
-        },
-        () => {
-            const v = asBase(vec(1n)(1n));
-            assertEq(v, 1n);
-        },
-        () => {
-            const v = asBase(vec(1n)(-1n));
-            assertEq(v, 1n);
-        },
-        () => {
-            const v = asBase(vec(1n)(2n));
-            assertEq(v, -1n);
-        },
-        () => {
-            const v = asBase(vec(1n)(3n));
-            assertEq(v, 1n);
-        }
-    ],
-    both: () => {
-        const c = (len) => (ui) => (raw) => {
-            const v = vec(len)(ui);
-            const x = asBase(v);
-            if (x !== raw) {
-                throw `x: ${x}, raw: ${raw}`;
-            }
-            const len2 = length(v);
-            assertEq(len2, len);
-            const u = uint(v);
-            const mui = mask(len) & ui;
-            assertEq(u, mui, [u, mui]);
-        };
-        // 0n
-        for (const i of [0n, 1n, -1n, 2n, -2n, 3n, -3n]) {
-            c(0n)(i)(0n);
-        }
-        return [
-            // 1n
-            () => c(1n)(0n)(-1n),
-            () => c(1n)(1n)(1n),
-            () => c(1n)(-11n)(1n), //< overflow
-            // 2n
-            () => c(2n)(0n)(-2n),
-            () => c(2n)(1n)(-3n),
-            () => c(2n)(2n)(2n),
-            () => c(2n)(3n)(3n),
-            // -1 is 0b.....1
-            // -2 is 0b....10
-            // -3 is 0b...101
-            // -4 is 0b...100
-            // -5 is 0b..1011
-            // -6 is 0b..1010
-            // -7 is 0b..1011, cut 0b11, vec: -0b11
-            // -8 is 0b..1100 = ~(8-1) = ~7
-            () => c(2n)(-7n)(-3n), //< overflow.
-        ];
-    },
-    concat2: () => {
-        const c = (a) => (b) => (abx) => {
-            const ab = msb.concat(a)(b);
-            const abLen = length(ab);
-            const abxLen = length(abx);
-            assertEq(abLen, abxLen);
-            const abU = uint(ab);
-            const abxU = uint(abx);
-            assertEq(abU, abxU);
-        };
-        c(vec(4n)(0xfn))(vec(8n)(0xa7n))(vec(12n)(0xfa7n));
-        c(vec(4n)(0xfn))(vec(8n)(0x57n))(vec(12n)(0xf57n));
-        c(vec(4n)(0x5n))(vec(8n)(0xa7n))(vec(12n)(0x5a7n));
-        c(vec(4n)(0x5n))(vec(8n)(0x79n))(vec(12n)(0x579n));
-    },
-    lsbXor: () => {
-        const c = (a) => (b) => (e) => {
-            const r = lsb.xor(a)(b);
-            assertEq(r, e);
-        };
-        c(vec(4n)(0x7n))(vec(8n)(0x12n))(vec(8n)(0x7n ^ 0x12n));
-    },
-    msbXor: () => {
-        const c = (a) => (b) => (e) => {
-            const r = msb.xor(a)(b);
-            assertEq(r, e);
-        };
-        c(vec(4n)(0x7n))(vec(8n)(0x12n))(vec(8n)(0x70n ^ 0x12n));
-    },
-    repeat: () => {
-        assertEq(repeat(4n)(vec8(0xa5n)), vec(32n)(0xa5a5a5a5n), 'repeat failed');
-        assertEq(repeat(7n)(vec(5n)(0x13n)), vec(35n)(21059194483n), 'repeat failed');
-    },
-    lsbCmp: () => {
-        const c = (a) => (b) => (r) => {
-            const result = lsb.cmp(a)(b);
-            if (result !== r) {
-                throw `result: ${result}, expected: ${r}`;
-            }
-        };
-        c(vec(4n)(0x5n))(vec(4n)(0x5n))(0); // [1,0,1,0] == [1,0,1,0]
-        c(vec(4n)(0x5n))(vec(4n)(0x6n))(1); // bit0: 1 > 0
-        c(vec(4n)(0x6n))(vec(4n)(0x5n))(-1); // bit0: 0 < 1
-        c(vec(4n)(0x5n))(vec(5n)(0x5n))(-1); // equal prefix, shorter is less
-        c(vec(5n)(0x5n))(vec(4n)(0x5n))(1); // equal prefix, longer is greater
-        c(vec(4n)(0x5n))(vec(5n)(0xan))(1); // bit0: 1 > 0
-    },
-    msbCmp: () => {
-        const c = (a) => (b) => (r) => {
-            const result = msb.cmp(a)(b);
-            if (result !== r) {
-                throw `result: ${result}, expected: ${r}`;
-            }
-        };
-        c(vec(4n)(0x5n))(vec(4n)(0x5n))(0); // 0b0101 == 0b0101
-        c(vec(4n)(0x5n))(vec(4n)(0x6n))(-1); // 0b0101 < 0b0110
-        c(vec(4n)(0x6n))(vec(4n)(0x5n))(1); // 0b0110 > 0b0101
-        c(vec(4n)(0x5n))(vec(5n)(0x5n))(1); // 0b0101_ < 0b00101
-        c(vec(5n)(0x5n))(vec(4n)(0x5n))(-1); // 0b00101 < 0b0101_
-        c(vec(4n)(0x5n))(vec(5n)(0xan))(-1); // 0b0101_ < 0b01010
-    },
-    startsWith: {
-        // vector 0xF5 = 0b1111_0101 (8 bits)
-        // LSB reads from the low end: bits 0-3 = 0101 = 0x5, bits 4-7 = 1111 = 0xF
-        lsb: () => {
-            const v = vec(8n)(0xf5n);
-            assertEq(lsb.startsWith(vec(4n)(0x5n))(v), true); // low nibble matches
-            assertEq(lsb.startsWith(vec(4n)(0xfn))(v), false); // low nibble doesn't match
-            assertEq(lsb.startsWith(v)(vec(4n)(0x5n)), false); // prefix longer than vector
-            assertEq(lsb.startsWith(empty)(v), true); // empty prefix always matches
-        },
-        // MSB reads from the high end: bits 0-3 = 1111 = 0xF, bits 4-7 = 0101 = 0x5
-        msb: () => {
-            const v = vec(8n)(0xf5n);
-            assertEq(msb.startsWith(vec(4n)(0xfn))(v), true); // high nibble matches
-            assertEq(msb.startsWith(vec(4n)(0x5n))(v), false); // high nibble doesn't match
-            assertEq(msb.startsWith(v)(vec(4n)(0xfn)), false); // prefix longer than vector
-            assertEq(msb.startsWith(empty)(v), true); // empty prefix always matches
-        },
-        emptyVec: () => {
-            assertEq(lsb.startsWith(empty)(empty), true);
-            assertEq(msb.startsWith(empty)(empty), true);
-        },
-    },
-    u8ListToVec: () => {
-        // 131_072 is too much for Bun
-        const x = u8ListToVec(msb)(listRepeat(0x12)(131_071));
-        return () => {
-            const m = u8List(msb)(x);
-            const y = toArray(m);
-            if (y.length !== 131_071) {
-                throw `y.lenght: ${y.length}`;
-            }
-        };
-    },
-    tryListToVecOverflow: () => {
-        const list = [vec(maxLength)(1n), vec(1n)(1n)];
-        assertEq(lsb.tryListToVec(list), null);
-        assertEq(msb.tryListToVec(list), null);
-    },
-    listToVecOverflow: {
-        // Same oversized input, but through the throwing `listToVec` wrapper.
-        throw: () => {
-            const list = { first: vec(maxLength + 1n)(1n), tail: null };
-            lsb.listToVec(list);
-        },
-    },
-    u8ListToVecOverflow: {
-        // 131_073 bytes is 8 bits past `maxLength`; same null/throw split as
-        // `tryListToVec`/`listToVec` above, exercised through the byte-list API.
-        try: () => {
-            assertEq(tryU8ListToVec(msb)(listRepeat(0x12)(131_073)), null);
-        },
-        throw: () => {
-            u8ListToVec(msb)(listRepeat(0x12)(131_073));
-        },
-    },
-    u8ListUnaligned: () => {
-        const x = vec(9n)(0x83n);
-        const a = toArray(u8List(msb)(x));
-        if (a.length !== 2) {
-            throw `a.lenght: ${a.length}`;
-        }
-        const [a0, a1] = a;
-        if (a0 !== 0x41) {
-            throw `a0: ${a0.toString(16)}`;
-        }
-        if (a1 !== 0x80) {
-            throw `a1: ${a1.toString(16)}`;
-        }
-    },
-    chunkList: {
-        empty: () => {
-            const chunks = toArray(chunkList(lsb)(4n)(empty));
-            assertEq(chunks.length, 0);
-        },
-        // 8-bit vector 0xF5 = 0b1111_0101, aligned to 4-bit chunks
-        lsb_aligned: () => {
-            const chunks = toArray(chunkList(lsb)(4n)(vec(8n)(0xf5n)));
-            // LSB: low nibble first — bits 0-3 = 0101 = 5, bits 4-7 = 1111 = 15
-            assertEq(chunks.length, 2);
-            assert(!(length(chunks[0]) !== 4n || uint(chunks[0]) !== 5n), chunks[0]);
-            assert(!(length(chunks[1]) !== 4n || uint(chunks[1]) !== 0xfn), chunks[1]);
-        },
-        msb_aligned: () => {
-            const chunks = toArray(chunkList(msb)(4n)(vec(8n)(0xf5n)));
-            // MSB: high nibble first — bits 0-3 = 1111 = 15, bits 4-7 = 0101 = 5
-            assertEq(chunks.length, 2);
-            assert(!(length(chunks[0]) !== 4n || uint(chunks[0]) !== 0xfn), chunks[0]);
-            assert(!(length(chunks[1]) !== 4n || uint(chunks[1]) !== 5n), chunks[1]);
-        },
-        // 10-bit vector 0x1B5 = 0b01_1011_0101, unaligned to 4-bit chunks (last chunk is 2 bits)
-        lsb_unaligned: () => {
-            const chunks = toArray(chunkList(lsb)(4n)(vec(10n)(0x1b5n)));
-            // LSB: bits 0-3 = 0101 = 5, bits 4-7 = 1011 = 11, bits 8-9 = 01 = 1
-            assertEq(chunks.length, 3);
-            assert(!(length(chunks[0]) !== 4n || uint(chunks[0]) !== 5n), chunks[0]);
-            assert(!(length(chunks[1]) !== 4n || uint(chunks[1]) !== 0xbn), chunks[1]);
-            assert(!(length(chunks[2]) !== 2n || uint(chunks[2]) !== 1n), chunks[2]);
-        },
-        msb_unaligned: () => {
-            const chunks = toArray(chunkList(msb)(4n)(vec(10n)(0x1b5n)));
-            // MSB: bits 0-3 = 0110 = 6, bits 4-7 = 1101 = 13, bits 8-9 = 01 = 1
-            assertEq(chunks.length, 3);
-            assert(!(length(chunks[0]) !== 4n || uint(chunks[0]) !== 6n), chunks[0]);
-            assert(!(length(chunks[1]) !== 4n || uint(chunks[1]) !== 0xdn), chunks[1]);
-            assert(!(length(chunks[2]) !== 2n || uint(chunks[2]) !== 1n), chunks[2]);
-        },
-    },
-};

package/fjs/types/btree/find/module.f.d.ts

@@ -1,25 +0,0 @@
-/**
- * Lookup operations for persistent B-tree structures.
- *
- * @module
- */
-import type { Leaf1, Leaf2, Branch3, Branch5, TNode } from '../types/module.f.ts';
-import type { List } from '../../list/module.f.ts';
-import { type Compare } from '../../function/compare/module.f.ts';
-import type { Index3, Index5 } from "../../array/module.f.ts";
-export type FirstLeaf1<T> = readonly [Index3, Leaf1<T>];
-export type FirstBranch3<T> = readonly [1, Branch3<T>];
-export type FirstLeaf2<T> = readonly [Index5, Leaf2<T>];
-export type FirstBranch5<T> = readonly [1 | 3, Branch5<T>];
-export type First<T> = FirstLeaf1<T> | FirstBranch3<T> | FirstLeaf2<T> | FirstBranch5<T>;
-export type PathItem3<T> = readonly [0 | 2, Branch3<T>];
-export type PathItem5<T> = readonly [0 | 2 | 4, Branch5<T>];
-export type PathItem<T> = PathItem3<T> | PathItem5<T>;
-export type Path<T> = List<PathItem<T>>;
-export type Result<T> = {
-    readonly first: First<T>;
-    readonly tail: Path<T>;
-};
-export declare const find: <T>(c: Compare<T>) => (node: TNode<T>) => Result<T>;
-export declare const isFound: <T>([i]: First<T>) => boolean;
-export declare const value: <T>([i, r]: First<T>) => T | null;

package/fjs/types/btree/find/module.f.js

@@ -1,80 +0,0 @@
-import { index3, index5 } from '../../function/compare/module.f.js';
-const child = (item) => item[1][item[0]];
-export const find = (c) => {
-    const i3 = index3(c);
-    const i5 = index5(c);
-    const f = (tail) => (node) => {
-        const append = index => {
-            const first = [index, node];
-            return f({ first, tail })(child(first));
-        };
-        const done = index => ({ first: [index, node], tail });
-        switch (node.length) {
-            case 1: {
-                return done(i3(node[0]));
-            }
-            case 2: {
-                return done(i5(node));
-            }
-            case 3: {
-                const i = i3(node[1]);
-                switch (i) {
-                    case 0:
-                    case 2: {
-                        return append(i);
-                    }
-                    case 1: {
-                        return done(i);
-                    }
-                }
-            }
-            case 5: {
-                const i = i5([node[1], node[3]]);
-                switch (i) {
-                    case 0:
-                    case 2:
-                    case 4: {
-                        return append(i);
-                    }
-                    case 1:
-                    case 3: {
-                        return done(i);
-                    }
-                }
-            }
-        }
-    };
-    return f(null);
-};
-export const isFound = ([i]) => {
-    switch (i) {
-        case 1:
-        case 3: {
-            return true;
-        }
-        default: {
-            return false;
-        }
-    }
-};
-export const value = ([i, r]) => {
-    switch (i) {
-        case 1: {
-            switch (r.length) {
-                case 1:
-                case 2: {
-                    return r[0];
-                }
-                default: {
-                    return r[1];
-                }
-            }
-        }
-        case 3: {
-            return r.length === 2 ? r[1] : r[3];
-        }
-        default: {
-            return null;
-        }
-    }
-};

package/fjs/types/btree/find/proof.f.d.ts

@@ -1,3 +0,0 @@
-declare const test: () => void;
-export declare const proof: typeof test;
-export {};

package/fjs/types/btree/find/proof.f.js

@@ -1,108 +0,0 @@
-import { find as btreeFind } from './module.f.js';
-import { map, toArray } from '../../list/module.f.js';
-import { stringify } from '../../../media/json/module.f.js';
-import { sort } from '../../object/module.f.js';
-import {} from '../types/module.f.js';
-import { cmp } from '../../string/module.f.js';
-import { set as setSet } from '../set/module.f.js';
-import { assertEq } from '../../../asserts/module.f.js';
-const jsonStr = stringify(sort);
-const set = node => value => setSet(cmp(value))(() => value)(node);
-const str = r => jsonStr(toArray(map((x) => x[0])(r)));
-const find = i => m => str(btreeFind(cmp(i))(m));
-const test = () => {
-    let _map = ['1'];
-    for (let i = 2; i <= 10; i++) {
-        _map = set(_map)((i * i).toString());
-    }
-    {
-        const s = jsonStr(_map);
-        assertEq(s, '[[["1","100"],"16",["25","36"]],"4",[["49"],"64",["81","9"]]]');
-    }
-    //
-    {
-        const r = find("0")(_map);
-        assertEq(r, '[0,0,0]');
-    }
-    {
-        const r = find("1")(_map);
-        assertEq(r, '[1,0,0]');
-    }
-    {
-        const r = find("10")(_map);
-        assertEq(r, '[2,0,0]');
-    }
-    {
-        const r = find("100")(_map);
-        assertEq(r, '[3,0,0]');
-    }
-    {
-        const r = find("12")(_map);
-        assertEq(r, '[4,0,0]');
-    }
-    {
-        const r = find("16")(_map);
-        assertEq(r, '[1,0]');
-    }
-    {
-        const r = find("17")(_map);
-        assertEq(r, '[0,2,0]');
-    }
-    {
-        const r = find("25")(_map);
-        assertEq(r, '[1,2,0]');
-    }
-    {
-        const r = find("26")(_map);
-        assertEq(r, '[2,2,0]');
-    }
-    {
-        const r = find("36")(_map);
-        assertEq(r, '[3,2,0]');
-    }
-    {
-        const r = find("37")(_map);
-        assertEq(r, '[4,2,0]');
-    }
-    {
-        const r = find("4")(_map);
-        assertEq(r, '[1]');
-    }
-    {
-        const r = find("41")(_map);
-        assertEq(r, '[0,0,2]');
-    }
-    {
-        const r = find("49")(_map);
-        assertEq(r, '[1,0,2]');
-    }
-    {
-        const r = find("5")(_map);
-        assertEq(r, '[2,0,2]');
-    }
-    {
-        const r = find("64")(_map);
-        assertEq(r, '[1,2]');
-    }
-    {
-        const r = find("65")(_map);
-        assertEq(r, '[0,2,2]');
-    }
-    {
-        const r = find("81")(_map);
-        assertEq(r, '[1,2,2]');
-    }
-    {
-        const r = find("85")(_map);
-        assertEq(r, '[2,2,2]');
-    }
-    {
-        const r = find("9")(_map);
-        assertEq(r, '[3,2,2]');
-    }
-    {
-        const r = find("91")(_map);
-        assertEq(r, '[4,2,2]');
-    }
-};
-export const proof = test;

package/fjs/types/btree/module.f.d.ts

@@ -1,9 +0,0 @@
-/**
- * Core persistent B-tree construction and traversal helpers.
- *
- * @module
- */
-import { type List } from '../list/module.f.ts';
-import type { Tree } from './types/module.f.ts';
-export declare const empty: null;
-export declare const values: <T>(tree: Tree<T>) => List<T>;