functionalscript 0.2.5 → 0.3.0

package/out/types/bigint/test.f.d.mts

@@ -1,16 +0,0 @@
-declare namespace _default {
-    function sum(): void;
-    let abs: (() => void)[];
-    let serialize: (() => void)[];
-    let log2: (() => void)[];
-    function toString2(): void;
-    function minus(): void;
-    function not(): void;
-    let bitLen: {
-        0: () => void;
-        m: () => void;
-        big: () => void;
-        neg: (() => void)[];
-    };
-}
-export default _default;

package/out/types/bigint/test.f.mjs

@@ -1,199 +0,0 @@
-import * as _ from './module.f.mjs';
-const { sum, abs, serialize, log2, bitLength } = _;
-export default {
-    sum: () => {
-        const result = sum([2n, 3n, 4n, 5n]);
-        if (result !== 14n) {
-            throw result;
-        }
-    },
-    abs: [
-        () => {
-            const result = abs(10n);
-            if (result !== 10n) {
-                throw result;
-            }
-        },
-        () => {
-            const result = abs(-10n);
-            if (result !== 10n) {
-                throw result;
-            }
-        }
-    ],
-    serialize: [
-        () => {
-            const result = serialize(0n);
-            if (result !== '0n') {
-                throw result;
-            }
-        },
-        () => {
-            const result = serialize(123456789012345678901234567890n);
-            if (result !== '123456789012345678901234567890n') {
-                throw result;
-            }
-        },
-        () => {
-            const result = serialize(-55555n);
-            if (result !== '-55555n') {
-                throw result;
-            }
-        },
-    ],
-    log2: [
-        () => {
-            const result = log2(-3n);
-            if (result !== -1n) {
-                throw result;
-            }
-        },
-        () => {
-            const result = log2(0n);
-            if (result !== -1n) {
-                throw result;
-            }
-        },
-        () => {
-            const result = log2(1n);
-            if (result !== 0n) {
-                throw result;
-            }
-        },
-        () => {
-            const result = log2(2n);
-            if (result !== 1n) {
-                throw result;
-            }
-        },
-        () => {
-            const result = log2(3n);
-            if (result !== 1n) {
-                throw result;
-            }
-        },
-        () => {
-            const result = log2(4n);
-            if (result !== 2n) {
-                throw result;
-            }
-        },
-        () => {
-            const result = log2(7n);
-            if (result !== 2n) {
-                throw result;
-            }
-        },
-        () => {
-            const result = log2(8n);
-            if (result !== 3n) {
-                throw result;
-            }
-        },
-        () => {
-            const result = log2(15n);
-            if (result !== 3n) {
-                throw result;
-            }
-        },
-        () => {
-            const result = log2(16n);
-            if (result !== 4n) {
-                throw result;
-            }
-        },
-        () => {
-            // max for Bun (131_072 Bytes)
-            const v = 1048575n;
-            const result = log2(1n << v);
-            if (result !== v) {
-                throw result;
-            }
-        },
-        () => {
-            const v = 0x18945n;
-            const result = log2(v);
-            if (result !== 16n) {
-                throw result;
-            }
-        }
-    ],
-    toString2: () => {
-        // max for Bun (131_072 Bytes)
-        const v = 1048575n;
-        const result = (1n << v).toString(2).length - 1;
-        if (result !== 1_048_575) {
-            throw result;
-        }
-    },
-    minus: () => {
-        let i = 0n;
-        while (i < 1048575n) {
-            const s = -i;
-            if (i !== -s) {
-                throw [i, s];
-            }
-            i += 1n;
-        }
-    },
-    not: () => {
-        let i = 0n;
-        while (i < 1048575n) {
-            const s = ~i;
-            if (i !== ~s) {
-                throw [i, s];
-            }
-            i += 1n;
-        }
-    },
-    bitLen: {
-        0: () => {
-            const s = bitLength(0n);
-            if (s !== 0n) {
-                throw s;
-            }
-        },
-        m: () => {
-            let i = 0n;
-            while (i < 10000n) {
-                const s = bitLength(1n << i);
-                if (s !== i + 1n) {
-                    throw [s, i];
-                }
-                i += 1n;
-            }
-        },
-        big: () => {
-            const s = bitLength(1n << 1000000n);
-            if (s !== 1000001n) {
-                throw s;
-            }
-        },
-        neg: [
-            () => {
-                const s = bitLength(-1n);
-                if (s !== 1n) {
-                    throw s;
-                }
-            },
-            () => {
-                const s = bitLength(-2n);
-                if (s !== 2n) {
-                    throw s;
-                }
-            },
-            () => {
-                const s = bitLength(-3n);
-                if (s !== 2n) {
-                    throw s;
-                }
-            },
-            () => {
-                const s = bitLength(-4n);
-                if (s !== 3n) {
-                    throw s;
-                }
-            },
-        ]
-    }
-};

package/out/types/bit_vec/module.f.d.mts

@@ -1,72 +0,0 @@
-/**
- * A vector of bits represented as a `bigint`.
- *
- * @typedef {bigint} Vec
- */
-/**
- * An empty vector of bits.
- */
-export const empty: 1n;
-/**
- * Calculates the length of the given vector of bits.
- */
-export const len: (v: bigint) => bigint;
-/**
- * Extract an unsigned integer of the given `uintLen` from the given vector.
- *
- * @type {(uintLen: bigint) => (v: Vec) => bigint}
- *
- * @example
- *
- * ```js
- * const vector = 0b110101n;
- * const extract3Bits = uint(3n);
- * const result = extract3Bits(vector); // result is 0b101n (5n)
- * ```
- */
-export const uint: (uintLen: bigint) => (v: Vec) => bigint;
-/**
- * Creates a vector of bits of the given `vecLen` from the given unsigned integer.
- *
- * @type {(vecLen: bigint) => (ui: bigint) => Vec}
- *
- * @example
- *
- * ```js
- * const createVector = vec(4n);
- * const vector = createVector(5n); // vector is 0b10101n
- * ```
- */
-export const vec: (vecLen: bigint) => (ui: bigint) => Vec;
-/**
- * Appends the vector `b` to the back of the vector `a`.
- *
- * @type {(a: Vec) => (b: Vec) => Vec}
- *
- * @example
- *
- * ```js
- * const vec8 = vec(8n)
- * const a = vec8(0x345n)
- * const b = vec8(0x789n)
- * const ab = appendBack(a)(b) // 0x18945n
- * ```
- */
-export const appendBack: (a: Vec) => (b: Vec) => Vec;
-/**
- * Removes the first `len` bits from the given vector.
- *
- * @type {(len: bigint) => (v: Vec) => Vec}
- *
- * @example
- *
- * ```js
- * const v = vec(17n)(0x12345n) // v = 0x32345n
- * const r = removeFront(9n)(v) // r = 0x191n
- * ```
- */
-export const removeFront: (len: bigint) => (v: Vec) => Vec;
-/**
- * A vector of bits represented as a `bigint`.
- */
-export type Vec = bigint;

package/out/types/bit_vec/module.f.mjs

@@ -1,83 +0,0 @@
-// @ts-self-types="./module.f.d.mts"
-import { log2 } from '../bigint/module.f.mjs';
-/**
- * A vector of bits represented as a `bigint`.
- *
- * @typedef {bigint} Vec
- */
-/**
- * An empty vector of bits.
- */
-export const empty = 1n;
-/**
- * Calculates the length of the given vector of bits.
- */
-export const len = log2;
-/**
- * Extract an unsigned integer of the given `uintLen` from the given vector.
- *
- * @type {(uintLen: bigint) => (v: Vec) => bigint}
- *
- * @example
- *
- * ```js
- * const vector = 0b110101n;
- * const extract3Bits = uint(3n);
- * const result = extract3Bits(vector); // result is 0b101n (5n)
- * ```
- */
-export const uint = uintLen => {
-    const mask = (1n << uintLen) - 1n;
-    return data => data & mask;
-};
-/**
- * Creates a vector of bits of the given `vecLen` from the given unsigned integer.
- *
- * @type {(vecLen: bigint) => (ui: bigint) => Vec}
- *
- * @example
- *
- * ```js
- * const createVector = vec(4n);
- * const vector = createVector(5n); // vector is 0b10101n
- * ```
- */
-export const vec = vecLen => {
-    const stop = 1n << vecLen;
-    const mask = stop - 1n;
-    return data => (data & mask) | stop;
-};
-/**
- * Appends the vector `b` to the back of the vector `a`.
- *
- * @type {(a: Vec) => (b: Vec) => Vec}
- *
- * @example
- *
- * ```js
- * const vec8 = vec(8n)
- * const a = vec8(0x345n)
- * const b = vec8(0x789n)
- * const ab = appendBack(a)(b) // 0x18945n
- * ```
- */
-export const appendBack = a => {
-    const aLen = len(a);
-    return b => a | (b << aLen);
-};
-/**
- * Removes the first `len` bits from the given vector.
- *
- * @type {(len: bigint) => (v: Vec) => Vec}
- *
- * @example
- *
- * ```js
- * const v = vec(17n)(0x12345n) // v = 0x32345n
- * const r = removeFront(9n)(v) // r = 0x191n
- * ```
- */
-export const removeFront = len => v => {
-    const r = v >> len;
-    return r === 0n ? empty : r;
-};

package/out/types/bit_vec/test.f.d.mts

@@ -1,9 +0,0 @@
-declare namespace _default {
-    function uintExample(): void;
-    function vecExample(): void;
-    function length(): void;
-    function bitset(): void;
-    function appendBack(): void;
-    function removeBack(): void;
-}
-export default _default;

package/out/types/bit_vec/test.f.mjs

@@ -1,60 +0,0 @@
-import { empty, len, appendBack, vec, uint, removeFront } from './module.f.mjs';
-export default {
-    uintExample: () => {
-        const vector = 53n;
-        const extract3Bits = uint(3n);
-        const result = extract3Bits(vector); // result is 0b101n (5n)
-        if (result !== 5n) {
-            throw result;
-        }
-    },
-    vecExample: () => {
-        const createVector = vec(4n);
-        const vector = createVector(5n); // vector is 0b10101n
-        if (vector !== 21n) {
-            throw vector;
-        }
-    },
-    length: () => {
-        const i = len(empty);
-        if (i !== 0n) {
-            throw i;
-        }
-    },
-    bitset: () => {
-        const v = vec(8n)(0x5fen);
-        if (v !== 0x1fen) {
-            throw v;
-        }
-        if (len(v) !== 8n) {
-            throw 'len';
-        }
-        const u = uint(8n)(v);
-        if (u !== 0xfen) {
-            throw v;
-        }
-    },
-    appendBack: () => {
-        const vec8 = vec(8n);
-        const a = vec8(0x345n);
-        const b = vec8(0x789n);
-        const ab = appendBack(a)(b);
-        if (ab !== 0x18945n) {
-            throw ab;
-        }
-        const s = len(ab);
-        if (s !== 16n) {
-            throw `appendBack: ${s}`;
-        }
-    },
-    removeBack: () => {
-        const v = vec(17n)(0x12345n);
-        if (v !== 0x32345n) {
-            throw v.toString(16);
-        }
-        const r = removeFront(9n)(v);
-        if (r !== 0x191n) {
-            throw r.toString(16);
-        }
-    }
-};

package/out/types/btree/find/module.f.d.mts

@@ -1,36 +0,0 @@
-/**
- * @template T
- * @typedef {List.List<PathItem<T>>} Path
- */
-/**
- * @template T
- * @typedef {{
- *  readonly first: First<T>,
- *  readonly tail: Path<T>
- * }} Result<T>
- */
-/** @type {<T>(c: cmp.Compare<T>) => (node: _.Node<T>) => Result<T>} */
-export const find: <T>(c: cmp.Compare<T>) => (node: _.Node<T>) => Result<T>;
-/** @type {<T>(first: First<T>) => boolean} */
-export const isFound: <T>(first: First<T>) => boolean;
-/** @type {<T>(first: First<T>) => T | null} */
-export const value: <T>(first: First<T>) => T | null;
-export type FirstLeaf1<T> = readonly [cmp.Index3, _.Leaf1<T>];
-export type FirstBranch3<T> = readonly [1, _.Branch3<T>];
-export type FirstLeaf2<T> = readonly [cmp.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.List<PathItem<T>>;
-/**
- * <T>
- */
-export type Result<T> = {
-    readonly first: First<T>;
-    readonly tail: Path<T>;
-};
-import * as cmp from '../../function/compare/module.f.mjs';
-import * as _ from '../types/module.f.mjs';
-import * as List from '../../list/module.f.mjs';

package/out/types/btree/find/module.f.mjs

@@ -1,137 +0,0 @@
-// @ts-self-types="./module.f.d.mts"
-import * as _ from '../types/module.f.mjs';
-import * as List from '../../list/module.f.mjs';
-import * as cmp from '../../function/compare/module.f.mjs';
-const { index3, index5 } = cmp;
-import * as Array from '../../array/module.f.mjs';
-/**
- * @template T
- * @typedef {readonly[cmp.Index3, _.Leaf1<T>]} FirstLeaf1
- */
-/**
- * @template T
- * @typedef {readonly[1, _.Branch3<T>]} FirstBranch3
- */
-/**
- * @template T
- * @typedef {readonly[cmp.Index5, _.Leaf2<T>]} FirstLeaf2
- */
-/**
- * @template T
- * @typedef {readonly[1|3, _.Branch5<T>]} FirstBranch5
- */
-/**
- * @template T
- * @typedef {FirstLeaf1<T> | FirstBranch3<T> | FirstLeaf2<T> | FirstBranch5<T>} First
- */
-/**
- * @template T
- * @typedef {readonly[0|2, _.Branch3<T>]} PathItem3
- */
-/**
- * @template T
- * @typedef {readonly[0|2|4, _.Branch5<T>]} PathItem5
- */
-/**
- * @template T
- * @typedef {PathItem3<T> | PathItem5<T>} PathItem
- */
-/** @type {<T>(item: PathItem<T>) => _.Node<T>} */
-const child = item => 
-/** @type {typeof item extends PathItem<infer T> ? _.Node<T> : never} */ (item[1][item[0]]);
-/**
- * @template T
- * @typedef {List.List<PathItem<T>>} Path
- */
-/**
- * @template T
- * @typedef {{
- *  readonly first: First<T>,
- *  readonly tail: Path<T>
- * }} Result<T>
- */
-/** @type {<T>(c: cmp.Compare<T>) => (node: _.Node<T>) => Result<T>} */
-export const find = c => {
-    const i3 = index3(c);
-    const i5 = index5(c);
-    /** @typedef {typeof c extends cmp.Compare<infer T> ? T : never} T */
-    /** @type {(prior: Path<T>) => (node: _.Node<T>) => Result<T>} */
-    const f = tail => node => {
-        /** @type {(index: Array.KeyOf<typeof node>) => Result<T>} */
-        const append = index => {
-            const first = /** @type {PathItem<T>} */ ([index, node]);
-            return f({ first, tail })(child(first));
-        };
-        /** @type {(index: Array.KeyOf<typeof node>) => Result<T>} */
-        const done = index => ({ first: /** @type {First<T>} */ ([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);
-};
-/** @type {<T>(first: First<T>) => boolean} */
-export const isFound = ([i]) => {
-    switch (i) {
-        case 1:
-        case 3: {
-            return true;
-        }
-        default: {
-            return false;
-        }
-    }
-};
-/** @type {<T>(first: First<T>) => T | null} */
-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/out/types/btree/find/test.f.d.mts

@@ -1,2 +0,0 @@
-export default test;
-declare function test(): void;