functionalscript 0.0.428 → 0.0.429

package/commonjs/build/module.f.cjs

@@ -8,7 +8,7 @@ const object = require('../../types/object/module.f.cjs')
 const { fromMap } = object
 const path = require('../path/module.f.cjs')
 const { parseAndFind } = path
-const stringSet = require('../../types/stringset/module.f.cjs')
+const stringSet = require('../../types/string_set/module.f.cjs')
 const { set: setSet, contains: setContains } = stringSet
 
 /**

package/fsm/README.md

@@ -0,0 +1,4 @@
+# FSM
+
+This module is about a [finite-state machine](https://en.wikipedia.org/wiki/Finite-state_machine). It's not about
+[Flying Spaghetti Monster](https://en.wikipedia.org/wiki/Flying_Spaghetti_Monster).

package/fsm/module.f.cjs

@@ -0,0 +1,28 @@
+const { todo } = require('../dev/module.f.cjs')
+const list = require('../types/list/module.f.cjs')
+const byteSet = require('../types/byte_set/module.f.cjs')
+
+/** @typedef {readonly[string, byteSet.ByteSet, string]} Rule */
+
+/** @typedef {list.List<Rule>} Grammar */
+
+/** @typedef {readonly string[]} ByteMap */
+
+/**
+ * @typedef {{
+ *  readonly[state in string]: ByteMap
+ * }} Dfa
+ */
+
+/** @type {(faId: string) => string} */
+const escape = faId => todo()
+
+/** @type {(grammar: Grammar) => Dfa} */
+const dfa = grammar => todo()
+
+module.exports = {
+    /** @readonly */
+    escape,
+    /** @readonly */
+    dfa,
+}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "functionalscript",
-  "version": "0.0.428",
+  "version": "0.0.429",
   "description": "FunctionalScript is a functional subset of JavaScript",
   "main": "module.f.cjs",
   "scripts": {

package/types/byte_set/module.f.cjs

@@ -0,0 +1,57 @@
+const { fn } = require('../function/module.f.cjs')
+
+/** @typedef {bigint} ByteSet */
+/** @typedef {number} Byte */
+
+/** @type {(n: Byte) => (s: ByteSet) => boolean} */
+const has = n => s => ((s >> BigInt(n)) & 1n) === 1n
+
+// create a set
+
+const empty = 0n
+
+/** @type {(n: Byte) => ByteSet} */
+const one = n => 1n << BigInt(n)
+
+/** @type {(r: readonly[Byte, Byte]) => ByteSet} */
+const range = ([b, e]) => one(e - b + 1) - 1n << BigInt(b)
+
+// set operations
+
+/** @type {(a: ByteSet) => (b: ByteSet) => ByteSet} */
+const union = a => b => a | b
+
+/** @type {(a: ByteSet) => (b: ByteSet) => ByteSet} */
+const intersect = a => b => a & b
+
+/** @type {(a: ByteSet) => (b: ByteSet) => ByteSet} */
+const difference = a => b => intersect(a)(complement(b))
+
+/** @type {(n: ByteSet) => ByteSet} */
+const complement = n => ~n
+
+// additional operations
+
+const set = fn(one).then(union).result
+
+const setRange = fn(range).then(union).result
+
+/** @type {(n: Byte) => (s: ByteSet) => ByteSet} */
+const unset = n => s => difference(s)(one(n))
+
+module.exports = {
+    /** @readonly */
+    empty,
+    /** @readonly */
+    has,
+    /** @readonly */
+    set,
+    /** @readonly */
+    unset,
+    /** @readonly */
+    union,
+    /** @readonly */
+    setRange,
+    /** @readonly */
+    range,
+}

package/types/module.f.cjs

@@ -10,13 +10,15 @@ module.exports = {
     /** @readonly */
     map: require('./map/module.f.cjs'),
     /** @readonly */
+    nibbleSet: require('./nibble_set/module.f.cjs'),
+    /** @readonly */
     object: require('./object/module.f.cjs'),
     /** @readonly */
     range: require('./range/module.f.cjs'),
     /** @readonly */
     result: require('./result/module.f.cjs'),
     /** @readonly */
-    stringset: require('./stringset/module.f.cjs'),
+    stringSet: require('./string_set/module.f.cjs'),
     /** @readonly */
     bigint: require('./bigint/module.f.cjs'),
     /** @readonly */

package/types/byteSet/module.f.cjs

@@ -1,30 +0,0 @@
-/** @typedef {bigint} byteSet */
-/** @typedef {number} byte */
-
-/** @type {(n: byte) => (s: byteSet) => boolean} */
-const has = n => s => ((s >> BigInt(n)) & 1n) === 1n
-
-/** @type {(n: byte) => (s: byteSet) => byteSet} */
-const set = n => s => s | (1n << BigInt(n))
-
-/** @type {(n: byte) => (s: byteSet) => byteSet} */
-const unset = n => s => s & ~(1n << BigInt(n))
-
-/** @type {(r: readonly[number, number]) => (s: byteSet) => byteSet} */
- const setRange = ([b, e]) => s => s | ((1n << BigInt(e - b + 1)) - 1n << BigInt(b))
-
-// how to define FA???
-// const stateA = [init, set] ????
-
-module.exports = {
-    /** @readonly */
-    empty: 0n,
-    /** @readonly */
-    has,
-    /** @readonly */
-    set,
-    /** @readonly */
-    unset,
-    /** @readonly */
-    setRange
-}