functionalscript 0.0.178 → 0.0.185

package/README.md

@@ -10,6 +10,9 @@ Try FunctionalScript [here](https://functionalscript.com/).
 
 Create a new FunctionalScript repository on GitHub [here](https://github.com/functionalscript/template/generate).
 
+One of the main challenges is how to make a pure functional language when ES6 TCO is not supported by Chrome and Firefox.
+A workaround for this problem is to use `let` for renaming objects.
+
 ## JSON
 
 ```js

package/btree/index.js

@@ -358,7 +358,7 @@ const valuesList = node => () => {
             }
         }
     }
-    return f()()
+    return list.next(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,11 +22,11 @@ const test = () => {
     //
     {
         /** @type {import('../sequence/list').Result<string>} */
-        let result = valuesList(node)()
+        let result = list.next(valuesList(node))
         while (result !== undefined) {
             const t = result[0]
             console.log(t)
-            result = result[1]()
+            result = list.next(result[1])
         }
     }
 }

package/function/operator/index.js

@@ -1,18 +1,41 @@
+/**
+ * @template A
+ * @template B
+ * @template R
+ * @typedef {(a: A) => (b: B) => R} BinaryOperator
+ */
+
 /**
  * @template R
  * @template T
- * @typedef {(prior: R) => (value: T) => R} BinaryOperator
+ * @typedef {BinaryOperator<R, T, R>} ReduceOperator
  */
 
-/** @type {(separator: string) => BinaryOperator<string, string>} */
+/** @type {(separator: string) => ReduceOperator<string, string>} */
 const join = separator => prior => value => `${prior}${separator}${value}`
 
 /** @type {(sum: number) => (value: number) => number} */
 const addition = a => b => a + b
 
+/**
+ * @template T
+ * @template R
+ * @typedef {(value: T) => R} UnaryOperator
+ */
+
+/** @type {(value: boolean) => boolean} */
+const logicalNot = v => !v
+
+/** @type {<T>(a: T) => (b: T) => boolean} */
+const strictEqual = a => b => a === b
+
 module.exports = {
     /** @readonly */
     join,
     /** @readonly */
     addition,
+    /** @readonly */
+    strictEqual,
+    /** @readonly */
+    logicalNot,
 }

package/map/index.js

@@ -1,6 +1,7 @@
 const option = require("../option")
-const { getVisitor, setVisitor, values } = require("../btree")
+const { getVisitor, setVisitor, valuesList } = require("../btree")
 const { cmp } = require("../cmp")
+const list = require("../sequence/list")
 
 /** @typedef {import("../cmp").Sign} Sign */
 
@@ -29,7 +30,7 @@ const { cmp } = require("../cmp")
  * @typedef {{
  *  readonly get: (name: string) => T|undefined
  *  readonly set: (name: string) => (value: T) => Map<T> 
- *  readonly entries: () => Iterable<Entry<T>>
+ *  readonly entries: list.List<Entry<T>>
  *  readonly root: undefined|TNode<Entry<T>>
  * }} Map
  */
@@ -46,7 +47,7 @@ const create = root => ({
         if ('overflow' in result) { return create(result.overflow) }
         throw ''
     },
-    entries: () => values(root),
+    entries: valuesList(root),
     root,
 })
 
@@ -54,14 +55,14 @@ const create = root => ({
  * @type {{
  *  readonly get: (name: string) => undefined
  *  readonly set: (name: string) => <T>(value: T) => Map<T>
- *  readonly entries: () => readonly []
+ *  readonly entries: () => undefined
  *  readonly root: undefined
  * }} 
  */
 const empty = {
     get: () => undefined,
     set: name => value => create([[name, value]]),
-    entries: () => [],
+    entries: list.empty,
     root: undefined
 }
 

package/map/test.js

@@ -1,4 +1,5 @@
 const { empty } = require('.')
+const list = require('../sequence/list')
 
 {
     let m = empty.set('a')(1)
@@ -44,7 +45,7 @@ const { empty } = require('.')
     if (m.get('x') !== 12) { throw 'error' }
     if (m.get('y') !== 44) { throw 'error' }
     if (m.get('a') !== undefined) { throw 'error' }
-    const entries = Array.from(m.entries())
+    const entries = Array.from(list.iterable(m.entries))
     if (entries.length !== 2) { throw 'error' }
 }
 

package/module-manager/index.js

@@ -39,8 +39,8 @@ const seq = require('../sequence')
 
 /** @typedef {(_: string) => undefined|Package|Dependencies} Dependencies */
 
-/** @type {seq.InclusiveScan<string, undefined|Path>} */
-const pathNormReduce = seq.inclusiveScan
+/** @type {seq.ExclusiveScan<string, undefined|Path>} */
+const pathNormReduce = seq.exclusiveScan
     (path => item =>
         path === undefined ?
             undefined :

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "functionalscript",
-  "version": "0.0.178",
+  "version": "0.0.185",
   "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 */
 
 /**

package/sequence/asyncIterable/index.js

@@ -55,10 +55,10 @@ const scan = s => c => ({
     }
 })
 
-/** @type {<T, R>(s: seq.InclusiveScan<T, R>) => (c: AsyncOrSyncIterable<T>) => AsyncIterable<R>} */
-const inclusiveScan = ([first, s]) => c => concat([first])(scan(s)(c))
+/** @type {<T, R>(s: seq.ExclusiveScan<T, R>) => (c: AsyncOrSyncIterable<T>) => AsyncIterable<R>} */
+const exclusiveScan = ([first, s]) => c => concat([first])(scan(s)(c))
 
-/** @type {<T, R>(is: seq.InclusiveScan<T, R>) => (c: AsyncOrSyncIterable<T>) => Promise<R>} */
+/** @type {<T, R>(is: seq.ExclusiveScan<T, R>) => (c: AsyncOrSyncIterable<T>) => Promise<R>} */
 const reduce = ([first, s]) => async c => {
     let next = first
     for await (const i of scan(s)(c)) {
@@ -105,7 +105,7 @@ module.exports = {
     /** @readonly */
     scan,
     /** @readonly */
-    inclusiveScan,
+    exclusiveScan,
     /** @readonly */
     takeWhile,
 }

package/sequence/index.js

@@ -1,5 +1,4 @@
 const op = require('../function/operator')
-const { id } = require('../function')
 
 /**
  * @template T0
@@ -22,12 +21,12 @@ const { id } = require('../function')
 /**
  * @template T
  * @template R
- * @typedef {Tuple2<R, Scan<T, R>>} InclusiveScan
+ * @typedef {Tuple2<R, Scan<T, R>>} ExclusiveScan
  */
 
-/** @type {<R, T>(operator: op.BinaryOperator<R, T>) => (prior: R) => Scan<T, R>} */
+/** @type {<R, T>(operator: op.ReduceOperator<R, T>) => (prior: R) => Scan<T, R>} */
 const scan = operator => {
-    /** @typedef {typeof operator extends op.BinaryOperator<infer R, infer T> ? [R, T] : never} RT */
+    /** @typedef {typeof operator extends op.ReduceOperator<infer R, infer T> ? [R, T] : never} RT */
     /** @typedef {RT[0]} R */
     /** @typedef {RT[1]} T */
     /** @type {(prior: R) => Scan<T, R>} */
@@ -38,8 +37,8 @@ const scan = operator => {
     return f
 } 
 
-/** @type {<R, T>(operator: op.BinaryOperator<R, T>) => (first: R) => InclusiveScan<T, R>} */
-const inclusiveScan = operator => first => [first, scan(operator)(first)]
+/** @type {<R, T>(operator: op.ReduceOperator<R, T>) => (first: R) => ExclusiveScan<T, R>} */
+const exclusiveScan = operator => first => [first, scan(operator)(first)]
 
 /** 
  * @template T
@@ -51,12 +50,15 @@ const createEntries = index => value => [[index, value], createEntries(index + 1
 
 const entries = createEntries(0)
 
-/** @type {(separator: string) => InclusiveScan<string, string>} */
+/** @type {(separator: string) => ExclusiveScan<string, string>} */
 const join = separator => ['', value => [value, scan(op.join(separator))(value)]]
 
-const sum = inclusiveScan(op.addition)(0)
+const sum = exclusiveScan(op.addition)(0)
 
-const length = inclusiveScan(a => () => a + 1)(0)
+/** @type {(a: number) => () => number} */
+const counter = a => () => a + 1
+
+const length = exclusiveScan(counter)(0)
 
 /**
  * @template T
@@ -72,7 +74,7 @@ const filter = flatMap => f => flatMap(x => f(x) ? [x] : [])
 
 module.exports = {
     /** @readonly */
-    inclusiveScan,
+    exclusiveScan,
     /** @readonly */
     scan,
     /** @readonly */

package/sequence/iterable/index.js

@@ -21,10 +21,10 @@ const scan = s => c => ({
     }
 })
 
-/** @type {<T, R>(s: seq.InclusiveScan<T, R>) => (c: Iterable<T>) => Iterable<R>} */
-const inclusiveScan = ([first, s]) => c => concat([first])(scan(s)(c))
+/** @type {<T, R>(s: seq.ExclusiveScan<T, R>) => (c: Iterable<T>) => Iterable<R>} */
+const exclusiveScan = ([first, s]) => c => concat([first])(scan(s)(c))
 
-/** @type {<T, R>(s: seq.InclusiveScan<T, R>) => (c: Iterable<T>) => R} */
+/** @type {<T, R>(s: seq.ExclusiveScan<T, R>) => (c: Iterable<T>) => R} */
 const reduce = ([first, s]) => c => {
     let next = first
     for (const i of scan(s)(c)) {
@@ -93,7 +93,7 @@ module.exports = {
     /** @readonly */
     scan,
     /** @readonly */
-    inclusiveScan,
+    exclusiveScan,
     /** @readonly */
     flatMap,
     /** @readonly */

package/sequence/list/index.js

@@ -1,12 +1,28 @@
 const array = require('../array')
-const option = require('../../option')
 const base = require('..')
 const { pipe } = require('../../function')
-const { todo } = require('../../dev')
+const { logicalNot, strictEqual } = require('../../function/operator')
 
 /**
  * @template T
- * @typedef {() => Result<T>} List
+ * @typedef {() => Result<T>} ListFunc
+ */
+
+/**
+ * @template T
+ * @typedef {readonly [List<T>, List<T>]} Concat
+ */
+
+/**
+ * Use `next` function to get `first` and `tail` of the list.
+ * 
+ * Please note that the list also contains `Concat<T>. We need this as 
+ * a 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 { ListFunc<T> | Concat<T>} List
  */
 
 /**
@@ -21,60 +37,72 @@ const { todo } = require('../../dev')
 
 const empty = () => undefined
 
+/** @type {<F, T>(a: readonly[F, List<T>]) => (b: List<T>) => readonly[F, List<T>]} */
+const norm = ([a0, a1]) => b => [a0, [a1, b]]
+
+/** @type {<T>(list: List<T>) => Result<T>} */
+const next = 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 norm(result)(b)
+            }
+            i = b
+        } else {
+            i = norm(a)(b)
+        }
+    }
+}
+
+/** @type {<T>(list: List<T>) => T|undefined} */
+const first = list => {
+    const result = next(list)
+    if (result === undefined) { return undefined }
+    return result[0]
+}
+
 /**
  * @template T
  * @template R
  * @typedef {(list: List<T>) => List<R>} ListMap
  */
 
-/** @type {<T>(first: T) => ListMap<T, T>} */
-const list = first => tail => () => [first, tail]
+/**
+ * @template T
+ * @template R
+ * @typedef {(list: List<T>) => R} ListReduce
+ */
 
 /** @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 at = index => {
-        /** @type {(value: readonly [T]) => Result<T>} */
-        const result = ([value]) => list(value)(at(index + 1))()
-        return () => option.map(result)(array.at(index)(a))
+    const at = index => () => {
+        const result = array.at(index)(a)
+        if (result === undefined) { return undefined }
+        return [result[0], at(index + 1)]
     }
     return at(0)
 }
 
-/**
- * Note: the function is not completly lazy.
- *       it calls `a()` as soon as `a` and `b` are provided.
- *       Othrewise we may have a stack overflow if a list 
- *       contains a lot of concateneted empty lists.
- *       And we can't relay on ES6 TCO (Tail Call Optimization) 
- *       because it's not supported by Chrome and Firefox.
- * @type {<T>(list0: List<T>) => ListMap<T, T>} 
- */
-const concat = a => b => {
-    const result = a()
-    if (result !== undefined) {
-        const [first, tail] = result
-        return () => [first, concat(tail)(b)]
-    }
-    return b
-    // /** @typedef {typeof a extends List<infer T> ? T : never} T */
-    // /** @type {(firstAntTail: FirstAndTail<T>) => Result<T>} */
-    // const defined = ([first, tail]) => [first, concat(tail)(b)]
-    // return option.match(defined)(b)(a())
-}
+/** @type {<T>(list0: List<T>) => ListMap<T, T>} */
+const concat = a => b => [a, b]
 
 /** @type {<T, R>(f: (value: T) => List<R>) => ListMap<T, R>} */
 const flatMap = f => input => () => {
     let i = input
     while (true) { 
-        const result = i()
+        const result = next(i)
         if (result === undefined) { return undefined }
         const [first, tail] = result
-        const firstResult = f(first)() 
+        const firstResult = next(f(first)) 
         if (firstResult !== undefined) {
             const [firstFirst, firstTail] = firstResult
             return [firstFirst, concat(firstTail)(flatMap(f)(tail))]
@@ -92,35 +120,46 @@ const map = f => flatMap(i => one(f(i)))
 /** @type {<T>(f: (value: T) => boolean) => ListMap<T, T>} */
 const filter = f => flatMap(i => f(i) ? one(i) : empty)
 
+/** @type {<T, R>(f: (value: T) => R|undefined) => (value: T) => List<R>} */
+const filterMapFunc = f => i => {
+    const result = f(i)
+    if (result === undefined) { return empty }
+    return one(result)
+}
+
+/** @type {<T, R>(f: (value: T) => R|undefined) => ListMap<T, R>} */
+const filterMap = f => flatMap(filterMapFunc(f)) 
+
 /** @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)]
+    const result = next(input)
+    if (result === undefined) {
+        return result
     }
-    return option.map(defined)(input())
+    const [first, tail] = result
+    const [newFirst, newS] = s(first)
+    return [newFirst, scan(newS)(tail)]
 }
 
-/** @type {<T, R>(s: base.InclusiveScan<T, R>) => ListMap<T, R>} */
-const inclusiveScan = ([first, s]) => input => list(first)(scan(s)(input))
+/** @type {<T, R>(s: base.ExclusiveScan<T, R>) => ListMap<T, R>} */
+const exclusiveScan = ([first, s]) => input => () => [first, scan(s)(input)]
 
 /** @type {<T>(def: T) => (input: List<T>) => T} */
 const last = def => input => {
-    let i = input()
     let r = def
-    while (i !== undefined) {
-        r = i[0]
-        i = i[1]()
+    let i = input    
+    while (true) {
+        const result = next(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 = s => input => last(s[0])(inclusiveScan(s)(input))
+/** @type {<T, R>(s: base.ExclusiveScan<T, R>) => (input: List<T>) => R} */
+const reduce = ([first, s]) => input => last(first)(scan(s)(input))
 
 const entries = scan(base.entries)
 
@@ -130,42 +169,100 @@ const length = reduce(base.length)
 
 const join = pipe(base.join)(reduce)
 
-/** @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)(filter(f)(input)())
+/** @type {<T>(f: (value: T) => boolean) => ListMap<T, T>} */
+const takeWhile = f => input => () => {
+    const result = next(input)
+    if (result === undefined || !f(result[0])) { return undefined }
+    return result
 }
 
-/**
- * Note: probably, it's possible to implement using the `scan` concept.
- * @type {<T>(list: List<T>) => Iterable<T>} 
- */
+/** @type {(n: number) => <T>(input: List<T>) => List<T>} */
+const drop = n => input => () => {
+    let iN = n
+    let iInput = input
+    while (true) {
+        const result = next(iInput)
+        if (iN <= 0 || result === undefined) { return result }
+        iN = iN - 1
+        iInput = result[1]
+    }
+}
+
+/** @type {(n: number) => <T>(input: List<T>) => T|undefined} */
+const at = n => input => first(drop(n)(input))
+
+/** @type {<T>(f: (value: T) => boolean) => ListReduce<T, T|undefined>} */
+const find = f => input => first(filter(f)(input))
+
+/** @type {<T>(f: (value: T) => boolean) => ListReduce<T, boolean>} */
+const some = f => input => find(x => x)(map(f)(input)) !== undefined
+
+/** @type {<T>(value: T) => ListReduce<T, boolean>} */
+const includes = value => some(strictEqual(value))
+
+/** @type {<T>(f: (value: T) => boolean) => ListReduce<T, boolean>} */
+const every = f => input => !some(pipe(f)(logicalNot))(input)
+
+/** @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 = next(i)
+            if (result === undefined) { return }
+            yield result[0]
+            i = result[1]
+        }
+    }
+})
+
+/** @type {<T>(list: List<T>) => AsyncIterable<T>} */
+const asyncIterable = list => ({
+    async *[Symbol.asyncIterator]() {
+        let i = list
+        while (true) {
+            const result = next(i)
+            if (result === undefined) { return }
             yield result[0]
-            result = result[1]()
+            i = result[1]
         }
     }
 })
 
+/** @type {<A>(a: List<A>) => <B>(b: List<B>) => List<array.Tuple2<A, B>>} */
+const zip = a => b => () => {
+    const resultA = next(a)
+    if (resultA === undefined) { return undefined }
+    const resultB = next(b)
+    if (resultB === undefined) { return undefined }
+    return [[resultA[0], resultB[0]], zip(resultA[1])(resultB[1])]
+}
+
+/** @type {<T>(list: List<T>) => readonly T[]} */
+const toArray = input => Array.from(iterable(input))
+
 module.exports = {
     /** @readonly */
-    list,
+    next,
     /** @readonly */
     one,
     /** @readonly */
     empty,
     /** @readonly */
+    at,
+    /** @readonly */
     concat,
     /** @readonly */
+    first,
+    /** @readonly */
     fromArray,
     /** @readonly */
+    toArray,
+    /** @readonly */
     iterable,
     /** @readonly */
+    asyncIterable,
+    /** @readonly */
     flatMap,
     /** @readonly */
     flat,
@@ -174,9 +271,11 @@ module.exports = {
     /** @readonly */
     filter,
     /** @readonly */
+    filterMap,
+    /** @readonly */
     scan,
     /** @readonly */
-    inclusiveScan,
+    exclusiveScan,
     /** @readonly */
     last,
     /** @readonly */
@@ -190,5 +289,17 @@ module.exports = {
     /** @readonly */
     length,
     /** @readonly */
+    drop,
+    /** @readonly */
     find,
+    /** @readonly */
+    takeWhile,
+    /** @readonly */
+    some,
+    /** @readonly */
+    every,
+    /** @readonly */
+    includes,
+    /** @readonly */
+    zip,
 }

package/sequence/list/test.js

@@ -3,10 +3,12 @@ const { sum } = require('..')
 
 /** @type {<T>(l: list.List<T>) => void} */
 const print = a => {
-    let i = a()
-    while (i !== undefined) {
-        console.log(i[0])
-        i = i[1]()
+    let i = a
+    while (true) {
+        const result = list.next(i)
+        if (result === undefined) { return }
+        // console.log(result[0])
+        i = result[1]
     }
 }
 
@@ -15,22 +17,27 @@ const print = a => {
     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 list3 = list.exclusiveScan(sum)(list0)
     const r = list.find(x => x === 42)(big)
+    if (list.every(x => x > 0)(big) !== true) { throw 'x'}
+    if (list.every(x => x < 20)(big) !== false) { throw 'x' }
+    if (list.some(x => x > 100)(big) !== false) { throw 'x' }
+    if (list.some(x => x > 50)(big) !== true) { throw 'x' }
+    if (list.first(list.drop(16)(big)) !== 42) { throw 'drop'}
     {
         let x = big
-        for (let i = 0; i < 10000; ++i) {
+        for (let i = 0; i < 1_000_000; ++i) {
             x = list.concat(list.empty)(x)
         }
-        const r = x()
-        print(x)
+        const r = list.next(x)
+        // print(x)
     } 
     {
         let x = big
-        for (let i = 0; i < 10000; ++i) {
-            x = list.concat(x)(list.empty)
+        for (let i = 0; i < 1_000_000; ++i) {
+            x = list.concat(x)(list.one(i))
         }
-        const r = x()
-        print(x)
+        const r = list.next(x)
+        // print(x)
     }
 }