functionalscript 0.0.287 → 0.0.291

package/README.md

@@ -9,8 +9,6 @@ FunctionalScript is a pure functional programming language and a strict subset o
 
 Create a new FunctionalScript repository on GitHub [here](https://github.com/functionalscript/template/generate).
 
-Try FunctionalScript [here](https://functionalscript.com/).
-
 ## 1. Design Principles
 
 In FunctionalScript:
@@ -186,3 +184,56 @@ const f = x => {
    return r
 }
 ```
+
+## 5. Statements
+
+`{ A_LIST_OF_STATEMENTS }` is one or many statements seperated by the newline control character. One of these statements mentioned earlier was [definition](#25-Definitions), also known as a [const](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/const) statement. The other statements are described below.
+
+### 5.1 Let 
+
+[Let](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/let) declares a local mutable alias for immutable objects. For example
+
+```js
+let x = [5]
+// you can assign another immutable object to the alias at any time.
+x = [3, 4]
+//but you can't change the properties of the immutable object.
+x[0] = 3 // < invalid
+//let aliases can not be referenced from another arrow function.
+const f = () => x // < invalid
+```
+
+
+
+This mutable object cannot be used in [closures](https://en.wikipedia.org/wiki/Closure_(computer_programming)) or nested functions.
+
+An example of incorrect code would look like this:
+
+```js
+let x = 5
+const f = () => x
+```
+
+### 5.2 Return 
+
+[Return](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/return)
+
+### 5.3 If...Else
+
+[If...Else](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/if...else)
+
+### 5.4 Switch
+
+[Switch](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/switch)
+
+### 5.5 Throw
+
+[Throw](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/throw). FunctionalScript allows to throw exceptions but it doesn't catch them. You should only be using Statement throw in non-recoverable situations. It could be compared to [panic in Rust](https://doc.rust-lang.org/std/macro.panic.html).
+
+### 5.6 While
+
+[While](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/while)
+
+### 5.7 Block
+
+[Block](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/block)

package/package.json

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

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/set/index.js

@@ -1,39 +1,93 @@
 const _ = require('..')
-const { find } = require('../find')
+const find = require('../find')
 const cmp = require('../../function/compare')
-const { todo } = require('../../../dev')
+const list = require('../../list')
 
-/** @type {<T>(c: cmp.Compare<T>) => (value: T) => (node: _.Node<T>) => _.Node<T>} */
-const set = c => value => node => {
-    const { first, tail } = find(c)(node)
-    switch (first[0]) {
+/**
+ * @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: {
-            // x2
-            const x = first[1]
-            return todo()
-        }
-        case 1: {
-            // x4
-            const x = first[1];
-            return todo()
+            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: {
-            // x2
-            const x = first[1];
-            return todo()
-        }
-        case 3: {
-            // x2
-            const x = first[1];
-            return todo()
+            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: {
-            // x1
-            const x = first[1];
-            return todo()
+            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]]
+            }
         }
     }
-    return todo()
+    const r = list.reduce(reduce)(f())(tail)
+    return r.length === 1 ? r[0] : r
 }
 
-module.exports = {}
+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)