functionalscript 0.0.284 → 0.0.288

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "functionalscript",
-  "version": "0.0.284",
+  "version": "0.0.288",
   "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/find/index.js

@@ -1,41 +1,31 @@
 const _ = require('..')
-const { todo } = require('../../../dev')
 const list = require('../../list')
 const cmp = require('../../function/compare')
+const array = require('../../array')
 
 /**
  * @template T
- * @typedef {readonly[1, _.Leaf1<T>|_.Branch3<T>]} Found1
+ * @typedef {readonly[cmp.Index3, _.Leaf1<T>]} FirstLeaf1
  */
 
 /**
  * @template T
- * @typedef {readonly[1|3, _.Leaf2<T> | _.Branch5<T>]} Found2
+ * @typedef {readonly[1, _.Branch3<T>]} FirstBranch3
  */
 
 /**
  * @template T
- * @typedef {readonly[0|2, _.Leaf1<T>]} NotFound1
+ * @typedef {readonly[cmp.Index5, _.Leaf2<T>]} FirstLeaf2
  */
 
 /**
  * @template T
- * @typedef {readonly[0|2|4, _.Leaf2<T>]} NotFound2
+ * @typedef {readonly[1|3, _.Branch5<T>]} FirstBranch5
  */
 
 /**
  * @template T
- * @typedef {Found1<T> | Found2<T>} Found
- */
-
-/**
- * @template T
- * @typedef {NotFound1<T> | NotFound2<T>} NotFound
- */
-
-/**
- * @template T
- * @typedef {Found<T> | NotFound<T>} First
+ * @typedef {FirstLeaf1<T> | FirstBranch3<T> | FirstLeaf2<T> | FirstBranch5<T>} First
  */
 
 /**
@@ -53,6 +43,12 @@ const cmp = require('../../function/compare')
  * @typedef {PathItem3<T> | PathItem5<T>} PathItem
  */
 
+/** @type {<T>(item: PathItem<T>) => _.Node<T>} */
+const child = item => {
+    /** @typedef {typeof item extends PathItem<infer T> ? T : never} T */
+    return /** @type {_.Node<T>} */(item[1][item[0]])
+}
+
 /**
  * @template T
  * @typedef {list.List<PathItem<T>>} Path
@@ -60,8 +56,49 @@ const cmp = require('../../function/compare')
 
 /**
  * @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>} */
-const find = c => node => todo()
+const find = c => {
+    const i3 = cmp.index3(c)
+    const i5 = cmp.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(undefined)
+}
+
+module.exports = {
+    /** @readonly */
+    find,
+}

package/types/btree/find/test.js

@@ -0,0 +1,119 @@
+const _ = require('.')
+const list = require('../../list')
+const json = require('../../../json')
+const { sort } = require('../../object')
+const btree = require('..')
+const { stringCmp } = require('../../function/compare')
+
+const jsonStr = json.stringify(sort)
+
+/** @type {(node: btree.Node<string>) => (value: string) => btree.Node<string>} */
+const set = node => value => {
+    const result = btree.setVisitor(stringCmp(value))(node)(() => value)
+    switch (result[0]) {
+        case 'replace': case 'overflow': { return result[1] }
+        default: { return 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(stringCmp(i))(m))
+
+{
+    /** @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 }
+    }
+}

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,19 @@
+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 }
+}

package/types/btree/test.js

@@ -5,6 +5,9 @@ const { sort } = require('../object')
 const { stringCmp } = require('../function/compare')
 const list = require('../list')
 
+require('./find/test')
+require('./set/test')
+
 const jsonStr = json.stringify(sort)
 
 /** @type {(sequence: list.List<json.Unknown>) => string} */