subscript 3.0.3 → 5.2.0

package/README.md

@@ -1,11 +1,11 @@
-# <!--<img alt="subscript" src="/subscript2.svg" height=42/>--> sub͘<em>script</em> <!--<sub>SUB͘<em>SCRIPT</em></sub>-->
+# <img alt="subscript" src="/subscript2.svg" height=42/> <!--sub͘<em>script</em>--> <!--<sub>SUB͘<em>SCRIPT</em></sub>-->
 
 _Subscript_ is micro-language with common syntax subset of C++, JS, Java, Python, Go, Rust, Swift, Objective C, Kotlin etc.<br/>
 
 * Well-known syntax
 * Any _subscript_ fragment can be copy-pasted to any target language
 * It's tiny <sub>![npm bundle size](https://img.shields.io/bundlephobia/minzip/subscript/latest?color=brightgreen&label=gzip)</sub>
-* It's very fast ([see performance](#performance))
+* It's :rocket: fast ([see performance](#performance))
 * Configurable & extensible
 * Trivial to use...
 
@@ -26,17 +26,28 @@ _Subscript_ is designed to be useful for:
 * sandboxes, playgrounds, safe eval
 * custom DSL
 
-[_Jsep_](https://github.com/EricSmekens/jsep) is generally fine for the listed tasks, unless you design a tiny module and prefer to keep dependencies as small as possible.
-_Subscript_ has [2.5kb](https://npmfs.com/package/subscript/3.0.0/subscript.min.js) footprint vs [11.4kb](https://npmfs.com/package/jsep/1.2.0/dist/jsep.min.js) _jsep_, with same or better performance. It also has more open API and generates lispy calltree (compatible with [frisk](https://npmjs.com/frisk)), compared to esprima AST: minimal possible overhead, clear precedence, overloading by context, manual evaluation, debugging, conventional form, one-liner docs:
+[_Jsep_](https://github.com/EricSmekens/jsep) is generally fine for the listed tasks, unless you need dependencies as small as possible.
+_Subscript_ has [2.5kb](https://npmfs.com/package/subscript/5.0.0/subscript.min.js) footprint vs [11.4kb](https://npmfs.com/package/jsep/1.2.0/dist/jsep.min.js) _jsep_, with better performance.
+
+
+## Evaluation
+
+_Subscript_ parser generates lispy calltree (compatible with [frisk](https://npmjs.com/frisk)), which is compared to esprima AST has:
+
++ minimal possible overhead
++ clear precedence
++ overloading by context
++ manual evaluation and debugging
++ conventional form
++ one-liner docs:
 
 ```js
 import {evaluate} from 'subscript.js'
 
 evaluate(['+', ['*', 'min', 60], '"sec"'], { min: 5 }) // min*60 + "sec" == "300sec"
-``` 
-
+```
 
-## Operators
+## Extending
 
 Default operators include common operators for the listed languages in the following precedence:
 
@@ -53,17 +64,15 @@ Default operators include common operators for the listed languages in the follo
 * `&&`
 * `||`
 
-All other operators can be extended via `parse.binary`, `parse.unary` and `evaluate.operator`.
+Operators can be extended via `parse.operator(str, prec, type)` and `evaluate.operator(str, fn)` functions for any unary/binary/postfix operators, calls, props, groups, arrays, objects etc.
 
 ```js
 import { parse, evaluate } from 'subscript.js'
 
-// add precedences
-parse.binary['=>'] = 10
+parse.operator('=>', 10) // precedence=10, type=default (0 - binary, 1 - postfix, -1 - prefix)
 
-// define evaluators
-evaluate.operator['=>'] = ( args, body ) => evaluate(body, args)
-evaluate.operator['|'] = ( a, ...b ) => a.pipe(...b)
+evaluate.operator('=>', ( args, body ) => evaluate(body, args))
+evaluate.operator('|', ( a, ...b ) => a.pipe(...b))
 
 let tree = parse(`
   interval(350)
@@ -74,28 +83,36 @@ let tree = parse(`
 evaluate(tree, { Math, map, take, interval, gaussian })
 ```
 
-## Extending
+---
 
-By default subscript detects the following tokens:
+Default tokens include:
 
-* `"` strings
+* `"abc"` strings
 * `1.2e+3` floats
-* `true`, `false`, `null` literals
-* `()` expression groups or fn calls
-* `.`, `[]` property access
+* identifiers
+
+Tokens are extensible via `parse.token` list, can be added support of _literals_, _regexes_, _strings_, _numbers_ and others.
 
-Literals can be extended via `parse.literal` dict.
+```js
+import parse, {char} from 'subscript/parse.js'
+import evaluate from 'subscript/evaluate.js'
+
+conts ctx = {x:1}
+parse.token.unshift(c => char(4) === 'this' ? ctx : null)
+evaluate(parse(`this.x`)) // 1
+```
 
-Token parsers are extensible via `parse.token` list, can be added support of _regex_, _array_, _object_, _interpolated string_ and others.
+---
 
-Postfix parsers are applied to parsed tokens and can be used to provide _property chains_, _function calls_, _postfix operators_, _token mapping_, _ternary operators_ and so on. They're extensible via `parse.postfix`.
+Comments can be added via extending `parse.space`. See [justin.js](./justin.js) for more examples.
 
 
 ## Justin
 
 _Justin_ extension (original [thread](https://github.com/endojs/Jessie/issues/66)) is minimal JS subset − JSON with JS expressions.<br/>
-It adds support for:
+It adds support of:
 
++ `===`, `!==` operators
 + `**` binary operator
 + `~` unary operator
 + `'` strings
@@ -105,8 +122,8 @@ It adds support for:
 + `in` binary operator
 + `;` expression separator
 + unary word operators
-<!-- + `//, /* */` comments -->
-<!-- + `undefined` literal -->
++ `//`, `/* */` comments
++ `true`, `false`, `null`, `undefined` literals
 <!-- + `?` chaining operator -->
 <!-- + `...x` unary operator -->
 <!-- + strings interpolation -->
@@ -263,8 +280,8 @@ Subscript shows relatively good performance within other evaluators:
 // 1 + (a * b / c % d) - 2.0 + -3e-3 * +4.4e4 / f.g[0] - i.j(+k == 1)(0)
 // parse 30k times
 
-subscript: ~280 ms
-jsep: ~281 ms
+subscript: ~220 ms
+jsep: ~280 ms
 expr-eval: ~480 ms
 jexl: ~1200 ms
 new Function: ~1400 ms

package/evaluate.js

@@ -4,54 +4,22 @@ export const isCmd = a => Array.isArray(a) && (typeof a[0] === 'string' || isCmd
 evaluate = (s, ctx={}, c, op) => {
   if (isCmd(s)) {
     c = s[0]
-    if (typeof c === 'string') op = operator[c]
+    if (typeof c === 'string') op = lookup[c]
     c = op || evaluate(c, ctx) // [[a,b], c]
     if (typeof c !== 'function') return c
-
     return c.call(...s.map(a => evaluate(a,ctx)))
   }
   if (s && typeof s === 'string')
     return s[0] === '"' ? s.slice(1,-1)
-          : s[0]==='@' ? s.slice(1)
-          : s in ctx ? ctx[s] : s
+      : s[0]==='@' ? s.slice(1)
+      : s in ctx ? ctx[s] : s
 
   return s
 },
+lookup = {},
 
 // op evaluators
 // multiple args allows shortcuts, lisp compatible, easy manual eval, functions anyways take multiple arguments
-operator = evaluate.operator = {
-  '!':a=>!a,
-  '++':a=>++a,
-  '--':a=>--a,
-
-  '.':(...a)=>a.reduce((a,b)=>a?a[b]:a),
-
-  '%':(...a)=>a.reduce((a,b)=>a%b),
-  '/':(...a)=>a.reduce((a,b)=>a/b),
-  '*':(...a)=>a.reduce((a,b)=>a*b),
-
-  '+':(...a)=>a.reduce((a,b)=>a+b),
-  '-':(...a)=>a.length < 2 ? -a : a.reduce((a,b)=>a-b),
-
-  '>>>':(a,b)=>a>>>b,
-  '>>':(a,b)=>a>>b,
-  '<<':(a,b)=>a<<b,
-
-  '>=':(a,b)=>a>=b,
-  '>':(a,b)=>a>b,
-  '<=':(a,b)=>a<=b,
-  '<':(a,b)=>a<b,
-
-  '!=':(a,b)=>a!=b,
-  '==':(a,b)=>a==b,
-
-  '&':(a,b)=>a&b,
-  '^':(a,b)=>a^b,
-  '|':(a,b)=>a|b,
-  '&&':(...a)=>a.every(Boolean),
-  '||':(...a)=>a.some(Boolean),
-  ',':(...a)=>a.reduce((a,b)=>(a,b))
-}
+operator = evaluate.operator = (op, fn) => lookup[op] = fn.length == 2 ? (...a)=>a.reduce(fn) : fn
 
 export default evaluate

package/justin.js

@@ -1,97 +1,222 @@
 // justin lang https://github.com/endojs/Jessie/issues/66
-import {evaluate, operator} from './evaluate.js'
-import {parse, binary, unary, postfix, token, literal,
-        code, char, skip, space, expr} from './parse.js'
-
-// undefined
-literal['undefined'] = undefined
-
-// "' with /
-token[2] = (q, qc, c, str) => {
-  if (q !== 34 && q !== 39) return
-  qc = char(), skip(), str = ''
-  while (c=code(), c-q) {
-    if (c === 92) skip(), str += escape[char()] || char(); else str+=char()
-    skip()
-  }
-  return skip(), qc + str + qc
-}
-const escape = {n:'\n', r:'\r', t:'\t', b:'\b', f:'\f', v:'\v'}
-
-// unary word
-postfix.push((node, prec) => typeof node === 'string' && (prec=unary[node]) ? [node, expr(prec)] : node)
-
-// detect custom operators
-token[3] = name => (name = skip(c =>
-  (
+import {evaluate} from './evaluate.js'
+import {parse, code, char, skip, expr, err} from './parse.js'
+
+const PERIOD=46, OPAREN=40, CPAREN=41, CBRACK=93, SPACE=32,
+
+PREC_SEQ=1, PREC_SOME=4, PREC_EVERY=5, PREC_OR=6, PREC_XOR=7, PREC_AND=8,
+PREC_EQ=9, PREC_COMP=10, PREC_SHIFT=11, PREC_SUM=12, PREC_MULT=13, PREC_UNARY=15, PREC_POSTFIX=16, PREC_CALL=18, PREC_GROUP=19
+
+
+// tokens
+const v = v => ({valueOf:()=>v})
+parse.token.push(
+  // TODO: better parser
+  // 1.2e+3, .5 - fast & small version, but consumes corrupted nums as well
+  (number) => (
+    (number = skip(c => (c > 47 && c < 58) || c == PERIOD)) && (
+      (code() == 69 || code() == 101) && (number += skip(2) + skip(c => c >= 48 && c <= 57)),
+      isNaN(number = new Number(number)) ? err('Bad number') : number
+    )
+  ),
+
+  // "' with /
+  (q, qc, c, str) => {
+    if (q !== 34 && q !== 39) return
+    qc = char(), skip(), str = ''
+    while (c=code(), c-q) {
+      if (c === 92) skip(), str += escape[char()] || char(); else str+=char()
+      skip()
+    }
+    return skip(), qc + str + qc
+  },
+
+  // {}
+  (cc, node) => (
+    cc === 123 && (skip(), node = mapObj(['{', expr(0,125)]), skip(), node)
+  ),
+
+  // literal
+  c =>
+    c === 116 && char(4) === 'true' && skip(4) ? v(true) :
+    c === 102 && char(5) === 'false' && skip(5) ? v(false) :
+    c === 110 && char(4) === 'null' && skip(4) ? v(null) :
+    c === 117 && char(9) === 'undefined' && skip(9) ? v(undefined) :
+    null,
+
+  // id
+  c => skip(c =>
     (c >= 48 && c <= 57) || // 0..9
     (c >= 65 && c <= 90) || // A...Z
     (c >= 97 && c <= 122) || // a...z
     c == 36 || c == 95 || // $, _,
-    c >= 192 // any non-ASCII
-  ) && !binary[String.fromCharCode(c)]
-)),
-
-
-// **
-binary['**'] = 16
-operator['**'] = (...args)=>args.reduceRight((a,b)=>Math.pow(b,a))
-
-// ~
-unary['~'] = 17
-operator['~'] = a=>~a
+    (c >= 192 && c != 215 && c != 247) // any non-ASCII
+  )
+)
 
-// ...
-// unary[1]['...']=true
+const escape = {n:'\n', r:'\r', t:'\t', b:'\b', f:'\f', v:'\v'}
 
-// ;
-binary[';'] = 1
+// {}
+const mapObj = (n, args) => (
+  args = !n[1] ? [] :
+  (n[1][0]==':') ? [n[1]] :
+  (n[1][0]==',') ? n[1].slice(1) : args,
+  ['{', ...args]
+)
 
-// ?:
-operator['?:']=(a,b,c)=>a?b:c
-postfix.push(node => {
-  let a, b
-  if (code() !== 63) return node
-  skip(), space(), a = expr(-1,58)
-  if (code() !== 58) return node
-  skip(), space(), b = expr()
-  return ['?:',node, a, b]
-})
 
 // /**/, //
-// comments['/*']='*/'
-// comments['//']='\n'
-
-// in
-evaluate.operator['in'] = (a,b)=>a in b
-parse.postfix.unshift(node => (char(2) === 'in' ? (skip(2), ['in', '"' + node + '"', expr()]) : node))
-
-// []
-operator['['] = (...args) => Array(...args)
-token.push((node, arg) =>
-  code() === 91 ?
-  (
-    skip(), arg=expr(-1,93),
-    node = arg==null ? ['['] : arg[0] === ',' ? (arg[0]='[',arg) : ['[',arg],
-    skip(), node
-  ) : null
-)
-
-// {}
-binary[':'] = 2
-token.unshift((node) => code() === 123 ? (skip(), node = map(['{',expr(-1,125)]), skip(), node) : null)
-operator['{'] = (...args)=>Object.fromEntries(args)
-operator[':'] = (a,b)=>[a,b]
-
-const map = (n, args) => {
-  if (n[1]==null) args = []
-  else if (n[1][0]==':') args = [n[1]]
-  else if (n[1][0]==',') args = n[1].slice(1)
-  return ['{', ...args]
+parse.space = cc => {
+  while (cc = code(), cc <= 32) {
+    skip()
+    if (code() === 47)
+      // /**/
+      if (code(1) === 42) skip(2), skip(c => c !== 42 && code(1) !== 47), skip(2)
+      // //
+      else if (code(1) === 47) skip(2), skip(c => c >= 32)
+  }
+  return cc
 }
 
 
+// operators
+const addOps = (add, stride=2, list) => {
+  for (let i = 0; i < list.length; i+=stride) add(list[i], list[i+1], list[i+2])
+}
+
+addOps(parse.operator, 3, [
+  // subscript ones
+  // TODO: add ,, as node here
+  ',', PREC_SEQ,,
+
+  '|', PREC_OR,,
+  '||', PREC_SOME,,
+
+  '&', PREC_AND,,
+  '&&', PREC_EVERY,,
+
+  '^', PREC_XOR,,
+
+  // ==, !=
+  '==', PREC_EQ,,
+  '!=', PREC_EQ,,
+
+  // > >= >> >>>, < <= <<
+  '>', PREC_COMP,,
+  '>=', PREC_COMP,,
+  '>>', PREC_SHIFT,,
+  '>>>', PREC_SHIFT,,
+  '<', PREC_COMP,,
+  '<=', PREC_COMP,,
+  '<<', PREC_SHIFT,,
+
+  // + ++ - --
+  '+', PREC_SUM,,
+  '+', PREC_UNARY, -1,
+  '++', PREC_UNARY, -1,
+  '++', PREC_UNARY, +1,
+  '-', PREC_SUM,,
+  '-', PREC_UNARY, -1,
+  '--', PREC_UNARY, -1,
+  '--', PREC_UNARY, +1,
+
+  // !
+  '!', PREC_UNARY, -1,
+
+  // * / %
+  '*', PREC_MULT,,
+  '/', PREC_MULT,,
+  '%', PREC_MULT,,
+
+  // a.b
+  '.', PREC_CALL, (node,b) => node && [skip(),node, typeof (b = expr(PREC_CALL)) === 'string' ? '"' + b + '"' : b.valueOf()],
+
+  // a[b]
+  '[', PREC_CALL, (node) => (skip(), node = ['.', node, expr(0,CBRACK).valueOf()], skip(), node),
+  ']',,,
+
+  // a(b)
+  '(', PREC_CALL, (node,b) => ( skip(), b=expr(0,CPAREN), skip(),
+    Array.isArray(b) && b[0]===',' ? (b[0]=node, b) : b ? [node, b.valueOf()] : [node]
+  ),
+  // (a+b)
+  '(', PREC_GROUP, (node,b) => !node && (skip(), b=expr(0,CPAREN) || err(), skip(), b),
+  ')',,,
+
+  // justin extension
+  ';', 1,,
+  '===', 9,,
+  '!==', 9,,
+  '**', 14,,
+  '~', 13, -1,
+  '?', 3, (node) => {
+    if (!node) err('Expected expression')
+    let a, b
+    skip(), parse.space(), a = expr()
+    if (code() !== 58) err('Expected :')
+    skip(), parse.space(), b = expr()
+    return ['?:', node, a, b]
+  },
+  '}',,,
+  ':', 0,,
+  'in', 10, (node) => code(2) <= 32 && [skip(2), '"'+node+'"', expr(10)],
+  '[', 20, (node,arg) => !node && (
+    skip(), arg=expr(0,93), skip(),
+    !arg ? ['['] : arg[0] === ',' ? (arg[0]='[',arg) : ['[',arg]
+  )
+])
+
+addOps(evaluate.operator, 2, [
+  // subscript
+  '!', a=>!a,
+  '++', a=>++a,
+  '--', a=>--a,
+
+  '.', (a,b)=>a?a[b]:a,
+
+  '%', (a,b)=>a%b,
+  '/', (a,b)=>a/b,
+  '*', (a,b)=>a*b,
+
+  '+', (a,b)=>a+b,
+  '-', (...a)=>a.length < 2 ? -a : a.reduce((a,b)=>a-b),
+
+  '>>>', (a,b)=>a>>>b,
+  '>>', (a,b)=>a>>b,
+  '<<', (a,b)=>a<<b,
+
+  '>=', (a,b)=>a>=b,
+  '>', (a,b)=>a>b,
+  '<=', (a,b)=>a<=b,
+  '<', (a,b)=>a<b,
+
+  '!=', (a,b)=>a!=b,
+  '==', (a,b)=>a==b,
+
+  '&', (a,b)=>a&b,
+  '^', (a,b)=>a^b,
+  '|', (a,b)=>a|b,
+  '&&', (...a)=>a.every(Boolean),
+  '||', (...a)=>a.some(Boolean),
+  ',', (a,b)=>(a,b),
+
+  // justin extension
+  '**', (...args)=>args.reduceRight((a,b)=>Math.pow(b,a)),
+  '~', a=>~a,
+  '?:', (a,b,c)=>a?b:c,
+  'in', (a,b)=>a in b,
+
+  // []
+  '[', (...args) => Array(...args),
+  // as operator it's faster to lookup (no need to call extra rule check), smaller and no conflict with word names
+  '{', (...args)=>Object.fromEntries(args),
+  ':', (a,b)=>[a,b]
+])
+
+// TODO ...
 // TODO: strings interpolation
 
-export { default } from './subscript.js';
 export { parse, evaluate }
+
+// code → evaluator
+export default s => (s = typeof s == 'string' ? parse(s) : s,  ctx => evaluate(s, ctx))

package/justin.min.js

@@ -1 +1 @@
-var r,e,n,t,l=r=>Array.isArray(r)&&("string"==typeof r[0]||l(r[0])),o=(r,e={},n,t)=>l(r)?("string"==typeof(n=r[0])&&(t=u[n]),"function"!=typeof(n=t||o(n,e))?n:n.call(...r.map((r=>o(r,e))))):r&&"string"==typeof r?'"'===r[0]?r.slice(1,-1):"@"===r[0]?r.slice(1):r in e?e[r]:r:r,u=o.operator={"!":r=>!r,"++":r=>++r,"--":r=>--r,".":(...r)=>r.reduce(((r,e)=>r&&r[e])),"%":(...r)=>r.reduce(((r,e)=>r%e)),"/":(...r)=>r.reduce(((r,e)=>r/e)),"*":(...r)=>r.reduce(((r,e)=>r*e)),"+":(...r)=>r.reduce(((r,e)=>r+e)),"-":(...r)=>r.length<2?-r:r.reduce(((r,e)=>r-e)),">>>":(r,e)=>r>>>e,">>":(r,e)=>r>>e,"<<":(r,e)=>r<<e,">=":(r,e)=>r>=e,">":(r,e)=>r>e,"<=":(r,e)=>r<=e,"<":(r,e)=>r<e,"!=":(r,e)=>r!=e,"==":(r,e)=>r==e,"&":(r,e)=>r&e,"^":(r,e)=>r^e,"|":(r,e)=>r|e,"&&":(...r)=>r.every(Boolean),"||":(...r)=>r.some(Boolean),",":(...r)=>r.reduce(((r,e)=>e))},i=o,a=(t,l)=>(e=t,r=n=0,l=c(),r<e.length?p():l),s=()=>e.charCodeAt(r),f=(n=1)=>e.substr(r,n),p=(e="Bad syntax "+f())=>{throw Error(e+" at "+r)},d=(n=1,t=r)=>{if("number"==typeof n)r+=n;else for(;n(s());)++r>e.length&&p("End by "+n);return r>t?e.slice(t,r):null},h=()=>{for(;s()<=32;)r++},y=(e,t,l,o=3)=>{if(r&&n&&n[3]===r)return n;for(;o;)if(null!=(l=e[t=f(o--)]))return n=[t,l,t.length,r]},c=(e=-1,n)=>{h();let l,o,u,i,a=s(),d=0,g=r;if(n){if(a===n)return;i=t,t=n}for(;g===r&&d<b.length;)o=b[d++](a);if(g===r)(l=y(m))&&(r+=l[2],o=[l[0],c(l[1])]);else for(h(),a=s(),d=0;d<A.length;)(u=A[d](o,a))!==o?(o=u,h(),a=s()):d++;for(;a=s()&&a!==t&&(l=y(w))&&l[1]>e;){o=[l[0],o];do{r+=l[2],o.push(c(l[1]))}while(f(l[2])===l[0]);h()}return n&&(t=s()!==n?p("Unclosed paren"):i),o},g=r=>d((r=>r>=48&&r<=57||r>=65&&r<=90||r>=97&&r<=122||36==r||95==r||r>=192)),b=a.token=[r=>{if(r=d((r=>r>=48&&r<=57||46===r)))return(69===s()||101===s())&&(r+=d(2)+d((r=>r>=48&&r<=57))),isNaN(r=parseFloat(r))?p("Bad number"):r},(e,n)=>40===e?(r++,n=c(-1,41),r++,n):null,(e,n)=>34===e?(n=f(),r++,n+d((r=>r-e))+(r++,n)):null,g],v=a.literal={true:!0,false:!1,null:null},A=a.postfix=[(n,t,l)=>(46===t?(r++,h(),n=[".",n,'"'+g()+'"']):91===t?(r++,n=[".",n,c(-1,93)],r++):40===t?(r++,l=c(-1,41),n=Array.isArray(l)&&","===l[0]?(l[0]=n,l):null==l?[n]:[n,l],r++):43!==t&&45!==t||e.charCodeAt(r+1)!==t?"string"==typeof n&&v.hasOwnProperty(n)&&(n=v[n]):n=[d(2),n],n)],m=a.unary={"-":17,"!":17,"+":17,"++":17,"--":17},w=a.binary={",":1,"||":6,"&&":7,"|":8,"^":9,"&":10,"==":11,"!=":11,"<":12,">":12,"<=":12,">=":12,"<<":13,">>":13,">>>":13,"+":14,"-":14,"*":15,"/":15,"%":15},x=a,B=r=>(r="string"==typeof r?x(r):r,e=>i(r,e));v.undefined=void 0,b[2]=(r,e,n,t)=>{if(34===r||39===r){for(e=f(),d(),t="";(n=s())-r;)92===n?(d(),t+=C[f()]||f()):t+=f(),d();return d(),e+t+e}};var C={n:"\n",r:"\r",t:"\t",b:"\b",f:"\f",v:"\v"};A.push(((r,e)=>"string"==typeof r&&(e=m[r])?[r,c(e)]:r)),b[3]=r=>d((r=>(r>=48&&r<=57||r>=65&&r<=90||r>=97&&r<=122||36==r||95==r||r>=192)&&!w[String.fromCharCode(r)])),w["**"]=16,u["**"]=(...r)=>r.reduceRight(((r,e)=>Math.pow(e,r))),m["~"]=17,u["~"]=r=>~r,w[";"]=1,u["?:"]=(r,e,n)=>r?e:n,A.push((r=>{let e,n;return 63!==s()||(d(),h(),e=c(-1,58),58!==s())?r:(d(),h(),n=c(),["?:",r,e,n])})),o.operator.in=(r,e)=>r in e,a.postfix.unshift((r=>"in"===f(2)?(d(2),["in",'"'+r+'"',c()]):r)),u["["]=(...r)=>Array(...r),b.push(((r,e)=>91===s()?(d(),r=null==(e=c(-1,93))?["["]:","===e[0]?(e[0]="[",e):["[",e],d(),r):null)),w[":"]=2,b.unshift((r=>123===s()?(d(),r=E(["{",c(-1,125)]),d(),r):null)),u["{"]=(...r)=>Object.fromEntries(r),u[":"]=(r,e)=>[r,e];var E=(r,e)=>(null==r[1]?e=[]:":"==r[1][0]?e=[r[1]]:","==r[1][0]&&(e=r[1].slice(1)),["{",...e]);export{B as default,o as evaluate,a as parse};
+var e,r,t=e=>Array.isArray(e)&&("string"==typeof e[0]||t(e[0])),a=(e,r={},o,l)=>t(e)?("string"==typeof(o=e[0])&&(l=n[o]),"function"!=typeof(o=l||a(o,r))?o:o.call(...e.map((e=>a(e,r))))):e&&"string"==typeof e?'"'===e[0]?e.slice(1,-1):"@"===e[0]?e.slice(1):e in r?r[e]:e:e,n={},o=(a.operator=(e,r)=>n[e]=2==r.length?(...e)=>e.reduce(r):r,(t,a)=>(r=t,e=0,a=p(),e<r.length?l():a.valueOf())),l=(t="Bad syntax")=>{throw Error(t+" `"+r[e]+"` at "+e)},s=(t=1,a=e)=>{if("number"==typeof t)e+=t;else for(;t(u());)e++;return r.slice(a,e)},u=(t=0)=>r.charCodeAt(e+t),f=(t=1)=>r.substr(e,t),p=(e=0,r,t,a,n=0,s,u)=>{for(;(t=o.space())&&(u=v[t]?.(a,e)||!a&&c(t));)a=u;return r&&t!==r&&l("Unclosed paren"),a},i=(o.space=r=>{for(;(r=u())<=32;)e++;return r},o.token=[]),c=(e,r=0,t)=>{for(;r<i.length;)if(t=i[r++](e))return t},v=[],d=(o.operator=(r,t=0,a=0,n,i=r.charCodeAt(0),c=r.length,d=v[i],h=r.toUpperCase()!==r,y)=>(y=c<2?h?e=>u(1)<=32:e=>1:h?e=>f(c)==r&&u(c)<=32:e=>f(c)==r,n=a?a>0?e=>e&&[s(c),e]:a<0?e=>!e&&[s(c),(p(t-1)||l()).valueOf()]:a:a=>{a=[r,a||l()];do{e+=c,a.push((p(t)||l()).valueOf())}while(o.space()==i&&y());return a},v[i]=(e,r)=>r<t&&y()&&n(e)||d&&d(e,r)),15),h=e=>({valueOf:()=>e});o.token.push((e=>(e=s((e=>e>47&&e<58||46==e)))&&((69==u()||101==u())&&(e+=s(2)+s((e=>e>=48&&e<=57))),isNaN(e=new Number(e))?l("Bad number"):e)),((e,r,t,a)=>{if(34===e||39===e){for(r=f(),s(),a="";(t=u())-e;)92===t?(s(),a+=y[f()]||f()):a+=f(),s();return s(),r+a+r}}),((e,r)=>123===e&&(s(),r=g(["{",p(0,125)]),s(),r)),(e=>116===e&&"true"===f(4)&&s(4)?h(!0):102===e&&"false"===f(5)&&s(5)?h(!1):110===e&&"null"===f(4)&&s(4)?h(null):117===e&&"undefined"===f(9)&&s(9)?h(void 0):null),(e=>s((e=>e>=48&&e<=57||e>=65&&e<=90||e>=97&&e<=122||36==e||95==e||e>=192&&215!=e&&247!=e))));var y={n:"\n",r:"\r",t:"\t",b:"\b",f:"\f",v:"\v"},g=(e,r)=>(r=e[1]?":"==e[1][0]?[e[1]]:","==e[1][0]?e[1].slice(1):r:[],["{",...r]);o.space=e=>{for(;(e=u())<=32;)s(),47===u()&&(42===u(1)?(s(2),s((e=>42!==e&&47!==u(1))),s(2)):47===u(1)&&(s(2),s((e=>e>=32))));return e};var O=(e,r=2,t)=>{for(let a=0;a<t.length;a+=r)e(t[a],t[a+1],t[a+2])};O(o.operator,3,[",",1,,"|",6,,"||",4,,"&",8,,"&&",5,,"^",7,,"==",9,,"!=",9,,">",10,,">=",10,,">>",11,,">>>",11,,"<",10,,"<=",10,,"<<",11,,"+",12,,"+",d,-1,"++",d,-1,"++",d,1,"-",12,,"-",d,-1,"--",d,-1,"--",d,1,"!",d,-1,"*",13,,"/",13,,"%",13,,".",18,(e,r)=>e&&[s(),e,"string"==typeof(r=p(18))?'"'+r+'"':r.valueOf()],"[",18,e=>(s(),e=[".",e,p(0,93).valueOf()],s(),e),"]",,,"(",18,(e,r)=>(s(),r=p(0,41),s(),Array.isArray(r)&&","===r[0]?(r[0]=e,r):r?[e,r.valueOf()]:[e]),"(",19,(e,r)=>!e&&(s(),r=p(0,41)||l(),s(),r),")",,,";",1,,"===",9,,"!==",9,,"**",14,,"~",13,-1,"?",3,e=>{let r,t;return e||l("Expected expression"),s(),o.space(),r=p(),58!==u()&&l("Expected :"),s(),o.space(),t=p(),["?:",e,r,t]},"}",,,":",0,,"in",10,e=>u(2)<=32&&[s(2),'"'+e+'"',p(10)],"[",20,(e,r)=>!e&&(s(),r=p(0,93),s(),r?","===r[0]?(r[0]="[",r):["[",r]:["["])]),O(a.operator,2,["!",e=>!e,"++",e=>++e,"--",e=>--e,".",(e,r)=>e&&e[r],"%",(e,r)=>e%r,"/",(e,r)=>e/r,"*",(e,r)=>e*r,"+",(e,r)=>e+r,"-",(...e)=>e.length<2?-e:e.reduce(((e,r)=>e-r)),">>>",(e,r)=>e>>>r,">>",(e,r)=>e>>r,"<<",(e,r)=>e<<r,">=",(e,r)=>e>=r,">",(e,r)=>e>r,"<=",(e,r)=>e<=r,"<",(e,r)=>e<r,"!=",(e,r)=>e!=r,"==",(e,r)=>e==r,"&",(e,r)=>e&r,"^",(e,r)=>e^r,"|",(e,r)=>e|r,"&&",(...e)=>e.every(Boolean),"||",(...e)=>e.some(Boolean),",",(e,r)=>r,"**",(...e)=>e.reduceRight(((e,r)=>Math.pow(r,e))),"~",e=>~e,"?:",(e,r,t)=>e?r:t,"in",(e,r)=>e in r,"[",(...e)=>Array(...e),"{",(...e)=>Object.fromEntries(e),":",(e,r)=>[e,r]]);var b=e=>(e="string"==typeof e?o(e):e,r=>a(e,r));export{b as default,a as evaluate,o as parse};

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "subscript",
-  "version": "3.0.3",
+  "version": "5.2.0",
   "description": "Microlanguage with common syntax for JS/C++/Python/Rust",
   "main": "subscript.js",
   "type": "module",

package/parse.js

@@ -1,134 +1,64 @@
-const PERIOD = 46, OPAREN = 40, CPAREN = 41, OBRACK = 91, CBRACK = 93, PLUS = 43, MINUS = 45
+const SPACE=32
 
-export let index, current, lastOp, end
+// current string & index
+let idx, cur
 
-export const parse = (str, tree) => (current=str, index=lastOp=0, tree=expr(), index < current.length ? err() : tree),
+export const parse = (str, tree) => (cur=str, idx=0, tree=expr(), idx<cur.length ? err() : tree.valueOf()),
 
-// ------------ util
-code = () => current.charCodeAt(index), // current char code
-char = (n=1) => current.substr(index, n), // skip n chars
-err = (msg='Bad syntax '+char()) => { throw Error(msg + ' at ' + index) },
-skip = (is=1, from=index) => { // consume N or until condition matches
-  if (typeof is === 'number') index += is
-  else while (is(code())) ++index > current.length && err('End by ' + is) // 1 + true === 2;
-  return index > from ? current.slice(from, index) : null
-},
-space = () => { while (code() <= 32) index++ },
-
-// ------------- expr
-// consume operator
-operator = (ops, op, prec, l=3) => {
-  // memoize by index - saves 20% to perf
-  if (index && lastOp && lastOp[3] === index) return lastOp
+err = (msg='Bad syntax') => { throw Error(msg + ' `' + cur[idx] + '` at ' + idx) },
 
-  // ascending lookup is faster for 1-char operators, longer for 2+ char ops, so we use descending
-  while (l) if ((prec=ops[op=char(l--)])!=null) return lastOp = [op, prec, op.length, index] //opinfo
+skip = (is=1, from=idx) => {
+  if (typeof is === 'number') idx += is
+  else while (is(code())) idx++;
+  return cur.slice(from, idx)
 },
 
-expr = (prec=-1, curEnd) => {
-  space()
-
-  let cc = code(), op, node, i=0, mapped, from=index, prevEnd
-
-  if (curEnd) if (cc === curEnd) return; else prevEnd = end, end = curEnd // global end marker saves operator lookups
-
-  // parse node by token parsers (direct loop is faster than token.find)
-  while (from===index && i < token.length) node = token[i++](cc)
-
-  // unary prefix
-  if (from===index) (op = operator(unary)) && (index += op[2], node = [op[0], expr(op[1])])
+code = (i=0) => cur.charCodeAt(idx+i),
 
-  // postfix handlers
-  else {
-    for (space(), cc=code(), i=0; i < postfix.length;)
-      if ((mapped = postfix[i](node, cc)) !== node) node = mapped, space(), cc=code(); else i++
-  }
-  // ALT: seems to be slower
-  // else do {space(), cc=code()} while (postfix.find((parse, mapped) => (mapped = parse(node, cc)) !== node && (node = mapped)))
+char = (n=1) => cur.substr(idx, n),
 
-  // consume binary expression for current precedence or higher
-  while (cc = code() && (cc !== end) && (op = operator(binary)) && op[1] > prec) {
-    node = [op[0], node]
-    // consume same-op group, do..while both saves op lookups and space
-    do { index += op[2], node.push(expr(op[1])) } while (char(op[2]) === op[0])
-    space()
-  }
+// a + b - c
+expr = (prec=0, end, cc, node, i=0, map, newNode) => {
+  // chunk/token parser
+  while (
+    (cc=parse.space()) && (newNode = lookup[cc]?.(node, prec) || (!node && token(cc)) )
+  ) node = newNode;
 
-  if (curEnd) end = code() !== curEnd ? err('Unclosed paren') : prevEnd
-  // if (node == null) err('Missing argument')
+  if (end && cc !== end) err('Unclosed paren')
 
-  return node;
+  return node
 },
 
-// ------------------- tokens
-// 1.2e+3, .5 - fast & small version, but consumes corrupted nums as well
-float = (number) => {
-  if (number = skip(c => (c >= 48 && c <= 57) || c === PERIOD)) {
-    if (code() === 69 || code() === 101) number += skip(2) + skip(c => c >= 48 && c <= 57)
-    return isNaN(number = parseFloat(number)) ? err('Bad number') : number
-  }
-},
-
-// "a"
-string = (q, qc) => q === 34 ? (qc = char(), index++, qc) + skip(c => c-q) + (index++, qc) : null,
-
-// (...exp)
-group = (c, node) => c === OPAREN ? (index++, node = expr(-1,CPAREN), index++, node) : null,
-
-// var or literal
-id = name => (name = skip(c =>
-  (
-    (c >= 48 && c <= 57) || // 0..9
-    (c >= 65 && c <= 90) || // A...Z
-    (c >= 97 && c <= 122) || // a...z
-    c == 36 || c == 95 || // $, _,
-    c >= 192 // any non-ASCII
-  )
-)),
-
-// ----------- config
-token = parse.token = [ float, group, string, id ],
-
-literal = parse.literal = {true:true, false:false, null:null},
-
-postfix = parse.postfix = [
-  // postfix parsers merged into 1 for performance & compactness
-  (node, cc, arg) => {
-    // a.b[c](d)
-    if (cc === PERIOD) index++, space(), node = ['.', node, '"'+id()+'"']
-    else if (cc === OBRACK) index++, node = ['.', node, expr(-1,CBRACK)], index++
-    else if (cc === OPAREN)
-      index++, arg=expr(-1,CPAREN),
-      node = Array.isArray(arg) && arg[0]===',' ? (arg[0]=node, arg) : arg == null ? [node] : [node, arg],
-      index++
-
-    // a++, a--
-    else if ((cc===0x2b || cc===0x2d) && current.charCodeAt(index+1)===cc) node = [skip(2), node]
-
-    // literal
-    else if (typeof node === 'string' && literal.hasOwnProperty(node)) node = literal[node]
-
-    return node
-  }
-],
-
-unary = parse.unary = {
-  '-': 17,
-  '!': 17,
-  '+': 17,
-  '++': 17,
-  '--': 17
-},
-
-binary = parse.binary = {
-  ',': 1,
-  '||': 6, '&&': 7, '|': 8, '^': 9, '&': 10,
-  '==': 11, '!=': 11,
-  '<': 12, '>': 12, '<=': 12, '>=': 12,
-  '<<': 13, '>>': 13, '>>>': 13,
-  '+': 14, '-': 14,
-  '*': 15, '/': 15, '%': 15
-}
-
+// can be extended with comments, so we export
+space = parse.space = cc => { while (cc = code(), cc <= SPACE) idx++; return cc },
+
+// tokens
+tokens = parse.token = [],
+token = (c,i=0,node) => { while(i<tokens.length) if (node = tokens[i++](c)) return node },
+
+// operator lookup table
+lookup = [],
+
+// create operator checker/mapper (see examples)
+// @param op is operator string
+// @param prec is operator precedenc to check
+// @param map is either number +1 - postfix unary, -1 prefix unary, 0 binary, else - custom mapper function
+operator = parse.operator =  (op, prec=0, type=0, map, c=op.charCodeAt(0), l=op.length, prev=lookup[c], word=op.toUpperCase()!==op, isop) => (
+  isop = l<2 ? // word operator must have space after
+    !word ? c=>1 : c=>code(1)<=SPACE :
+    !word ? c=>char(l)==op : c=>char(l)==op&&code(l)<=SPACE,
+
+  map = !type ? node => { // binary, consume same-op group
+      node = [op, node || err()]
+      // in order to support literal tokens, we call valueOf any time we create or modify calltree node
+      do { idx+=l, node.push((expr(prec) || err()).valueOf()) } while (parse.space()==c && isop())
+      return node
+    } :
+    type > 0 ? node => node && [skip(l), node] : // postfix unary
+    type < 0 ? node => !node && [skip(l), (expr(prec-1) || err()).valueOf()] : // prefix unary
+    type,
+
+  lookup[c] = (node, curPrec) => curPrec < prec && isop() && map(node) || (prev && prev(node, curPrec))
+)
 
 export default parse

package/subscript.js

@@ -1,5 +1,128 @@
-import parse from './parse.js'
-import evaluate from './evaluate.js'
+import parse, {skip, expr, code, tokens, operator as parseOp} from './parse.js'
+import evaluate, {operator as evalOp} from './evaluate.js'
+
+const PERIOD=46, OPAREN=40, CPAREN=41, CBRACK=93, SPACE=32,
+
+PREC_SEQ=1, PREC_SOME=4, PREC_EVERY=5, PREC_OR=6, PREC_XOR=7, PREC_AND=8,
+PREC_EQ=9, PREC_COMP=10, PREC_SHIFT=11, PREC_SUM=12, PREC_MULT=13, PREC_UNARY=15, PREC_POSTFIX=16, PREC_CALL=18, PREC_GROUP=19
+
+tokens.push(
+  // 1.2e+3, .5 - fast & small version, but consumes corrupted nums as well
+  (number) => (
+    (number = skip(c => (c > 47 && c < 58) || c == PERIOD)) && (
+      (code() == 69 || code() == 101) && (number += skip(2) + skip(c => c >= 48 && c <= 57)),
+      isNaN(number = new Number(number)) ? err('Bad number') : number
+    )
+  ),
+  // "a"
+  (q, qc) => q == 34 && (skip() + skip(c => c-q) + skip()),
+  // id
+  c => skip(c =>
+    (c >= 48 && c <= 57) || // 0..9
+    (c >= 65 && c <= 90) || // A...Z
+    (c >= 97 && c <= 122) || // a...z
+    c == 36 || c == 95 || // $, _,
+    c >= 192 // any non-ASCII
+  )
+)
+
+const addOps = (add, stride=2, list) => {
+  for (let i = 0; i < list.length; i+=stride) add(list[i], list[i+1], list[i+2])
+}
+
+addOps(parseOp, 3, [
+  ',', PREC_SEQ,,
+
+  '|', PREC_OR,,
+  '||', PREC_SOME,,
+
+  '&', PREC_AND,,
+  '&&', PREC_EVERY,,
+
+  '^', PREC_XOR,,
+
+  // ==, !=
+  '==', PREC_EQ,,
+  '!=', PREC_EQ,,
+
+  // > >= >> >>>, < <= <<
+  '>', PREC_COMP,,
+  '>=', PREC_COMP,,
+  '>>', PREC_SHIFT,,
+  '>>>', PREC_SHIFT,,
+  '<', PREC_COMP,,
+  '<=', PREC_COMP,,
+  '<<', PREC_SHIFT,,
+
+  // + ++ - --
+  '+', PREC_SUM,,
+  '+', PREC_UNARY, -1,
+  '++', PREC_UNARY, -1,
+  '++', PREC_UNARY, +1,
+  '-', PREC_SUM,,
+  '-', PREC_UNARY, -1,
+  '--', PREC_UNARY, -1,
+  '--', PREC_UNARY, +1,
+
+  // ! ~
+  '!', PREC_UNARY, -1,
+
+  // * / %
+  '*', PREC_MULT,,
+  '/', PREC_MULT,,
+  '%', PREC_MULT,,
+
+  // a.b
+  '.', PREC_CALL, (node,b) => node && [skip(),node, typeof (b = expr(PREC_CALL)) === 'string' ? '"' + b + '"' : b.valueOf()],
+
+  // a[b]
+  '[', PREC_CALL, (node) => (skip(), node = ['.', node, expr(0,CBRACK).valueOf()], skip(), node),
+  ']',,,
+
+  // a(b)
+  '(', PREC_CALL, (node,b) => ( skip(), b=expr(0,CPAREN), skip(),
+    Array.isArray(b) && b[0]===',' ? (b[0]=node, b) : b ? [node, b.valueOf()] : [node]
+  ),
+  // (a+b)
+  '(', PREC_GROUP, (node,b) => !node && (skip(), b=expr(0,CPAREN) || err(), skip(), b),
+  ')',,,
+])
+
+
+// evaluators
+addOps(evalOp, 2, [
+  '!', a=>!a,
+  '++', a=>++a,
+  '--', a=>--a,
+
+  '.', (a,b)=>a?a[b]:a,
+
+  '%', (a,b)=>a%b,
+  '/', (a,b)=>a/b,
+  '*', (a,b)=>a*b,
+
+  '+', (a,b)=>a+b,
+  '-', (...a)=>a.length < 2 ? -a : a.reduce((a,b)=>a-b),
+
+  '>>>', (a,b)=>a>>>b,
+  '>>', (a,b)=>a>>b,
+  '<<', (a,b)=>a<<b,
+
+  '>=', (a,b)=>a>=b,
+  '>', (a,b)=>a>b,
+  '<=', (a,b)=>a<=b,
+  '<', (a,b)=>a<b,
+
+  '!=', (a,b)=>a!=b,
+  '==', (a,b)=>a==b,
+
+  '&', (a,b)=>a&b,
+  '^', (a,b)=>a^b,
+  '|', (a,b)=>a|b,
+  '&&', (...a)=>a.every(Boolean),
+  '||', (...a)=>a.some(Boolean),
+  ',', (a,b)=>(a,b)
+])
 
 export { parse, evaluate }
 

package/subscript.min.js

@@ -1 +1 @@
-var e,r,t,n,l=(n,l)=>(r=n,e=t=0,l=y(),e<r.length?u():l),a=()=>r.charCodeAt(e),o=(t=1)=>r.substr(e,t),u=(r="Bad syntax "+o())=>{throw Error(r+" at "+e)},s=(t=1,n=e)=>{if("number"==typeof t)e+=t;else for(;t(a());)++e>r.length&&u("End by "+t);return e>n?r.slice(n,e):null},f=()=>{for(;a()<=32;)e++},i=(r,n,l,a=3)=>{if(e&&t&&t[3]===e)return t;for(;a;)if(null!=(l=r[n=o(a--)]))return t=[n,l,n.length,e]},y=(r=-1,t)=>{f();let l,s,p,d,b=a(),m=0,B=e;if(t){if(b===t)return;d=n,n=t}for(;B===e&&m<c.length;)s=c[m++](b);if(B===e)(l=i(g))&&(e+=l[2],s=[l[0],y(l[1])]);else for(f(),b=a(),m=0;m<h.length;)(p=h[m](s,b))!==s?(s=p,f(),b=a()):m++;for(;b=a()&&b!==n&&(l=i(A))&&l[1]>r;){s=[l[0],s];do{e+=l[2],s.push(y(l[1]))}while(o(l[2])===l[0]);f()}return t&&(n=a()!==t?u("Unclosed paren"):d),s},p=e=>s((e=>e>=48&&e<=57||e>=65&&e<=90||e>=97&&e<=122||36==e||95==e||e>=192)),c=l.token=[e=>{if(e=s((e=>e>=48&&e<=57||46===e)))return(69===a()||101===a())&&(e+=s(2)+s((e=>e>=48&&e<=57))),isNaN(e=parseFloat(e))?u("Bad number"):e},(r,t)=>40===r?(e++,t=y(-1,41),e++,t):null,(r,t)=>34===r?(t=o(),e++,t+s((e=>e-r))+(e++,t)):null,p],d=l.literal={true:!0,false:!1,null:null},h=l.postfix=[(t,n,l)=>(46===n?(e++,f(),t=[".",t,'"'+p()+'"']):91===n?(e++,t=[".",t,y(-1,93)],e++):40===n?(e++,l=y(-1,41),t=Array.isArray(l)&&","===l[0]?(l[0]=t,l):null==l?[t]:[t,l],e++):43!==n&&45!==n||r.charCodeAt(e+1)!==n?"string"==typeof t&&d.hasOwnProperty(t)&&(t=d[t]):t=[s(2),t],t)],g=l.unary={"-":17,"!":17,"+":17,"++":17,"--":17},A=l.binary={",":1,"||":6,"&&":7,"|":8,"^":9,"&":10,"==":11,"!=":11,"<":12,">":12,"<=":12,">=":12,"<<":13,">>":13,">>>":13,"+":14,"-":14,"*":15,"/":15,"%":15},b=l,m=e=>Array.isArray(e)&&("string"==typeof e[0]||m(e[0])),B=(e,r={},t,n)=>m(e)?("string"==typeof(t=e[0])&&(n=v[t]),"function"!=typeof(t=n||B(t,r))?t:t.call(...e.map((e=>B(e,r))))):e&&"string"==typeof e?'"'===e[0]?e.slice(1,-1):"@"===e[0]?e.slice(1):e in r?r[e]:e:e,v=B.operator={"!":e=>!e,"++":e=>++e,"--":e=>--e,".":(...e)=>e.reduce(((e,r)=>e&&e[r])),"%":(...e)=>e.reduce(((e,r)=>e%r)),"/":(...e)=>e.reduce(((e,r)=>e/r)),"*":(...e)=>e.reduce(((e,r)=>e*r)),"+":(...e)=>e.reduce(((e,r)=>e+r)),"-":(...e)=>e.length<2?-e:e.reduce(((e,r)=>e-r)),">>>":(e,r)=>e>>>r,">>":(e,r)=>e>>r,"<<":(e,r)=>e<<r,">=":(e,r)=>e>=r,">":(e,r)=>e>r,"<=":(e,r)=>e<=r,"<":(e,r)=>e<r,"!=":(e,r)=>e!=r,"==":(e,r)=>e==r,"&":(e,r)=>e&r,"^":(e,r)=>e^r,"|":(e,r)=>e|r,"&&":(...e)=>e.every(Boolean),"||":(...e)=>e.some(Boolean),",":(...e)=>e.reduce(((e,r)=>r))},w=B,x=e=>(e="string"==typeof e?b(e):e,r=>w(e,r));export{x as default,w as evaluate,b as parse};
+var e,r,a=(a,o)=>(r=a,e=0,o=l(),e<r.length?t():o.valueOf()),t=(a="Bad syntax")=>{throw Error(a+" `"+r[e]+"` at "+e)},o=(a=1,t=e)=>{if("number"==typeof a)e+=a;else for(;a(n());)e++;return r.slice(t,e)},n=(a=0)=>r.charCodeAt(e+a),s=(a=1)=>r.substr(e,a),l=(e=0,r,o,n,s=0,l,f)=>{for(;(o=a.space())&&(f=p[o]?.(n,e)||!n&&u(o));)n=f;return r&&o!==r&&t("Unclosed paren"),n},f=(a.space=r=>{for(;(r=n())<=32;)e++;return r},a.token=[]),u=(e,r=0,a)=>{for(;r<f.length;)if(a=f[r++](e))return a},p=[],i=a.operator=(r,f=0,u=0,i,c=r.charCodeAt(0),y=r.length,h=p[c],g=r.toUpperCase()!==r,v)=>(v=y<2?g?e=>n(1)<=32:e=>1:g?e=>s(y)==r&&n(y)<=32:e=>s(y)==r,i=u?u>0?e=>e&&[o(y),e]:u<0?e=>!e&&[o(y),(l(f-1)||t()).valueOf()]:u:o=>{o=[r,o||t()];do{e+=y,o.push((l(f)||t()).valueOf())}while(a.space()==c&&v());return o},p[c]=(e,r)=>r<f&&v()&&i(e)||h&&h(e,r)),c=a,y=e=>Array.isArray(e)&&("string"==typeof e[0]||y(e[0])),h=(e,r={},a,t)=>y(e)?("string"==typeof(a=e[0])&&(t=g[a]),"function"!=typeof(a=t||h(a,r))?a:a.call(...e.map((e=>h(e,r))))):e&&"string"==typeof e?'"'===e[0]?e.slice(1,-1):"@"===e[0]?e.slice(1):e in r?r[e]:e:e,g={},v=h.operator=(e,r)=>g[e]=2==r.length?(...e)=>e.reduce(r):r,d=h,A=15;f.push((e=>(e=o((e=>e>47&&e<58||46==e)))&&((69==n()||101==n())&&(e+=o(2)+o((e=>e>=48&&e<=57))),isNaN(e=new Number(e))?err("Bad number"):e)),((e,r)=>34==e&&o()+o((r=>r-e))+o()),(e=>o((e=>e>=48&&e<=57||e>=65&&e<=90||e>=97&&e<=122||36==e||95==e||e>=192))));var O=(e,r=2,a)=>{for(let t=0;t<a.length;t+=r)e(a[t],a[t+1],a[t+2])};O(i,3,[",",1,,"|",6,,"||",4,,"&",8,,"&&",5,,"^",7,,"==",9,,"!=",9,,">",10,,">=",10,,">>",11,,">>>",11,,"<",10,,"<=",10,,"<<",11,,"+",12,,"+",A,-1,"++",A,-1,"++",A,1,"-",12,,"-",A,-1,"--",A,-1,"--",A,1,"!",A,-1,"*",13,,"/",13,,"%",13,,".",18,(e,r)=>e&&[o(),e,"string"==typeof(r=l(18))?'"'+r+'"':r.valueOf()],"[",18,e=>(o(),e=[".",e,l(0,93).valueOf()],o(),e),"]",,,"(",18,(e,r)=>(o(),r=l(0,41),o(),Array.isArray(r)&&","===r[0]?(r[0]=e,r):r?[e,r.valueOf()]:[e]),"(",19,(e,r)=>!e&&(o(),r=l(0,41)||err(),o(),r),")",,,]),O(v,2,["!",e=>!e,"++",e=>++e,"--",e=>--e,".",(e,r)=>e&&e[r],"%",(e,r)=>e%r,"/",(e,r)=>e/r,"*",(e,r)=>e*r,"+",(e,r)=>e+r,"-",(...e)=>e.length<2?-e:e.reduce(((e,r)=>e-r)),">>>",(e,r)=>e>>>r,">>",(e,r)=>e>>r,"<<",(e,r)=>e<<r,">=",(e,r)=>e>=r,">",(e,r)=>e>r,"<=",(e,r)=>e<=r,"<",(e,r)=>e<r,"!=",(e,r)=>e!=r,"==",(e,r)=>e==r,"&",(e,r)=>e&r,"^",(e,r)=>e^r,"|",(e,r)=>e|r,"&&",(...e)=>e.every(Boolean),"||",(...e)=>e.some(Boolean),",",(e,r)=>r]);var m=e=>(e="string"==typeof e?c(e):e,r=>d(e,r));export{m as default,d as evaluate,c as parse};