functionalscript 0.2.0 → 0.2.2

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

@@ -0,0 +1,114 @@
+// @ts-self-types="./module.f.d.mts"
+import * as _ from '../types/module.f.mjs';
+import * as btreeFind from '../find/module.f.mjs';
+const { find } = btreeFind;
+import * as Cmp from '../../function/compare/module.f.mjs';
+import * as list from '../../list/module.f.mjs';
+const { fold } = list;
+/**
+ * @template T
+ * @typedef {_.Branch1<T> | _.Branch3<T>} Branch1To3
+ */
+/** @type {<T>(b: _.Branch5<T> | _.Branch7<T>) => Branch1To3<T>} */
+const b57 = b => b.length === 5 ? [b] : [[b[0], b[1], b[2]], b[3], [b[4], b[5], b[6]]];
+/** @type {<T>(i: btreeFind.PathItem<T>) => (a: Branch1To3<T>) => Branch1To3<T>} */
+const reduceOp = ([i, x]) => a => {
+    switch (i) {
+        case 0: {
+            switch (x.length) {
+                case 3: {
+                    return [[...a, x[1], x[2]]];
+                }
+                case 5: {
+                    return b57([...a, x[1], x[2], x[3], x[4]]);
+                }
+            }
+        }
+        case 2: {
+            switch (x.length) {
+                case 3: {
+                    return [[x[0], x[1], ...a]];
+                }
+                case 5: {
+                    return b57([x[0], x[1], ...a, x[3], x[4]]);
+                }
+            }
+        }
+        case 4: {
+            return b57([x[0], x[1], x[2], x[3], ...a]);
+        }
+    }
+};
+const reduceBranch = fold(reduceOp);
+/** @type {<T>(c: Cmp.Compare<T>) => (g: (value: T | null) => T) => (node: _.Node<T>) => _.Node<T>} */
+const nodeSet = c => g => node => {
+    const { first, tail } = find(c)(node);
+    const [i, x] = first;
+    /** @typedef {typeof c extends Cmp.Compare<infer T> ? T : never} T */
+    /** @type {() => Branch1To3<T>} */
+    const f = () => {
+        switch (i) {
+            case 0: {
+                // insert
+                const value = g(null);
+                switch (x.length) {
+                    case 1: {
+                        return [[value, x[0]]];
+                    }
+                    case 2: {
+                        return [[value], x[0], [x[1]]];
+                    }
+                }
+            }
+            case 1: {
+                // replace
+                switch (x.length) {
+                    case 1: {
+                        return [[g(x[0])]];
+                    }
+                    case 2: {
+                        return [[g(x[0]), x[1]]];
+                    }
+                    case 3: {
+                        return [[x[0], g(x[1]), x[2]]];
+                    }
+                    case 5: {
+                        return [[x[0], g(x[1]), x[2], x[3], x[4]]];
+                    }
+                }
+            }
+            case 2: {
+                // insert
+                const value = g(null);
+                switch (x.length) {
+                    case 1: {
+                        return [[x[0], value]];
+                    }
+                    case 2: {
+                        return [[x[0]], value, [x[1]]];
+                    }
+                }
+            }
+            case 3: {
+                // replace
+                switch (x.length) {
+                    case 2: {
+                        return [[x[0], g(x[1])]];
+                    }
+                    case 5: {
+                        return [[x[0], x[1], x[2], g(x[3]), x[4]]];
+                    }
+                }
+            }
+            case 4: {
+                // insert
+                const [v0, v1] = x;
+                return [[v0], v1, [g(null)]];
+            }
+        }
+    };
+    const r = reduceBranch(f())(tail);
+    return r.length === 1 ? r[0] : r;
+};
+/** @type {<T>(c: Cmp.Compare<T>) => (f: (value: T|null) => T) => (tree: _.Tree<T>) => _.Node<T>} */
+export const set = c => f => tree => tree === null ? [f(null)] : nodeSet(c)(f)(tree);

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

@@ -0,0 +1,390 @@
+import * as _ from './module.f.mjs';
+import * as BTree from '../types/module.f.mjs';
+import * as s from '../../string/module.f.mjs';
+const { cmp } = s;
+import * as json from '../../../json/module.f.mjs';
+import * as o from '../../object/module.f.mjs';
+const { sort } = o;
+/** @type {(node: BTree.Node<string>) => (value: string) => BTree.Node<string>} */
+const set = node => value => _.set(cmp(value))(() => value)(node);
+const jsonStr = json.stringify(sort);
+const test = [
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 10; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !== '[[["1","100"],"16",["25","36"]],"4",[["49"],"64",["81","9"]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 11; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !== '[[["1"],"100",["121"],"16",["25","36"]],"4",[["49"],"64",["81","9"]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 12; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !== '[[["1"],"100",["121","144"],"16",["25","36"]],"4",[["49"],"64",["81","9"]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 13; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !== '[[["1"],"100",["121","144"]],"16",[["169"],"25",["36"]],"4",[["49"],"64",["81","9"]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 14; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !== '[[["1"],"100",["121","144"]],"16",[["169","196"],"25",["36"]],"4",[["49"],"64",["81","9"]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 15; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !== '[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"],"25",["36"]],"4",[["49"],"64",["81","9"]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 16; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !== '[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"],"25",["256","36"]],"4",[["49"],"64",["81","9"]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 17; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !== '[[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"]]],"25",[[["256"],"289",["36"]],"4",[["49"],"64",["81","9"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 18; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"]]],"25",[[["256"],"289",["324","36"]],"4",[["49"],"64",["81","9"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 19; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"]]],"25",[[["256"],"289",["324"],"36",["361"]],"4",[["49"],"64",["81","9"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 20; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400","49"],"64",["81","9"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 21; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["49"],"64",["81","9"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 22; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484","49"],"64",["81","9"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 23; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]],"49",[["529"],"64",["81","9"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 24; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]],"49",[["529","576"],"64",["81","9"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 25; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]],"49",[["529"],"576",["625"],"64",["81","9"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 26; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]]],' +
+                '"49",' +
+                '[[["529"],"576",["625"]],"64",[["676"],"81",["9"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 27; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]]],' +
+                '"49",' +
+                '[[["529"],"576",["625"]],"64",[["676","729"],"81",["9"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 28; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]]],' +
+                '"49",' +
+                '[[["529"],"576",["625"]],"64",[["676"],"729",["784"],"81",["9"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 29; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]]],' +
+                '"49",' +
+                '[[["529"],"576",["625"]],"64",[["676"],"729",["784"],"81",["841","9"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 30; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]]],' +
+                '"49",' +
+                '[[["529"],"576",["625"]],"64",[["676"],"729",["784"]],"81",[["841"],"9",["900"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 31; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["121","144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]]],' +
+                '"49",' +
+                '[[["529"],"576",["625"]],"64",[["676"],"729",["784"]],"81",[["841"],"9",["900","961"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 32; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["1024"],"121",["144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]]],' +
+                '"49",' +
+                '[[["529"],"576",["625"]],"64",[["676"],"729",["784"]],"81",[["841"],"9",["900","961"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 33; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["1024","1089"],"121",["144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]]],' +
+                '"49",' +
+                '[[["529"],"576",["625"]],"64",[["676"],"729",["784"]],"81",[["841"],"9",["900","961"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 34; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["1024"]],"1089",[["1156"],"121",["144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]]],' +
+                '"49",' +
+                '[[["529"],"576",["625"]],"64",[["676"],"729",["784"]],"81",[["841"],"9",["900","961"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 35; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["1024"]],"1089",[["1156"],"121",["1225","144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]]],' +
+                '"49",' +
+                '[[["529"],"576",["625"]],"64",[["676"],"729",["784"]],"81",[["841"],"9",["900","961"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 36; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["1024"]],"1089",[["1156"],"121",["1225"],"1296",["144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]]],' +
+                '"49",' +
+                '[[["529"],"576",["625"]],"64",[["676"],"729",["784"]],"81",[["841"],"9",["900","961"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 37; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[["1"],"100",["1024"]],"1089",[["1156"],"121",["1225"],"1296",["1369","144"]],"16",[["169"],"196",["225"]]],' +
+                '"25",' +
+                '[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]]],' +
+                '"49",' +
+                '[[["529"],"576",["625"]],"64",[["676"],"729",["784"]],"81",[["841"],"9",["900","961"]]]]') {
+            throw r;
+        }
+    },
+    () => {
+        /** @type {BTree.Node<string>} */
+        let _map = ['1'];
+        for (let i = 2; i <= 38; i++)
+            _map = set(_map)((i * i).toString());
+        const r = jsonStr(_map);
+        if (r !==
+            '[[[[["1"],"100",["1024"]],"1089",[["1156"],"121",["1225"]]],' +
+                '"1296",' +
+                '[[["1369"],"144",["1444"]],"16",[["169"],"196",["225"]]]],' +
+                '"25",' +
+                '[[[["256"],"289",["324"],"36",["361"]],"4",[["400"],"441",["484"]]],' +
+                '"49",' +
+                '[[["529"],"576",["625"]],"64",[["676"],"729",["784"]],"81",[["841"],"9",["900","961"]]]]]') {
+            throw r;
+        }
+    }
+];
+export default test;

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

@@ -0,0 +1,83 @@
+import * as BTree from './types/module.f.mjs';
+import * as _ from './module.f.mjs';
+const { values } = _;
+import * as json from '../../json/module.f.mjs';
+import * as o from '../object/module.f.mjs';
+const { sort } = o;
+import * as str from '../string/module.f.mjs';
+const { cmp } = str;
+import * as list from '../list/module.f.mjs';
+import * as s from './set/module.f.mjs';
+import * as f from './find/module.f.mjs';
+const jsonStr = json.stringify(sort);
+/** @type {(sequence: list.List<json.Unknown>) => string} */
+const stringify = sequence => jsonStr(list.toArray(sequence));
+/** @type {(node: BTree.Node<string>) => (value: string) => BTree.Node<string>} */
+const set = node => value => s.set(cmp(value))(() => value)(node);
+const valueTest1 = () => {
+    /** @type {BTree.Node<string>} */
+    let _map = ['a'];
+    _map = set(_map)('b');
+    _map = set(_map)('c');
+    _map = set(_map)('d');
+    _map = set(_map)('e');
+    _map = set(_map)('f');
+    let result = stringify(values(_map));
+    if (result !== '["a","b","c","d","e","f"]') {
+        throw result;
+    }
+};
+const valuesTest2 = () => {
+    /** @type {BTree.Node<string>} */
+    let _map = ['1'];
+    for (let i = 2; i <= 10; i++)
+        _map = set(_map)((i * i).toString());
+    let result = stringify(values(_map));
+    if (result !== '["1","100","16","25","36","4","49","64","81","9"]') {
+        throw result;
+    }
+};
+const findTrue = () => {
+    /** @type {BTree.Node<string>} */
+    let _map = ['a'];
+    _map = set(_map)('b');
+    _map = set(_map)('c');
+    const result = f.value(f.find(cmp('b'))(_map).first);
+    if (result !== 'b') {
+        throw result;
+    }
+};
+const find = () => {
+    /** @type {BTree.Node<string>} */
+    let _map = ['a'];
+    _map = set(_map)('b');
+    _map = set(_map)('c');
+    const result = f.value(f.find(cmp('e'))(_map).first);
+    if (result !== null) {
+        throw result;
+    }
+};
+const test = () => {
+    /** @type {BTree.Node<string>} */
+    let _map = ['a'];
+    _map = set(_map)('b');
+    _map = set(_map)('c');
+    _map = set(_map)('d');
+    _map = set(_map)('e');
+    _map = set(_map)('f');
+    //
+    {
+        /** @type {list.Result<string>} */
+        let _item = list.next(values(_map));
+        while (_item !== null) {
+            _item = list.next(_item.tail);
+        }
+    }
+};
+export default {
+    valueTest1,
+    valuesTest2,
+    findTrue,
+    find,
+    test,
+};

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

@@ -0,0 +1,50 @@
+// @ts-self-types="./module.f.d.mts"
+export {};
+/**
+ * @template T
+ * @typedef {readonly[T]} Array1
+ */
+/**
+ * @template T
+ * @typedef {readonly[T,T]} Array2
+ */
+/**
+ * @template T
+ * @typedef {readonly[T,T,T]} Array3
+ */
+/** @typedef {0|1} Index2 */
+/** @typedef {0|1|2} Index3 */
+/** @typedef {0|1|2|3|4} Index5 */
+//
+/**
+ * @template T
+ * @typedef {Array1<T>} Leaf1
+ */
+/**
+ * @template T
+ * @typedef {Array2<T>} Leaf2
+ */
+/**
+ * @template T
+ * @typedef {readonly [Node<T>, T, Node<T>]} Branch3
+ */
+/**
+ * @template T
+ * @typedef {readonly [Node<T>, T, Node<T>, T, Node<T>]} Branch5
+ */
+/**
+ * @template T
+ * @typedef { Leaf1<T> | Leaf2<T> | Branch3<T> | Branch5<T>} Node
+ */
+/**
+ * @template T
+ * @typedef {Node<T> | null} Tree
+ */
+/**
+ * @template T
+ * @typedef {readonly[Node<T>]} Branch1
+ */
+/**
+ * @template T
+ * @typedef { readonly[...Branch5<T>, T, Node<T>] } Branch7
+ */

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

@@ -0,0 +1,42 @@
+// @ts-self-types="./module.f.d.mts"
+import * as f from '../function/module.f.mjs';
+const { compose } = f;
+import * as RangeMap from '../range_map/module.f.mjs';
+import * as SortedSet from '../sorted_set/module.f.mjs';
+import * as list from '../list/module.f.mjs';
+const { reverse, countdown, flat, map } = list;
+/** @typedef {bigint} ByteSet */
+/** @typedef {number} Byte */
+/** @type {(n: Byte) => (s: ByteSet) => boolean} */
+export const has = n => s => ((s >> BigInt(n)) & 1n) === 1n;
+// create a set
+export const empty = 0n;
+//                        0    1    2    3    4    5    6    7    8    9    A    B    C    D    E    F
+export const universe = 0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffn;
+/** @type {(n: Byte) => ByteSet} */
+export const one = n => 1n << BigInt(n);
+/** @type {(r: readonly[Byte, Byte]) => ByteSet} */
+export const range = ([b, e]) => one(e - b + 1) - 1n << BigInt(b);
+// set operations
+/** @type {(a: ByteSet) => (b: ByteSet) => ByteSet} */
+export const union = a => b => a | b;
+/** @type {(a: ByteSet) => (b: ByteSet) => ByteSet} */
+const intersect = a => b => a & b;
+/** @type {(n: ByteSet) => ByteSet} */
+export const complement = n => universe ^ n;
+/** @type {(a: ByteSet) => (b: ByteSet) => ByteSet} */
+const difference = compose(intersect)(compose(complement));
+// additional operations
+export const set = compose(one)(union);
+export const setRange = compose(range)(union);
+/** @type {(n: Byte) => (s: ByteSet) => ByteSet} */
+export const unset = n => s => difference(s)(one(n));
+const counter = reverse(countdown(256));
+/** @type {(n: ByteSet) => (s: string) => (i: number) => RangeMap.RangeMap<SortedSet.SortedSet<string>>} */
+const toRangeMapOp = n => s => i => {
+    const current = has(i + 1)(n);
+    const prev = has(i)(n);
+    return current === prev ? null : [[prev ? [s] : [], i]];
+};
+/** @type {(n: ByteSet) => (s: string) => RangeMap.RangeMap<SortedSet.SortedSet<string>>} */
+export const toRangeMap = n => s => flat(map(toRangeMapOp(n)(s))(counter));