functionalscript 0.1.594 → 0.1.597

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

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

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

@@ -1,8 +1,8 @@
 import * as _ from '../types/module.f.mjs'
-import list, * as List from '../../list/module.f.mjs'
+import * as List from '../../list/module.f.mjs'
 import cmp, * as cmpT from '../../function/compare/module.f.mjs'
 const { index3, index5 } = cmp
-import array, * as arrayT from '../../array/module.f.mjs'
+import * as Array from '../../array/module.f.mjs'
 
 /**
  * @template T
@@ -68,12 +68,12 @@ const find = c => {
     /** @typedef {typeof c extends cmpT.Compare<infer T> ? T : never} T */
     /** @type {(prior: Path<T>) => (node: _.Node<T>) => Result<T>} */
     const f = tail => node => {
-        /** @type {(index: arrayT.KeyOf<typeof node>) => Result<T>} */
+        /** @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: arrayT.KeyOf<typeof node>) => Result<T>} */
+        /** @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])) }

package/types/btree/find/test.f.d.mts

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

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

@@ -1,6 +1,6 @@
 import _, * as T from './module.f.mjs'
 import list from '../../list/module.f.mjs'
-import json, * as jsonT from '../../../json/module.f.mjs'
+import json, * as Json from '../../../json/module.f.mjs'
 import o from '../../object/module.f.mjs'
 const { sort } = o
 import * as btree from '../types/module.f.mjs'
@@ -13,7 +13,7 @@ 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: T.Result<jsonT.Unknown>) => string} */
+/** @type {(r: T.Result<Json.Unknown>) => string} */
 const str = r => jsonStr(list.toArray(list.map(x => x[0])(r)))
 
 /** @type {(i: string) => (m: btree.Node<string>) => string} */

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

@@ -0,0 +1,9 @@
+declare namespace _default {
+    export let empty: null;
+    export { values };
+}
+export default _default;
+/** @type {<T>(tree: _.Tree<T>) => List.List<T>} */
+declare 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/types/btree/remove/module.f.d.mts

@@ -0,0 +1,19 @@
+declare namespace _default {
+    export { nodeRemove };
+    export { remove };
+}
+export default _default;
+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>;
+/** @type {<T>(c: Cmp.Compare<T>) => (node: _.Node<T>) => _.Tree<T>} */
+declare const nodeRemove: <T>(c: Cmp.Compare<T>) => (node: _.Node<T>) => _.Tree<T>;
+/** @type {<T>(c: Cmp.Compare<T>) => (tree: _.Tree<T>) => _.Tree<T>} */
+declare const remove: <T>(c: Cmp.Compare<T>) => (tree: _.Tree<T>) => _.Tree<T>;
+import * as _ from '../types/module.f.mjs';
+import * as Find from '../find/module.f.mjs';
+import * as Cmp from '../../function/compare/module.f.mjs';

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

@@ -1,9 +1,9 @@
 import * as _ from '../types/module.f.mjs'
-import cmp, * as cmpT from '../../function/compare/module.f.mjs'
-import find, * as findT from '../find/module.f.mjs'
+import * as Cmp from '../../function/compare/module.f.mjs'
+import find, * as Find from '../find/module.f.mjs'
 import list from '../../list/module.f.mjs'
 const { fold, concat, next } = list
-import array, * as arrayT from '../../array/module.f.mjs'
+import * as Array from '../../array/module.f.mjs'
 import n from '../../nullable/module.f.mjs'
 const { map } = n
 
@@ -16,11 +16,11 @@ const { map } = n
  * @template T
  * @typedef {{
  *  readonly first: Leaf01<T>,
- *  readonly tail: findT.Path<T>
+ *  readonly tail: Find.Path<T>
  * }} RemovePath
  */
 
-/** @type {<T>(tail: findT.Path<T>) => (n: _.Node<T>) => readonly[T, RemovePath<T>]} */
+/** @type {<T>(tail: Find.Path<T>) => (n: _.Node<T>) => readonly[T, RemovePath<T>]} */
 const path = tail => n => {
     switch (n.length) {
         case 1: { return [n[0], { first: null, tail }] }
@@ -94,10 +94,10 @@ const initValue1 = a => n => {
  * @typedef {(a: A) => (n: _.Branch3<T>) => _.Branch1<T> | _.Branch3<T>} Merge
  */
 
-/** @type {<A, T>(ms: arrayT.Array2<Merge<A, T>>) => (i: findT.PathItem<T>) => (a: A) => Branch<T>} */
+/** @type {<A, T>(ms: Array.Array2<Merge<A, T>>) => (i: Find.PathItem<T>) => (a: A) => Branch<T>} */
 const reduceX = ms => ([i, n]) => a => {
     const [m0, m2] = ms
-    /** @typedef {typeof ms extends arrayT.Array2<Merge<infer A, infer T>> ? [A,T] : never} AT */
+    /** @typedef {typeof ms extends Array.Array2<Merge<infer A, infer T>> ? [A,T] : never} AT */
     /** @typedef {AT[0]} A */
     /** @typedef {AT[1]} T */
     /** @type {(m: Merge<A, T>) => Branch<T>} */
@@ -116,15 +116,15 @@ const reduce = fold(reduceX([reduceValue0, reduceValue2]))
 
 const initReduce = reduceX([initValue0, initValue1])
 
-/** @type {<T>(c: cmpT.Compare<T>) => (node: _.Node<T>) => _.Tree<T>} */
+/** @type {<T>(c: Cmp.Compare<T>) => (node: _.Node<T>) => _.Tree<T>} */
 const nodeRemove = c => node => {
-    /** @typedef {typeof c extends cmpT.Compare<infer T> ? T : never} T */
+    /** @typedef {typeof c extends Cmp.Compare<infer T> ? T : never} T */
     /** @type  {() => null | RemovePath<T>} */
     const f = () => {
         const { first, tail } = find.find(c)(node)
-        /** @type {(n: _.Node<T>) => (f: (v: T) => findT.PathItem<T>) => RemovePath<T>} */
+        /** @type {(n: _.Node<T>) => (f: (v: T) => Find.PathItem<T>) => RemovePath<T>} */
         const branch = n => f => {
-            const [v, p] = path(/** @type {findT.Path<T>} */(null))(n)
+            const [v, p] = path(/** @type {Find.Path<T>} */(null))(n)
             return { first: p.first, tail: concat(p.tail)({ first: f(v), tail }) }
         }
         const [i, n] = first
@@ -156,7 +156,7 @@ const nodeRemove = c => node => {
     return result.length === 1 ? result[0] : result
 }
 
-/** @type {<T>(c: cmpT.Compare<T>) => (tree: _.Tree<T>) => _.Tree<T>} */
+/** @type {<T>(c: Cmp.Compare<T>) => (tree: _.Tree<T>) => _.Tree<T>} */
 const remove =  c => map(nodeRemove(c))
 
 export default {

package/types/btree/remove/test.f.d.mts

@@ -0,0 +1,7 @@
+declare namespace _default {
+    export { test };
+    export { test2 };
+}
+export default _default;
+declare function test(): void;
+declare function test2(): void;

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

@@ -1,5 +1,5 @@
 import _ from './module.f.mjs'
-import * as btree from '../types/module.f.mjs'
+import * as BTree from '../types/module.f.mjs'
 import s from '../set/module.f.mjs'
 import str from '../../string/module.f.mjs'
 const { cmp } = str
@@ -7,16 +7,16 @@ import json from '../../../json/module.f.mjs'
 import o from '../../object/module.f.mjs'
 const { sort } = o
 
-/** @type {(node: btree.Node<string>) => (value: string) => btree.Node<string>} */
+/** @type {(node: BTree.Node<string>) => (value: string) => BTree.Node<string>} */
 const set = node => value => s.set(cmp(value))(() => value)(node)
 
-/** @type {(node: btree.Node<string>) => (value: string) => btree.Node<string> | null} */
+/** @type {(node: BTree.Node<string>) => (value: string) => BTree.Node<string> | null} */
 const remove = node => value => _.nodeRemove(cmp(value))(node)
 
 const jsonStr = json.stringify(sort)
 
 const test = () => {
-    /** @type {btree.Node<string> | null} */
+    /** @type {BTree.Node<string> | null} */
     let _map = ['1']
     for (let i = 2; i <= 38; i++)
         _map = set(_map)((i * i).toString())
@@ -411,7 +411,7 @@ const test = () => {
 }
 
 const test2 = () => {
-    /** @type {btree.Node<string>|null} */
+    /** @type {BTree.Node<string>|null} */
     let _map = ['1']
     for (let i = 2; i <= 10; i++)
         _map = set(_map)((i * i).toString())

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

@@ -0,0 +1,9 @@
+declare namespace _default {
+    export { set };
+}
+export default _default;
+export type Branch1To3<T> = _.Branch1<T> | _.Branch3<T>;
+/** @type {<T>(c: Cmp.Compare<T>) => (f: (value: T|null) => T) => (tree: _.Tree<T>) => _.Node<T>} */
+declare const set: <T>(c: Cmp.Compare<T>) => (f: (value: T | null) => T) => (tree: _.Tree<T>) => _.Node<T>;
+import * as _ from '../types/module.f.mjs';
+import * as Cmp from '../../function/compare/module.f.mjs';

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

@@ -1,7 +1,7 @@
 import * as _ from '../types/module.f.mjs'
-import btreeFind, * as btreeFindT from '../find/module.f.mjs'
+import btreeFind, * as BtreeFind from '../find/module.f.mjs'
 const { find } = btreeFind
-import cmp, * as cmpT from '../../function/compare/module.f.mjs'
+import * as Cmp from '../../function/compare/module.f.mjs'
 import list from '../../list/module.f.mjs'
 const { fold } = list
 
@@ -13,7 +13,7 @@ const { fold } = list
 /** @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: btreeFindT.PathItem<T>) => (a: Branch1To3<T>) => Branch1To3<T>} */
+/** @type {<T>(i: BtreeFind.PathItem<T>) => (a: Branch1To3<T>) => Branch1To3<T>} */
 const reduceOp = ([i, x]) => a => {
     switch (i) {
         case 0: {
@@ -36,11 +36,11 @@ const reduceOp = ([i, x]) => a => {
 
 const reduceBranch = fold(reduceOp)
 
-/** @type {<T>(c: cmpT.Compare<T>) => (g: (value: T | null) => T) => (node: _.Node<T>) => _.Node<T>} */
+/** @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 cmpT.Compare<infer T> ? T : never} T */
+    /** @typedef {typeof c extends Cmp.Compare<infer T> ? T : never} T */
     /** @type {() => Branch1To3<T>} */
     const f = () => {
         switch (i) {
@@ -87,7 +87,7 @@ const nodeSet = c => g => node => {
     return r.length === 1 ? r[0] : r
 }
 
-/** @type {<T>(c: cmpT.Compare<T>) => (f: (value: T|null) => T) => (tree: _.Tree<T>) => _.Node<T>} */
+/** @type {<T>(c: Cmp.Compare<T>) => (f: (value: T|null) => T) => (tree: _.Tree<T>) => _.Node<T>} */
 const set = c => f => tree => tree === null ? [f(null)] : nodeSet(c)(f)(tree)
 
 export default {

package/types/btree/set/test.f.d.mts

@@ -0,0 +1,2 @@
+export default test;
+declare const test: (() => void)[];

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

@@ -1,19 +1,19 @@
 import _ from './module.f.mjs'
-import * as btree from '../types/module.f.mjs'
+import * as BTree from '../types/module.f.mjs'
 import s from '../../string/module.f.mjs'
 const { cmp } = s
-import json, * as jsonT from '../../../json/module.f.mjs'
+import json from '../../../json/module.f.mjs'
 import o from '../../object/module.f.mjs'
 const { sort } = o
 
-/** @type {(node: btree.Node<string>) => (value: string) => btree.Node<string>} */
+/** @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>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 10; i++)
             _map = set(_map)((i * i).toString())
@@ -22,7 +22,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 11; i++)
             _map = set(_map)((i * i).toString())
@@ -31,7 +31,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 12; i++)
             _map = set(_map)((i * i).toString())
@@ -40,7 +40,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 13; i++)
             _map = set(_map)((i * i).toString())
@@ -49,7 +49,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 14; i++)
             _map = set(_map)((i * i).toString())
@@ -58,7 +58,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 15; i++)
             _map = set(_map)((i * i).toString())
@@ -67,7 +67,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 16; i++)
             _map = set(_map)((i * i).toString())
@@ -76,7 +76,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 17; i++)
             _map = set(_map)((i * i).toString())
@@ -85,7 +85,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 18; i++)
             _map = set(_map)((i * i).toString())
@@ -96,7 +96,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 19; i++)
             _map = set(_map)((i * i).toString())
@@ -107,7 +107,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 20; i++)
             _map = set(_map)((i * i).toString())
@@ -120,7 +120,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 21; i++)
             _map = set(_map)((i * i).toString())
@@ -133,7 +133,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 22; i++)
             _map = set(_map)((i * i).toString())
@@ -146,7 +146,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 23; i++)
             _map = set(_map)((i * i).toString())
@@ -159,7 +159,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 24; i++)
             _map = set(_map)((i * i).toString())
@@ -172,7 +172,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 25; i++)
             _map = set(_map)((i * i).toString())
@@ -185,7 +185,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 26; i++)
             _map = set(_map)((i * i).toString())
@@ -200,7 +200,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 27; i++)
             _map = set(_map)((i * i).toString())
@@ -215,7 +215,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 28; i++)
             _map = set(_map)((i * i).toString())
@@ -230,7 +230,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 29; i++)
             _map = set(_map)((i * i).toString())
@@ -245,7 +245,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 30; i++)
             _map = set(_map)((i * i).toString())
@@ -260,7 +260,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 31; i++)
             _map = set(_map)((i * i).toString())
@@ -275,7 +275,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 32; i++)
             _map = set(_map)((i * i).toString())
@@ -290,7 +290,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 33; i++)
             _map = set(_map)((i * i).toString())
@@ -305,7 +305,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 34; i++)
             _map = set(_map)((i * i).toString())
@@ -320,7 +320,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 35; i++)
             _map = set(_map)((i * i).toString())
@@ -335,7 +335,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 36; i++)
             _map = set(_map)((i * i).toString())
@@ -350,7 +350,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 37; i++)
             _map = set(_map)((i * i).toString())
@@ -365,7 +365,7 @@ const test = [
     },
 
     () => {
-        /** @type {btree.Node<string>} */
+        /** @type {BTree.Node<string>} */
         let _map = ['1']
         for (let i = 2; i <= 38; i++)
             _map = set(_map)((i * i).toString())

package/types/btree/test.f.d.mts

@@ -0,0 +1,13 @@
+declare namespace _default {
+    export { valueTest1 };
+    export { valuesTest2 };
+    export { findTrue };
+    export { find };
+    export { test };
+}
+export default _default;
+declare function valueTest1(): void;
+declare function valuesTest2(): void;
+declare function findTrue(): void;
+declare function find(): void;
+declare function test(): void;

package/types/btree/test.f.mjs

@@ -1,4 +1,4 @@
-import * as btreeT from './types/module.f.mjs'
+import * as BTree from './types/module.f.mjs'
 import _ from './module.f.mjs'
 const { values } = _
 import json, * as jsonT from '../../json/module.f.mjs'
@@ -10,20 +10,16 @@ import list, * as List from '../list/module.f.mjs'
 import s from './set/module.f.mjs'
 import f from './find/module.f.mjs'
 
-// require('./find/test.f.mjs')
-// require('./set/test.f.mjs')
-// require('./remove/test.f.mjs')
-
 const jsonStr = json.stringify(sort)
 
 /** @type {(sequence: List.List<jsonT.Unknown>) => string} */
 const stringify = sequence => jsonStr(list.toArray(sequence))
 
-/** @type {(node: btreeT.Node<string>) => (value: string) => btreeT.Node<string>} */
+/** @type {(node: BTree.Node<string>) => (value: string) => BTree.Node<string>} */
 const set = node => value => s.set(cmp(value))(() => value)(node)
 
 const valueTest1 = () => {
-    /** @type {btreeT.Node<string>} */
+    /** @type {BTree.Node<string>} */
     let _map = ['a']
     _map = set(_map)('b')
     _map = set(_map)('c')
@@ -35,7 +31,7 @@ const valueTest1 = () => {
 }
 
 const valuesTest2 = () => {
-    /** @type {btreeT.Node<string>} */
+    /** @type {BTree.Node<string>} */
     let _map = ['1']
     for(let i = 2; i <= 10; i++)
         _map = set(_map)((i*i).toString())
@@ -44,7 +40,7 @@ const valuesTest2 = () => {
 }
 
 const findTrue = () => {
-    /** @type {btreeT.Node<string>} */
+    /** @type {BTree.Node<string>} */
     let _map = ['a']
     _map = set(_map)('b')
     _map = set(_map)('c')
@@ -53,7 +49,7 @@ const findTrue = () => {
 }
 
 const find = () => {
-    /** @type {btreeT.Node<string>} */
+    /** @type {BTree.Node<string>} */
     let _map = ['a']
     _map = set(_map)('b')
     _map = set(_map)('c')
@@ -62,7 +58,7 @@ const find = () => {
 }
 
 const test = () => {
-    /** @type {btreeT.Node<string>} */
+    /** @type {BTree.Node<string>} */
     let _map = ['a']
     _map = set(_map)('b')
     _map = set(_map)('c')

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

@@ -0,0 +1,16 @@
+declare const _default: {};
+export default _default;
+export type Array1<T> = readonly [T];
+export type Array2<T> = readonly [T, T];
+export type Array3<T> = readonly [T, T, T];
+export type Index2 = 0 | 1;
+export type Index3 = 0 | 1 | 2;
+export type Index5 = 0 | 1 | 2 | 3 | 4;
+export type Leaf1<T> = Array1<T>;
+export type Leaf2<T> = Array2<T>;
+export type Branch3<T> = readonly [Node<T>, T, Node<T>];
+export type Branch5<T> = readonly [Node<T>, T, Node<T>, T, Node<T>];
+export type Node<T> = Leaf1<T> | Leaf2<T> | Branch3<T> | Branch5<T>;
+export type Tree<T> = Node<T> | null;
+export type Branch1<T> = readonly [Node<T>];
+export type Branch7<T> = readonly [...Branch5<T>, T, Node<T>];