functionalscript 0.0.285 → 0.0.289

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "functionalscript",
-  "version": "0.0.285",
+  "version": "0.0.289",
   "description": "FunctionalScript is a functional subset of JavaScript",
   "main": "index.js",
   "scripts": {

package/types/array/index.js

@@ -54,6 +54,18 @@ const seq = require('../list')
 
 /** @typedef {0|1|2|3|4} Index5 */
 
+/**
+ * @template T
+ * @typedef {T extends Array1<infer _> ? Index1 :
+ *  T extends Array2<infer _> ? Index2 :
+ *  T extends Array3<infer _> ? Index3 :
+ *  T extends Array4<infer _> ? Index4 :
+ *  T extends Array5<infer _> ? Index5 :
+ *  T extends readonly (infer _)[] ? number :
+ *  never
+ * } KeyOf
+ */
+
 /** @type {<T>(_: readonly T[]) => readonly T[]} */
 const uncheckTail = a => a.slice(1)
 

package/types/btree/README.md

@@ -118,12 +118,12 @@ Posible actions:
 |                  |     |       |`[[v1],v20,[v21]]`                      |
 |                  |     |`[nR0]`|`[[nR0, v1, n20, v21, n22]]`            |
 |                  |     |       |`[[nR0, v1, n20], v21, [n22, v23, n23]]`|
-|                  |     |`nR`   |`[r,v1,n2]`                             |
+|                  |     |`nR`   |`[nR,v1,n2]`                            |
 |                  |    2|`[]`   |`[[v00, v1]]`                           |
 |                  |     |       |`[[v00],v01,[v1]]`                      |
 |                  |     |`[nR0]`|`[[n00, v01, n02, v1, nR0]]`            |
 |                  |     |       |`[[n00, v01, n02], v02, [n03, v1, nR0]]`|
-|                  |     |`nR`   |`[n0,v1,r]`                             |
+|                  |     |`nR`   |`[n0,v1,nR]`                            |
 |`[n0,v1,n2,v3,n4]`|    0|`[]`   |`[[v1,v20],v3,n4]`                      |
 |                  |     |       |`[[v1],v20,[v21],v3,n4]`                |
 |                  |     |`[nR0]`|`[[nR0,v1,n20,v21,n22],v3,n4]`          |

package/types/btree/find/index.js

@@ -1,11 +1,11 @@
 const _ = require('..')
-const { todo } = require('../../../dev')
 const list = require('../../list')
 const cmp = require('../../function/compare')
+const array = require('../../array')
 
 /**
  * @template T
- * @typedef {readonly[cmp.Index3, _.Leaf1<T>|_.Branch3<T>]} FirstLeaf1
+ * @typedef {readonly[cmp.Index3, _.Leaf1<T>]} FirstLeaf1
  */
 
 /**
@@ -56,7 +56,10 @@ const child = item => {
 
 /**
  * @template T
- * @typedef {readonly[First<T>, Path<T>]} Result<T>
+ * @typedef {{
+ *  readonly first: First<T>,
+ *  readonly tail: Path<T>
+ * }} Result<T>
  */
 
 /** @type {<T>(c: cmp.Compare<T>) => (node: _.Node<T>) => Result<T>} */
@@ -66,23 +69,28 @@ const find = 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 {(first: PathItem<T>) => Result<T>} */
-        const append = first => f({ first, tail })(child(first))
+        /** @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 [[i3(node[0]), node], tail] }
-            case 2: { return [[i5(node), node], tail] }
+            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, node]) }
-                    case 1: { return [[i, node], tail] }
+                    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, node]) }
-                    case 1: case 3: { return [[i, node], tail]}
+                    case 0: case 2: case 4: { return append(i) }
+                    case 1: case 3: { return done(i) }
                 }
             }
         }

package/types/btree/find/test.js

@@ -7,9 +7,6 @@ const { stringCmp } = require('../../function/compare')
 
 const jsonStr = json.stringify(sort)
 
-// /** @type {(sequence: list.List<json.Unknown>) => string} */
-// const arrayStr = sequence => jsonStr(list.toArray(sequence))
-
 /** @type {(node: btree.Node<string>) => (value: string) => btree.Node<string>} */
 const set = node => value => {
     const result = btree.setVisitor(stringCmp(value))(node)(() => value)
@@ -20,7 +17,7 @@ const set = node => value => {
 }
 
 /** @type {(r: _.Result<json.Unknown>) => string} */
-const str = ([r, path]) => jsonStr([r[0], list.toArray(list.map(x => x[0])(path))])
+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(stringCmp(i))(m))
@@ -37,86 +34,86 @@ const find = i => m => str(_.find(stringCmp(i))(m))
     //
     {
         const r = find("0")(_map)
-        if (r !== '[0,[0,0]]') { throw r }
+        if (r !== '[0,0,0]') { throw r }
     }
     {
         const r = find("1")(_map)
-        if (r !== '[1,[0,0]]') { throw r }
+        if (r !== '[1,0,0]') { throw r }
     }
     {
         const r = find("10")(_map)
-        if (r !== '[2,[0,0]]') { throw r }
+        if (r !== '[2,0,0]') { throw r }
     }
     {
         const r = find("100")(_map)
-        if (r !== '[3,[0,0]]') { throw r }
+        if (r !== '[3,0,0]') { throw r }
     }
     {
         const r = find("12")(_map)
-        if (r !== '[4,[0,0]]') { throw r }
+        if (r !== '[4,0,0]') { throw r }
     }
     {
         const r = find("16")(_map)
-        if (r !== '[1,[0]]') { throw r }
+        if (r !== '[1,0]') { throw r }
     }
     {
         const r = find("17")(_map)
-        if (r !== '[0,[2,0]]') { throw r }
+        if (r !== '[0,2,0]') { throw r }
     }
     {
         const r = find("25")(_map)
-        if (r !== '[1,[2,0]]') { throw r }
+        if (r !== '[1,2,0]') { throw r }
     }
     {
         const r = find("26")(_map)
-        if (r !== '[2,[2,0]]') { throw r }
+        if (r !== '[2,2,0]') { throw r }
     }
     {
         const r = find("36")(_map)
-        if (r !== '[3,[2,0]]') { throw r }
+        if (r !== '[3,2,0]') { throw r }
     }
     {
         const r = find("37")(_map)
-        if (r !== '[4,[2,0]]') { throw r }
+        if (r !== '[4,2,0]') { throw r }
     }
     {
         const r = find("4")(_map)
-        if (r !== '[1,[]]') { throw r }
+        if (r !== '[1]') { throw r }
     }
     {
         const r = find("41")(_map)
-        if (r !== '[0,[0,2]]') { throw r }
+        if (r !== '[0,0,2]') { throw r }
     }
     {
         const r = find("49")(_map)
-        if (r !== '[1,[0,2]]') { throw r }
+        if (r !== '[1,0,2]') { throw r }
     }
     {
         const r = find("5")(_map)
-        if (r !== '[2,[0,2]]') { throw r }
+        if (r !== '[2,0,2]') { throw r }
     }
     {
         const r = find("64")(_map)
-        if (r !== '[1,[2]]') { throw r }
+        if (r !== '[1,2]') { throw r }
     }
     {
         const r = find("65")(_map)
-        if (r !== '[0,[2,2]]') { throw r }
+        if (r !== '[0,2,2]') { throw r }
     }
     {
         const r = find("81")(_map)
-        if (r !== '[1,[2,2]]') { throw r }
+        if (r !== '[1,2,2]') { throw r }
     }
     {
         const r = find("85")(_map)
-        if (r !== '[2,[2,2]]') { throw r }
+        if (r !== '[2,2,2]') { throw r }
     }
     {
         const r = find("9")(_map)
-        if (r !== '[3,[2,2]]') { throw r }
+        if (r !== '[3,2,2]') { throw r }
     }
     {
         const r = find("91")(_map)
-        if (r !== '[4,[2,2]]') { throw r }
+        if (r !== '[4,2,2]') { throw r }
     }
 }

package/types/btree/set/index.js

@@ -0,0 +1,93 @@
+const _ = require('..')
+const find = require('../find')
+const cmp = require('../../function/compare')
+const list = require('../../list')
+
+/**
+ * @template T
+ * @typedef {_.Branch1<T> | _.Branch3<T>} Result
+ */
+
+/** @type {<T>(b: _.Branch5<T> | _.Branch7<T>) => Result<T>} */
+const b57 = b => b.length === 5 ? [b] : [[b[0], b[1], b[2]], b[3], [b[4], b[5], b[6]]]
+
+/** @type {<T>(a: Result<T>) => (i: find.PathItem<T>) => Result<T>} */
+const reduce = a => i => {
+    switch (i[0]) {
+        case 0: {
+            const x = i[1]
+            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: {
+            const x = i[1]
+            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: {
+            const x = i[1]
+            return b57([x[0], x[1], x[2], x[3], ...a])
+        }
+    }
+}
+
+/** @type {<T>(c: cmp.Compare<T>) => (value: T) => (node: _.Node<T>) => _.Node<T>} */
+const set = c => value => node => {
+    const { first, tail } = find.find(c)(node)
+    /** @typedef {typeof value} T */
+    /** @type {() => Result<T>} */
+    const f = () => {
+        switch (first[0]) {
+            case 0: {
+                // insert
+                const x = first[1]
+                switch (x.length) {
+                    case 1: { return [[value, x[0]]] }
+                    case 2: { return [[value], x[0], [x[1]]] }
+                }
+            }
+            case 1: {
+                // replace
+                const x = first[1];
+                switch (x.length) {
+                    case 1: { return [[value]] }
+                    case 2: { return [[value, x[1]]] }
+                    case 3: { return [[x[0], value, x[2]]] }
+                    case 5: { return [[x[0], value, x[2], x[3], x[4]]] }
+                }
+            }
+            case 2: {
+                // insert
+                const x = first[1];
+                switch (x.length) {
+                    case 1: { return [[x[0], value]] }
+                    case 2: { return [[x[0]], value, [x[1]]] }
+                }
+            }
+            case 3: {
+                // replace
+                const x = first[1];
+                switch (x.length) {
+                    case 2: { return [[x[0], value]] }
+                    case 5: { return [[x[0], x[1], x[2], value, x[4]]]}
+                }
+            }
+            case 4: {
+                // insert
+                const [v0, v1] = first[1];
+                return [[v0], v1, [value]]
+            }
+        }
+    }
+    const r = list.reduce(reduce)(f())(tail)
+    return r.length === 1 ? r[0] : r
+}
+
+module.exports = {
+    /** @readonly */
+    set,
+}

package/types/btree/set/test.js

@@ -0,0 +1,379 @@
+const _ = require('.')
+const btree = require('..')
+const { stringCmp } = require('../../function/compare')
+const json = require('../../../json')
+const { sort } = require('../../object')
+
+/** @type {(node: btree.Node<string>) => (value: string) => btree.Node<string>} */
+const set = node => value => _.set(stringCmp(value))(value)(node)
+
+const jsonStr = json.stringify(sort)
+
+{
+    /** @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 }
+}

package/types/btree/test.js

@@ -6,6 +6,7 @@ const { stringCmp } = require('../function/compare')
 const list = require('../list')
 
 require('./find/test')
+require('./set/test')
 
 const jsonStr = json.stringify(sort)