functionalscript 0.2.6 → 0.3.0

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

@@ -1,210 +0,0 @@
-import { empty, vec, length, concatLsb, uintLsb, uintMsb, removeLsb, concatMsb, removeMsb, uint, popUintLsb, popUintMsb } from './module.f.mjs';
-export default {
-    examples: {
-        vec: () => {
-            const vec4 = vec(4n);
-            const v0 = vec4(5n); // 0x15n
-            if (v0 !== 0x15n) {
-                throw v0;
-            }
-            const v1 = vec4(0x5fen); // 0x1En
-            if (v1 !== 0x1en) {
-                throw v1;
-            }
-        },
-        uint: () => {
-            const vector = vec(8n)(0x5n); // 0x105n
-            if (vector !== 0x105n) {
-                throw vector;
-            }
-            const result = uint(vector); // result is 0x5n
-            if (result !== 0x5n) {
-                throw result;
-            }
-        },
-        uintLsb: () => {
-            const vector = vec(8n)(0xf5n); // 0x1F5n
-            if (vector !== 0x1f5n) {
-                throw vector;
-            }
-            const result = uintLsb(4n)(vector); // result is 5n
-            if (result !== 5n) {
-                throw result;
-            }
-            const result2 = uintLsb(16n)(vector); // result2 is 0xF5n
-            if (result2 !== 0xf5n) {
-                throw result2;
-            }
-        },
-        uintMsb: () => {
-            const vector = vec(8n)(0xf5n); // 0x1F5n
-            if (vector !== 0x1f5n) {
-                throw vector;
-            }
-            const result = uintMsb(4n)(vector); // result is 0xFn
-            if (result !== 0xfn) {
-                throw result;
-            }
-            const result2 = uintMsb(16n)(vector); // result2 is 0xF500n
-            if (result2 !== 0xf500n) {
-                throw result2;
-            }
-        },
-        popUintLsb: () => {
-            const vector = vec(8n)(0xf5n); // 0x1F5n
-            const [result, rest] = popUintLsb(4n)(vector); // result is 5n, rest is 0x1Fn
-            if (result !== 5n) {
-                throw result;
-            }
-            if (rest !== 0x1fn) {
-                throw rest;
-            }
-            const [result2, rest2] = popUintLsb(16n)(vector); // result2 is 0xF5n, rest2 is 1n
-            if (result2 !== 0xf5n) {
-                throw result2;
-            }
-            if (rest2 !== 1n) {
-                throw rest2;
-            }
-        },
-        popUintMsb: () => {
-            const vector = vec(8n)(0xf5n); // 0x1F5n
-            const [result, rest] = popUintMsb(4n)(vector); // [0xFn, 0x15n]
-            if (result !== 0xfn) {
-                throw result;
-            }
-            if (rest !== 0x15n) {
-                throw rest;
-            }
-            const [result2, rest2] = popUintMsb(16n)(vector); // [0xF500n, 1n]
-            if (result2 !== 0xf500n) {
-                throw result2;
-            }
-            if (rest2 !== 1n) {
-                throw rest2;
-            }
-        },
-        concatLsb: () => {
-            const u8 = vec(8n);
-            const a = u8(0x45n); // 0x145n
-            if (a !== 0x145n) {
-                throw a;
-            }
-            const b = u8(0x89n); // 0x189n
-            if (b !== 0x189n) {
-                throw b;
-            }
-            const ab = concatLsb(a)(b); // 0x18945n
-            if (ab !== 0x18945n) {
-                throw ab;
-            }
-        },
-        concatMsb: () => {
-            const u8 = vec(8n);
-            const a = u8(0x45n); // 0x145n
-            if (a !== 0x145n) {
-                throw a;
-            }
-            const b = u8(0x89n); // 0x189n
-            if (b !== 0x189n) {
-                throw b;
-            }
-            const ab = concatMsb(a)(b); // 0x14589n
-            if (ab !== 0x14589n) {
-                throw ab;
-            }
-        },
-        removeLsb: () => {
-            const v = vec(16n)(0x3456n); // 0x13456n
-            if (v !== 0x13456n) {
-                throw v;
-            }
-            const r = removeLsb(4n)(v); // 0x1345n
-            if (r !== 0x1345n) {
-                throw r;
-            }
-            const r2 = removeLsb(24n)(v); // 0x1n
-            if (r2 !== 0x1n) {
-                throw r2;
-            }
-        },
-        removeMsb: () => {
-            const v = vec(16n)(0x3456n); // 0x13456n
-            if (v !== 0x13456n) {
-                throw v;
-            }
-            const r = removeMsb(4n)(v); // 0x1456n
-            if (r !== 0x1456n) {
-                throw r;
-            }
-            const r2 = removeMsb(24n)(v); // 0x1n
-            if (r2 !== 0x1n) {
-                throw r2;
-            }
-        }
-    },
-    uintLsb: () => {
-        const vector = 117n;
-        const extract3Bits = uintLsb(3n);
-        const result = extract3Bits(vector); // result is 0b101n (5n)
-        if (result !== 5n) {
-            throw result;
-        }
-    },
-    uintSmall: () => {
-        const vector = 3n;
-        const extract3Bits = uintLsb(3n)(vector);
-        if (extract3Bits !== 1n) {
-            throw extract3Bits;
-        }
-    },
-    vecExample: () => {
-        const createVector = vec(4n);
-        const vector = createVector(5n); // vector is 0b10101n
-        if (vector !== 21n) {
-            throw vector;
-        }
-    },
-    length: () => {
-        const i = length(empty);
-        if (i !== 0n) {
-            throw i;
-        }
-    },
-    bitset: () => {
-        const v = vec(8n)(0x5fen);
-        if (v !== 0x1fen) {
-            throw v;
-        }
-        if (length(v) !== 8n) {
-            throw 'len';
-        }
-        const u = uintLsb(8n)(v);
-        if (u !== 0xfen) {
-            throw v;
-        }
-    },
-    appendBack: () => {
-        const vec8 = vec(8n);
-        const a = vec8(0x345n);
-        const b = vec8(0x789n);
-        const ab = concatLsb(a)(b);
-        if (ab !== 0x18945n) {
-            throw ab;
-        }
-        const s = length(ab);
-        if (s !== 16n) {
-            throw `appendBack: ${s}`;
-        }
-    },
-    removeBack: () => {
-        const v = vec(17n)(0x12345n);
-        if (v !== 0x32345n) {
-            throw v.toString(16);
-        }
-        const r = removeLsb(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;

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

@@ -1,156 +0,0 @@
-import * as _ from './module.f.mjs';
-import * as list from '../../list/module.f.mjs';
-import * as json from '../../../json/module.f.mjs';
-import * as o from '../../object/module.f.mjs';
-const { sort } = o;
-import * as btree from '../types/module.f.mjs';
-import * as string from '../../string/module.f.mjs';
-const { cmp } = string;
-import * as s from '../set/module.f.mjs';
-const jsonStr = json.stringify(sort);
-/** @type {(node: btree.Node<string>) => (value: string) => btree.Node<string>} */
-const set = node => value => s.set(cmp(value))(() => value)(node);
-/** @type {(r: _.Result<json.Unknown>) => string} */
-const str = r => jsonStr(list.toArray(list.map(x => x[0])(r)));
-/** @type {(i: string) => (m: btree.Node<string>) => string} */
-const find = i => m => str(_.find(cmp(i))(m));
-const test = () => {
-    /** @type {btree.Node<string>} */
-    let _map = ['1'];
-    for (let i = 2; i <= 10; i++)
-        _map = set(_map)((i * i).toString());
-    {
-        const s = jsonStr(_map);
-        if (s !== '[[["1","100"],"16",["25","36"]],"4",[["49"],"64",["81","9"]]]') {
-            throw s;
-        }
-    }
-    //
-    {
-        const r = find("0")(_map);
-        if (r !== '[0,0,0]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("1")(_map);
-        if (r !== '[1,0,0]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("10")(_map);
-        if (r !== '[2,0,0]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("100")(_map);
-        if (r !== '[3,0,0]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("12")(_map);
-        if (r !== '[4,0,0]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("16")(_map);
-        if (r !== '[1,0]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("17")(_map);
-        if (r !== '[0,2,0]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("25")(_map);
-        if (r !== '[1,2,0]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("26")(_map);
-        if (r !== '[2,2,0]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("36")(_map);
-        if (r !== '[3,2,0]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("37")(_map);
-        if (r !== '[4,2,0]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("4")(_map);
-        if (r !== '[1]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("41")(_map);
-        if (r !== '[0,0,2]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("49")(_map);
-        if (r !== '[1,0,2]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("5")(_map);
-        if (r !== '[2,0,2]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("64")(_map);
-        if (r !== '[1,2]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("65")(_map);
-        if (r !== '[0,2,2]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("81")(_map);
-        if (r !== '[1,2,2]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("85")(_map);
-        if (r !== '[2,2,2]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("9")(_map);
-        if (r !== '[3,2,2]') {
-            throw r;
-        }
-    }
-    {
-        const r = find("91")(_map);
-        if (r !== '[4,2,2]') {
-            throw r;
-        }
-    }
-};
-export default test;

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

@@ -1,5 +0,0 @@
-export const empty: null;
-/** @type {<T>(tree: _.Tree<T>) => list.List<T>} */
-export const values: <T>(tree: _.Tree<T>) => list.List<T>;
-import * as _ from './types/module.f.mjs';
-import * as list from '../list/module.f.mjs';

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

@@ -1,34 +0,0 @@
-// @ts-self-types="./module.f.d.mts"
-import * as list from '../list/module.f.mjs';
-const { flat } = list;
-import * as n from '../nullable/module.f.mjs';
-const { map } = n;
-import * as _ from './types/module.f.mjs';
-/** @type {<T>(node: _.Node<T>) => list.Thunk<T>} */
-const nodeValues = node => () => {
-    switch (node.length) {
-        case 1:
-        case 2: {
-            return node;
-        }
-        case 3: {
-            return flat([
-                nodeValues(node[0]),
-                [node[1]],
-                nodeValues(node[2])
-            ]);
-        }
-        default: {
-            return flat([
-                nodeValues(node[0]),
-                [node[1]],
-                nodeValues(node[2]),
-                [node[3]],
-                nodeValues(node[4])
-            ]);
-        }
-    }
-};
-export const empty = null;
-/** @type {<T>(tree: _.Tree<T>) => list.List<T>} */
-export const values = map(nodeValues);

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

@@ -1,14 +0,0 @@
-/** @type {<T>(c: Cmp.Compare<T>) => (node: _.Node<T>) => _.Tree<T>} */
-export const nodeRemove: <T>(c: Cmp.Compare<T>) => (node: _.Node<T>) => _.Tree<T>;
-/** @type {<T>(c: Cmp.Compare<T>) => (tree: _.Tree<T>) => _.Tree<T>} */
-export const remove: <T>(c: Cmp.Compare<T>) => (tree: _.Tree<T>) => _.Tree<T>;
-export type Leaf01<T> = null | _.Leaf1<T>;
-export type RemovePath<T> = {
-    readonly first: Leaf01<T>;
-    readonly tail: find.Path<T>;
-};
-export type Branch<T> = _.Branch1<T> | _.Branch3<T> | _.Branch5<T>;
-export type Merge<A, T> = (a: A) => (n: _.Branch3<T>) => _.Branch1<T> | _.Branch3<T>;
-import * as Cmp from '../../function/compare/module.f.mjs';
-import * as _ from '../types/module.f.mjs';
-import * as find from '../find/module.f.mjs';