functionalscript 0.0.173 → 0.0.180

package/btree/index.js

@@ -336,7 +336,7 @@ const values = node => ({
 const flatArray = (...array) => list.flat(list.fromArray(array))
 
 /** @type {<T>(node: Node<T>) => list.List<T>} */
-const valuesList = node => {
+const valuesList = node => () => {
     const f = () => {
         switch (node.length) {
             case 1: case 2: { return list.fromArray(node) }
@@ -358,7 +358,7 @@ const valuesList = node => {
             }
         }
     }
-    return f()
+    return list.get(f())
 }
 
 module.exports = {

package/btree/test.js

@@ -1,6 +1,7 @@
 const btree = require('.')
 const { setVisitor, valuesList } = btree
 const { cmp } = require('../cmp') 
+const list = require('../sequence/list')
 
 /** @type {(node: btree.Node<string>) => (value: string) => btree.Node<string>} */
 const set = node => value => {
@@ -21,10 +22,11 @@ const test = () => {
     //
     {
         /** @type {import('../sequence/list').Result<string>} */
-        let result = valuesList(node)()
+        let result = list.get(valuesList(node))
         while (result !== undefined) {
-            console.log(result[0])
-            result = result[1]()
+            const t = result[0]
+            console.log(t)
+            result = list.get(result[1])
         }
     }
 }

package/package.json

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

package/sequence/README.md

@@ -12,7 +12,7 @@ Sequence types:
 See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array
 
 - `length: Sequence<infer T> => number`
-- `at: number => Sequence<infer T> = T`
+- `at: number => Sequence<infer T> = T|undefined`
 - `concat: Sequence<infer T> => Sequence<T> => Sequence<T>`
 - `entries: Sequence<infer T> => Sequence<[number, T]>`
 - `every: (infer T => boolean) => Sequence<T> => boolean`
@@ -24,7 +24,6 @@ See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Obj
 - `includes: infer T => Sequence<T> => boolean`
 - `indexOf: infer T => Sequence<T> => number`
 - `join: string => Sequence<string> => string`
-- `keys: Sequence<T> => Sequence<string>`
 - `lastIndexOf: infer T => Sequence<T> => number`
 - `map: (infer T => infer R) => Sequence<T> => Sequence<R>`
 - `reduce: ...Scan<T, R> => Sequence<T> => R`
@@ -38,6 +37,7 @@ See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Obj
 
 ### Priority 3.
 
+- `keys: Sequence<T> => Sequence<string>`
 - `values: Sequence<infer T> => Sequence<T>`
 
 ## Prohibited Array Operations

package/sequence/array/index.js

@@ -30,6 +30,13 @@ const option = require('../../option')
  * @typedef {readonly [T, T, T]} Array3
  */
 
+/**
+ * @template T0
+ * @template T1
+ * @template T2
+ * @typedef {readonly [T0, T1, T2]} Tuple3
+ */
+
 /** @typedef {0|1|2} Index3 */
 
 /**
@@ -85,8 +92,8 @@ const splitLast = a => {
     return option.map(split)(last(a))
 }
 
-/** @type {<T>(a: Array<T>) => (index: number) => readonly[T]|undefined} */
-const at = a => index => index < a.length ? [a[index]] : undefined
+/** @type {(index: number) => <T>(a: Array<T>) => readonly[T]|undefined} */
+const at = index => a => index < a.length ? [a[index]] : undefined
 
 module.exports = {
     /** @readonly */

package/sequence/asyncIterable/index.js

@@ -56,12 +56,12 @@ const scan = s => c => ({
 })
 
 /** @type {<T, R>(s: seq.InclusiveScan<T, R>) => (c: AsyncOrSyncIterable<T>) => AsyncIterable<R>} */
-const inclusiveScan = s => c => concat([s.first])(scan(s.scan)(c))
+const inclusiveScan = ([first, s]) => c => concat([first])(scan(s)(c))
 
 /** @type {<T, R>(is: seq.InclusiveScan<T, R>) => (c: AsyncOrSyncIterable<T>) => Promise<R>} */
-const reduce = is => async c => {
-    let next = is.first
-    for await (const i of scan(is.scan)(c)) {
+const reduce = ([first, s]) => async c => {
+    let next = first
+    for await (const i of scan(s)(c)) {
         next = i
     }
     return next
@@ -71,7 +71,7 @@ const sum = reduce(seq.sum)
 
 const join = pipe(seq.join)(reduce)
 
-const size = reduce(seq.size)
+const length = reduce(seq.length)
 
 /** @type {<T>(f: (value: T) => boolean) => (c: AsyncOrSyncIterable<T>) => AsyncIterable<T>} */
 const takeWhile = f => c => ({
@@ -99,7 +99,7 @@ module.exports = {
     /** @readonly */
     sum,
     /** @readonly */
-    size,
+    length,
     /** @readonly */
     join,
     /** @readonly */

package/sequence/index.js

@@ -22,10 +22,7 @@ const { id } = require('../function')
 /**
  * @template T
  * @template R
- * @typedef {{
- *  readonly scan: Scan<T, R>
- *  readonly first: R
- * }} InclusiveScan
+ * @typedef {Tuple2<R, Scan<T, R>>} InclusiveScan
  */
 
 /** @type {<R, T>(operator: op.BinaryOperator<R, T>) => (prior: R) => Scan<T, R>} */
@@ -42,10 +39,7 @@ const scan = operator => {
 } 
 
 /** @type {<R, T>(operator: op.BinaryOperator<R, T>) => (first: R) => InclusiveScan<T, R>} */
-const inclusiveScan = operator => first => ({
-    scan: scan(operator)(first),
-    first,
-})
+const inclusiveScan = operator => first => [first, scan(operator)(first)]
 
 /** 
  * @template T
@@ -58,14 +52,14 @@ const createEntries = index => value => [[index, value], createEntries(index + 1
 const entries = createEntries(0)
 
 /** @type {(separator: string) => InclusiveScan<string, string>} */
-const join = separator => ({
-    scan: value => [value, scan(op.join(separator))(value)],
-    first: ''
-})
+const join = separator => ['', value => [value, scan(op.join(separator))(value)]]
 
 const sum = inclusiveScan(op.addition)(0)
 
-const size = inclusiveScan(a => () => a + 1)(0)
+/** @type {(a: number) => () => number} */
+const counter = a => () => a + 1
+
+const length = inclusiveScan(counter)(0)
 
 /**
  * @template T
@@ -89,7 +83,7 @@ module.exports = {
     /** @readonly */
     sum,
     /** @readonly */
-    size,
+    length,
     /** @readonly */
     entries,
     /** @readonly */

package/sequence/iterable/index.js

@@ -22,12 +22,12 @@ const scan = s => c => ({
 })
 
 /** @type {<T, R>(s: seq.InclusiveScan<T, R>) => (c: Iterable<T>) => Iterable<R>} */
-const inclusiveScan = s => c => concat([s.first])(scan(s.scan)(c))
+const inclusiveScan = ([first, s]) => c => concat([first])(scan(s)(c))
 
 /** @type {<T, R>(s: seq.InclusiveScan<T, R>) => (c: Iterable<T>) => R} */
-const reduce = s => c => {
-    let next = s.first
-    for (const i of scan(s.scan)(c)) {
+const reduce = ([first, s]) => c => {
+    let next = first
+    for (const i of scan(s)(c)) {
         next = i
     }
     return next
@@ -37,7 +37,7 @@ const entries = scan(seq.entries)
 
 const sum = reduce(seq.sum)
 
-const size = reduce(seq.size)
+const length = reduce(seq.length)
 
 const join = pipe(seq.join)(reduce)
 
@@ -87,7 +87,7 @@ module.exports = {
     /** @readonly */
     sum,
     /** @readonly */
-    size,
+    length,
     /** @readonly */
     entries,
     /** @readonly */

package/sequence/list/index.js

@@ -1,9 +1,28 @@
 const array = require('../array')
 const option = require('../../option')
+const base = require('..')
+const { pipe } = require('../../function')
+const { todo } = require('../../dev')
 
 /**
  * @template T
- * @typedef {() => Result<T>} List
+ * @typedef {() => Result<T>} ListFunc
+ */
+
+/**
+ * We need this workaround because modern JavaScript implementations
+ * don't support ES6 TCO (Tail Call Optimization)
+ * 
+ * Without this wotkaround we may have a stack overflow if a list
+ * contains a lot of concateneted lists.
+ * 
+ * @template T
+ * @typedef {readonly [List<T>, List<T>]} Concat
+ */
+
+/**
+ * @template T
+ * @typedef { ListFunc<T> | Concat<T>} List
  */
 
 /**
@@ -18,76 +37,149 @@ const option = require('../../option')
 
 const empty = () => undefined
 
+/** @type {<T>(list: List<T>) => Result<T>} */
+const get = list => {
+    let i = list
+    while (true) {
+        if (typeof i === 'function') { return i() }
+        const [a, b] = i
+        if (typeof a === 'function') { 
+            const result = a()
+            if (result !== undefined) { 
+                return [result[0], [result[1], b]]
+            }
+            i = b
+        } else {
+            i = [a[0], [a[1], b]]
+        }
+    }
+}
+
 /**
  * @template T
  * @template R
- * @typedef {(list: List<T>) => List<R>} Map
+ * @typedef {(list: List<T>) => List<R>} ListMap
  */
 
-/** @type {<T>(first: T) => Map<T, T>} */
-const list = first => tail => () => [first, tail]
-
 /** @type {<T>(first: T) => List<T>} */
-const one = first => list(first)(empty)
+const one = first => () => [first, empty]
 
 /** @type {<T>(array: array.Array<T>) => List<T>} */
 const fromArray = a => {
     /** @typedef {typeof a extends array.Array<infer T> ? T : never} T */
     /** @type {(index: number) => List<T>} */
-    const listFrom = index => {
-        /** @type {(value: readonly [T]) => Result<T>} */
-        const result = ([value]) => list(value)(listFrom(index + 1))()
-        return () => option.map(result)(array.at(a)(index))
+    const at = index => () => {
+        const result = array.at(index)(a)
+        if (result === undefined) { return undefined }
+        return [result[0], at(index + 1)]
     }
-    return listFrom(0)
+    return at(0)
 }
 
-/** @type {<T>(list0: List<T>) => Map<T, T>} */
-const concat = list0 => list1 => () => {
-    /** @typedef {typeof list0 extends List<infer T> ? T : never} T */
-    /** @type {(firstAntTail: FirstAndTail<T>) => Result<T>} */
-    const result = ([first, tail]) => [first, concat(tail)(list1)]
-    return option.map(result)(list0())
-}
+/** @type {<T>(list0: List<T>) => ListMap<T, T>} */
+const concat = a => b => [a, b]
 
-/** @type {<T, R>(f: (value: T) => List<R>) => Map<T, R>} */
-const flatMap = f => {
-    /** @typedef {typeof f extends (value: infer T) => List<infer R> ? [T, R] : never} TR */
-    /** @typedef {TR[0]} T */
-    /** @typedef {TR[1]} R */
-    /** @type {(firstAntTail: FirstAndTail<T>) => Result<R>} */
-    const result = ([first, tail]) => concat(f(first))(map(tail))()
-    /** @type {(list: List<T>) => List<R>} */
-    const map = list => () => option.map(result)(list())
-    return map
+/** @type {<T, R>(f: (value: T) => List<R>) => ListMap<T, R>} */
+const flatMap = f => input => () => {
+    let i = input
+    while (true) { 
+        const result = get(i)
+        if (result === undefined) { return undefined }
+        const [first, tail] = result
+        const firstResult = get(f(first)) 
+        if (firstResult !== undefined) {
+            const [firstFirst, firstTail] = firstResult
+            return [firstFirst, concat(firstTail)(flatMap(f)(tail))]
+        }
+        i = tail
+    }
 }
 
 /** @type {<T>(list: List<List<T>>) => List<T>} */
 const flat = flatMap(i => i)
 
-/** @type {<T, R>(f: (value: T) => R) => Map<T, R>} */
+/** @type {<T, R>(f: (value: T) => R) => ListMap<T, R>} */
 const map = f => flatMap(i => one(f(i)))
 
-/** @type {<T>(f: (value: T) => boolean) => Map<T, T>} */
+/** @type {<T>(f: (value: T) => boolean) => ListMap<T, T>} */
 const filter = f => flatMap(i => f(i) ? one(i) : empty)
 
+/** @type {<T, R>(s: base.Scan<T, R>) => ListMap<T, R>} */
+const scan = s => input => () => {
+    /** @typedef {typeof s extends base.Scan<infer T, infer R> ? [T, R] : never} TR */
+    /** @typedef {TR[0]} T */
+    /** @typedef {TR[1]} R */
+    /** @type {(firstAndTail: FirstAndTail<T>) => Result<R>} */
+    const defined = ([first, tail]) => {
+        const [newFirst, newS] = s(first)
+        return [newFirst, scan(newS)(tail)]
+    }
+    return option.map(defined)(get(input))
+}
+
+/** @type {<T, R>(s: base.InclusiveScan<T, R>) => ListMap<T, R>} */
+const inclusiveScan = ([first, s]) => input => () => [first, scan(s)(input)]
+
+/** @type {<T>(def: T) => (input: List<T>) => T} */
+const last = def => input => {
+    let r = def
+    let i = input    
+    while (true) {
+        const result = get(i)
+        if (result === undefined) {
+            return r
+        }
+        r = result[0]
+        i = result[1]
+    }
+    return r
+}
+
+/** @type {<T, R>(s: base.InclusiveScan<T, R>) => (input: List<T>) => R} */
+const reduce = ([first, s]) => input => last(first)(scan(s)(input))
+
+const entries = scan(base.entries)
+
+const sum = reduce(base.sum)
+
+const length = reduce(base.length)
+
+const join = pipe(base.join)(reduce)
+
+/** @type {<T>(f: (value: T) => boolean) => ListMap<T, T>} */
+const takeWhile = f => input => () => {
+    const result = get(input)
+    if (result === undefined || !f(result[0])) { return undefined }
+    return result
+}
+
+/** @type {<T>(f: (value: T) => boolean) => (input: List<T>) => T|undefined} */
+const find = f => input => {
+    /** @typedef {typeof f extends (value: infer T) => boolean ? T : never} T */
+    /** @type {(result: FirstAndTail<T>) => T} */
+    const defined = ([first]) => first
+    return option.map(defined)(get(filter(f)(input)))
+}
+
 /**
  * Note: probably, it's possible to implement using the `scan` concept.
  * @type {<T>(list: List<T>) => Iterable<T>} 
  */
 const iterable = list => ({
     *[Symbol.iterator]() {
-        let result = list()
-        while (result !== undefined) {
+        let i = list
+        while (true) {
+            const result = get(i)
+            if (result === undefined) { return }
             yield result[0]
-            result = result[1]()
+            i = result[1]
         }
     }
 })
 
 module.exports = {
     /** @readonly */
-    list,
+    get,
     /** @readonly */
     one,
     /** @readonly */
@@ -106,4 +198,22 @@ module.exports = {
     map,
     /** @readonly */
     filter,
+    /** @readonly */
+    scan,
+    /** @readonly */
+    inclusiveScan,
+    /** @readonly */
+    last,
+    /** @readonly */
+    reduce,
+    /** @readonly */
+    entries,
+    /** @readonly */
+    sum,
+    /** @readonly */
+    join,
+    /** @readonly */
+    length,
+    /** @readonly */
+    find,
 }

package/sequence/list/test.js

@@ -0,0 +1,38 @@
+const list = require('.')
+const { sum } = require('..')
+
+/** @type {<T>(l: list.List<T>) => void} */
+const print = a => {
+    let i = a
+    while (true) {
+        const result = list.get(i)
+        if (result === undefined) { return }
+        console.log(result[0])
+        i = result[1]
+    }
+}
+
+{
+    const big = list.fromArray([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 42, 60])
+    const list0 = list.fromArray([0, 1, 2, 3])
+    const list1 = list.flatMap(x => list.fromArray([x, x * 2, x * 3]))(list0)
+    const list2 = list.concat(list0)(list0)
+    const list3 = list.inclusiveScan(sum)(list0)
+    const r = list.find(x => x === 42)(big)
+    {
+        let x = big
+        for (let i = 0; i < 1_000_000; ++i) {
+            x = list.concat(list.empty)(x)
+        }
+        const r = list.get(x)
+        print(x)
+    } 
+    {
+        let x = big
+        for (let i = 0; i < 1_000_000; ++i) {
+            x = list.concat(x)(list.one(i))
+        }
+        const r = list.get(x)
+        // print(x)
+    }
+}

package/test.js

@@ -1,5 +1,6 @@
 const i = require('./')
 
+require('./sequence/list/test')
 require('./btree/test')
 require('./sequence/iterable/test')
 require('./sequence/asyncIterable/test')