@revisium/formula 0.1.0 → 0.2.0

package/dist/{chunk-DJBJIFBU.cjs → chunk-5NMNSRHH.cjs}

@@ -1,46 +1,289 @@
 'use strict';
 
-var subscript = require('subscript');
-var parseModule = require('subscript/src/parse.js');
+var chunkQ7SFCCGT_cjs = require('./chunk-Q7SFCCGT.cjs');
 
-function _interopDefault (e) { return e && e.__esModule ? e : { default: e }; }
+// node_modules/subscript/src/parse.js
+var parse_exports = {};
+chunkQ7SFCCGT_cjs.__export(parse_exports, {
+  access: () => access,
+  binary: () => binary,
+  cur: () => cur,
+  default: () => parse_default,
+  err: () => err2,
+  expr: () => expr,
+  group: () => group,
+  id: () => id,
+  idx: () => idx,
+  lookup: () => lookup,
+  nary: () => nary,
+  next: () => next,
+  parse: () => parse,
+  skip: () => skip,
+  space: () => space,
+  token: () => token,
+  unary: () => unary
+});
 
-function _interopNamespace(e) {
-  if (e && e.__esModule) return e;
-  var n = Object.create(null);
-  if (e) {
-    Object.keys(e).forEach(function (k) {
-      if (k !== 'default') {
-        var d = Object.getOwnPropertyDescriptor(e, k);
-        Object.defineProperty(n, k, d.get ? d : {
-          enumerable: true,
-          get: function () { return e[k]; }
-        });
-      }
-    });
-  }
-  n.default = e;
-  return Object.freeze(n);
-}
+// node_modules/subscript/src/const.js
+var PERIOD = 46;
+var SPACE = 32;
+var DQUOTE = 34;
+var QUOTE = 39;
+var _0 = 48;
+var _9 = 57;
+var _E = 69;
+var _e = 101;
+var BSLASH = 92;
+var PREC_STATEMENT = 5;
+var PREC_SEQ = 10;
+var PREC_ASSIGN = 20;
+var PREC_LOR = 30;
+var PREC_LAND = 40;
+var PREC_OR = 50;
+var PREC_XOR = 60;
+var PREC_AND = 70;
+var PREC_EQ = 80;
+var PREC_COMP = 90;
+var PREC_SHIFT = 100;
+var PREC_ADD = 110;
+var PREC_MULT = 120;
+var PREC_PREFIX = 140;
+var PREC_POSTFIX = 150;
+var PREC_ACCESS = 170;
+var unsafe = (k) => k?.[0] === "_" && k[1] === "_" || k === "constructor" || k === "prototype";
+
+// node_modules/subscript/src/parse.js
+var idx;
+var cur;
+var parse = (s) => (idx = 0, cur = s, s = expr(), cur[idx] ? err2() : s || "");
+var err2 = (msg = "Unexpected token", lines = cur.slice(0, idx).split("\n"), last2 = lines.pop(), before = cur.slice(Math.max(0, idx - 40), idx), after = cur.slice(idx, idx + 20)) => {
+  throw SyntaxError(`${msg} at ${lines.length + 1}:${last2.length + 1} \u2014 ${before}^${after}`);
+};
+var next = (is, from = idx, l) => {
+  while (l = is(cur.charCodeAt(idx))) idx += l;
+  return cur.slice(from, idx);
+};
+var skip = () => cur[idx++];
+var expr = (prec = 0, end) => {
+  let cc, token2, newNode, fn;
+  while ((cc = space()) && // till not end
+  // NOTE: when lookup bails on lower precedence, parent expr re-calls space() — acceptable overhead
+  (newNode = ((fn = lookup[cc]) && fn(token2, prec)) ?? // if operator with higher precedence isn't found
+  (!token2 && next(parse.id)))) token2 = newNode;
+  if (end) cc == end ? idx++ : err2("Unclosed " + String.fromCharCode(end - (end > 42 ? 2 : 1)));
+  return token2;
+};
+var space = (cc) => {
+  while ((cc = cur.charCodeAt(idx)) <= SPACE) idx++;
+  return cc;
+};
+var id = parse.id = (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 && c != 215 && c != 247;
+var lookup = [];
+var token = (op, prec = SPACE, map, c = op.charCodeAt(0), l = op.length, prev = lookup[c], word = op.toUpperCase() !== op) => lookup[c] = (a, curPrec, curOp, from = idx) => (curOp ? op == curOp : (l < 2 || cur.substr(idx, l) == op) && (curOp = op)) && curPrec < prec && // matches precedence AFTER operator matched
+!(word && parse.id(cur.charCodeAt(idx + l))) && // finished word, not part of bigger word
+(idx += l, map(a) || (idx = from, !prev && err2())) || prev?.(a, curPrec, curOp);
+var binary = (op, prec, right = false) => token(op, prec, (a, b) => a && (b = expr(prec - (right ? 0.5 : 0))) && [op, a, b]);
+var unary = (op, prec, post) => token(op, prec, (a) => post ? a && [op, a] : !a && (a = expr(prec - 0.5)) && [op, a]);
+var nary = (op, prec, right) => {
+  token(
+    op,
+    prec,
+    (a, b) => (b = expr(prec - (right ? 0.5 : 0)), a?.[0] !== op && (a = [op, a || null]), // if beginning of sequence - init node
+    b?.[0] === op ? a.push(...b.slice(1)) : a.push(b || null), // comments can return same-token expr
+    a)
+  );
+};
+var group = (op, prec) => token(op[0], prec, (a) => !a && [op, expr(0, op.charCodeAt(1))]);
+var access = (op, prec) => token(op[0], prec, (a) => a && [op, a, expr(0, op.charCodeAt(1)) || null]);
+var parse_default = parse;
+
+// node_modules/subscript/feature/number.js
+var _b = 98;
+var _B = 66;
+var _o = 111;
+var _O = 79;
+var _x = 120;
+var _X = 88;
+var _a = 97;
+var _f = 102;
+var _A = 65;
+var _F = 70;
+var num = (a, _) => [, (a = +next((c) => c === PERIOD || c >= _0 && c <= _9 || (c === _E || c === _e ? 2 : 0))) != a ? err2() : a];
+lookup[PERIOD] = (a) => !a && num();
+for (let i = _0 + 1; i <= _9; i++) lookup[i] = (a) => a ? err2() : num();
+lookup[_0] = (a) => {
+  if (a) return err2();
+  const nextChar = cur.charCodeAt(idx + 1);
+  if (nextChar === _b || nextChar === _B) {
+    skip();
+    skip();
+    const s = next((c) => c === 48 || c === 49);
+    return [, parseInt(s, 2)];
+  }
+  if (nextChar === _o || nextChar === _O) {
+    skip();
+    skip();
+    const s = next((c) => c >= 48 && c <= 55);
+    return [, parseInt(s, 8)];
+  }
+  if (nextChar === _x || nextChar === _X) {
+    skip();
+    skip();
+    const s = next((c) => c >= _0 && c <= _9 || c >= _a && c <= _f || c >= _A && c <= _F);
+    return [, parseInt(s, 16)];
+  }
+  return num();
+};
+
+// node_modules/subscript/feature/string.js
+var escape = { n: "\n", r: "\r", t: "	", b: "\b", f: "\f", v: "\v" };
+var string = (q) => (qc, prec, str = "") => {
+  qc && err2("Unexpected string");
+  skip();
+  next((c) => c - q && (c === BSLASH ? (str += escape[cur[idx + 1]] || cur[idx + 1], 2) : (str += cur[idx], 1)));
+  skip() || err2("Bad string");
+  return [, str];
+};
+lookup[DQUOTE] = string(DQUOTE);
+lookup[QUOTE] = string(QUOTE);
+
+// node_modules/subscript/src/compile.js
+var compile = (node) => !Array.isArray(node) ? compile.id(node) : !node[0] ? () => node[1] : operators[node[0]].call(...node);
+compile.id = (name) => (ctx) => ctx?.[name];
+var operators = {};
+var operator = (op, fn, prev = operators[op]) => operators[op] = (...args) => fn(...args) || prev?.(...args);
+var prop2 = (a, fn, generic, obj, path) => (
+  // (((x))) => x
+  a[0] === "()" && a.length == 2 ? prop2(a[1], fn, generic) : (
+    // (_, name, ctx) => ctx[path]
+    typeof a === "string" ? (ctx) => fn(ctx, a, ctx) : (
+      // (container, path, ctx) => container(ctx)[path]
+      a[0] === "." ? (obj = compile(a[1]), path = a[2], (ctx) => fn(obj(ctx), path, ctx)) : (
+        // (container, path, ctx) => container(ctx)[path(ctx)]
+        a[0] === "[]" && a.length === 3 ? (obj = compile(a[1]), path = compile(a[2]), (ctx) => fn(obj(ctx), path(ctx), ctx)) : (
+          // (src, _, ctx) => src(ctx)
+          generic ? (a = compile(a), (ctx) => fn([a(ctx)], 0, ctx)) : () => err2("Bad left value")
+        )
+      )
+    )
+  )
+);
+var compile_default = compile;
+
+// node_modules/subscript/feature/call.js
+access("()", PREC_ACCESS);
+operator(
+  "()",
+  (a, b, args) => b !== void 0 && (args = !b ? () => [] : (
+    // a()
+    b[0] === "," ? (b = b.slice(1).map((b2) => !b2 ? err() : compile(b2)), (ctx) => b.map((arg) => arg(ctx))) : (
+      // a(b,c)
+      (b = compile(b), (ctx) => [b(ctx)])
+    )
+  ), // a(b)
+  // a(...args), a.b(...args), a[b](...args)
+  prop2(a, (obj, path, ctx) => obj[path](...args(ctx)), true))
+);
+
+// node_modules/subscript/feature/access.js
+access("[]", PREC_ACCESS);
+operator("[]", (a, b) => !b ? err2() : (a = compile(a), b = compile(b), (ctx) => {
+  const k = b(ctx);
+  return unsafe(k) ? void 0 : a(ctx)[k];
+}));
+binary(".", PREC_ACCESS);
+operator(".", (a, b) => (a = compile(a), b = !b[0] ? b[1] : b, unsafe(b) ? () => void 0 : (ctx) => a(ctx)[b]));
+
+// node_modules/subscript/feature/group.js
+group("()", PREC_ACCESS);
+operator("()", (a, b) => b === void 0 && (!a && err2("Empty ()"), compile(a)));
+var last = (...args) => (args = args.map(compile), (ctx) => args.map((arg) => arg(ctx)).pop());
+nary(",", PREC_SEQ), operator(",", last);
+nary(";", PREC_STATEMENT, true), operator(";", last);
+
+// node_modules/subscript/feature/assign.js
+binary("=", PREC_ASSIGN, true);
+operator("=", (a, b) => (b = compile(b), // a = x, ((a)) = x, a.b = x, a['b'] = x
+prop2(a, (container, path, ctx) => container[path] = b(ctx))));
+
+// node_modules/subscript/feature/mult.js
+binary("*", PREC_MULT), operator("*", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) * b(ctx)));
+binary("/", PREC_MULT), operator("/", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) / b(ctx)));
+binary("%", PREC_MULT), operator("%", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) % b(ctx)));
+binary("*=", PREC_ASSIGN, true);
+operator("*=", (a, b) => (b = compile(b), prop2(a, (container, path, ctx) => container[path] *= b(ctx))));
+binary("/=", PREC_ASSIGN, true);
+operator("/=", (a, b) => (b = compile(b), prop2(a, (container, path, ctx) => container[path] /= b(ctx))));
+binary("%=", PREC_ASSIGN, true);
+operator("%=", (a, b) => (b = compile(b), prop2(a, (container, path, ctx) => container[path] %= b(ctx))));
+
+// node_modules/subscript/feature/add.js
+binary("+", PREC_ADD), operator("+", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) + b(ctx)));
+binary("-", PREC_ADD), operator("-", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) - b(ctx)));
+unary("+", PREC_PREFIX), operator("+", (a, b) => !b && (a = compile(a), (ctx) => +a(ctx)));
+unary("-", PREC_PREFIX), operator("-", (a, b) => !b && (a = compile(a), (ctx) => -a(ctx)));
+binary("+=", PREC_ASSIGN, true);
+operator("+=", (a, b) => (b = compile(b), prop2(a, (container, path, ctx) => container[path] += b(ctx))));
+binary("-=", PREC_ASSIGN, true);
+operator("-=", (a, b) => (b = compile(b), prop2(a, (container, path, ctx) => container[path] -= b(ctx))));
+
+// node_modules/subscript/feature/increment.js
+token("++", PREC_POSTFIX, (a) => a ? ["++", a, null] : ["++", expr(PREC_POSTFIX - 1)]);
+operator("++", (a, b) => prop2(a, b === null ? (obj, path) => obj[path]++ : (obj, path) => ++obj[path]));
+token("--", PREC_POSTFIX, (a) => a ? ["--", a, null] : ["--", expr(PREC_POSTFIX - 1)]);
+operator("--", (a, b) => prop2(a, b === null ? (obj, path) => obj[path]-- : (obj, path) => --obj[path]));
+
+// node_modules/subscript/feature/bitwise.js
+unary("~", PREC_PREFIX), operator("~", (a, b) => !b && (a = compile(a), (ctx) => ~a(ctx)));
+binary("|", PREC_OR), operator("|", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) | b(ctx)));
+binary("&", PREC_AND), operator("&", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) & b(ctx)));
+binary("^", PREC_XOR), operator("^", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) ^ b(ctx)));
+
+// node_modules/subscript/feature/logic.js
+unary("!", PREC_PREFIX), operator("!", (a, b) => !b && (a = compile(a), (ctx) => !a(ctx)));
+binary("||", PREC_LOR);
+operator("||", (a, b) => (a = compile(a), b = compile(b), (ctx) => a(ctx) || b(ctx)));
+binary("&&", PREC_LAND);
+operator("&&", (a, b) => (a = compile(a), b = compile(b), (ctx) => a(ctx) && b(ctx)));
+
+// node_modules/subscript/feature/compare.js
+binary("==", PREC_EQ), operator("==", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) == b(ctx)));
+binary("!=", PREC_EQ), operator("!=", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) != b(ctx)));
+binary(">", PREC_COMP), operator(">", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) > b(ctx)));
+binary("<", PREC_COMP), operator("<", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) < b(ctx)));
+binary(">=", PREC_COMP), operator(">=", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) >= b(ctx)));
+binary("<=", PREC_COMP), operator("<=", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) <= b(ctx)));
+
+// node_modules/subscript/feature/shift.js
+binary(">>", PREC_SHIFT), operator(">>", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) >> b(ctx)));
+binary("<<", PREC_SHIFT), operator("<<", (a, b) => b && (a = compile(a), b = compile(b), (ctx) => a(ctx) << b(ctx)));
+binary(">>=", PREC_ASSIGN, true);
+operator(">>=", (a, b) => (b = compile(b), prop(a, (obj, path, ctx) => obj[path] >>= b(ctx))));
+binary("<<=", PREC_ASSIGN, true);
+operator("<<=", (a, b) => (b = compile(b), prop(a, (obj, path, ctx) => obj[path] <<= b(ctx))));
 
-var subscript__default = /*#__PURE__*/_interopDefault(subscript);
-var parseModule__namespace = /*#__PURE__*/_interopNamespace(parseModule);
+// node_modules/subscript/subscript.js
+var subscript_default = (s) => compile_default(parse_default(s));
 
 // src/parser.ts
-var { next } = parseModule__namespace;
+var { next: next2 } = parse_exports;
 var isIdChar = (c) => c >= 97 && c <= 122 || // a-z
 c >= 65 && c <= 90 || // A-Z
 c >= 48 && c <= 57 || // 0-9
 c === 95 ? 1 : 0;
-subscript.token("@", 200, (a) => {
+token("@", 200, (a) => {
   if (a) return;
-  const name = next(isIdChar);
+  const name = next2(isIdChar);
   if (!name) return;
   return "@" + name;
 });
-subscript.token("#", 200, (a) => {
+token("#", 200, (a) => {
   if (a) return;
-  const name = next(isIdChar);
+  const name = next2(isIdChar);
   if (!name) return;
   return "#" + name;
 });
@@ -49,7 +292,7 @@ var createWildcardLiteral = () => {
   arr[1] = "*";
   return arr;
 };
-subscript.token("*", 200, (a) => {
+token("*", 200, (a) => {
   if (!a) return createWildcardLiteral();
   return void 0;
 });
@@ -292,7 +535,7 @@ function parseFormula(expression) {
   if (!trimmed) {
     throw new Error("Empty expression");
   }
-  const ast = subscript.parse(trimmed);
+  const ast = parse(trimmed);
   const identifiers = /* @__PURE__ */ new Set();
   collectIdentifiers(ast, identifiers);
   const featuresSet = /* @__PURE__ */ new Set();
@@ -312,7 +555,7 @@ function validateSyntax(expression) {
     return { isValid: false, error: "Empty expression" };
   }
   try {
-    subscript.parse(trimmed);
+    parse(trimmed);
     return { isValid: true };
   } catch (e) {
     const error = e;
@@ -330,7 +573,7 @@ function evaluate(expression, context) {
   if (!trimmed) {
     throw new Error("Empty expression");
   }
-  const fn = subscript__default.default(trimmed);
+  const fn = subscript_default(trimmed);
   return fn(context);
 }
 var ARITHMETIC_OPS = /* @__PURE__ */ new Set(["+", "-", "*", "/", "%"]);
@@ -445,7 +688,7 @@ function inferFormulaType(expression, fieldTypes = {}) {
     return "unknown";
   }
   try {
-    const ast = subscript.parse(trimmed);
+    const ast = parse(trimmed);
     return inferTypeFromNode(ast, fieldTypes);
   } catch {
     return "unknown";
@@ -721,5 +964,5 @@ exports.validateFormulaAgainstSchema = validateFormulaAgainstSchema;
 exports.validateFormulaSyntax = validateFormulaSyntax;
 exports.validateSchemaFormulas = validateSchemaFormulas;
 exports.validateSyntax = validateSyntax;
-//# sourceMappingURL=chunk-DJBJIFBU.cjs.map
-//# sourceMappingURL=chunk-DJBJIFBU.cjs.map
+//# sourceMappingURL=chunk-5NMNSRHH.cjs.map
+//# sourceMappingURL=chunk-5NMNSRHH.cjs.map

package/dist/chunk-5NMNSRHH.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../node_modules/subscript/src/parse.js","../node_modules/subscript/src/const.js","../node_modules/subscript/feature/number.js","../node_modules/subscript/feature/string.js","../node_modules/subscript/src/compile.js","../node_modules/subscript/feature/call.js","../node_modules/subscript/feature/access.js","../node_modules/subscript/feature/group.js","../node_modules/subscript/feature/assign.js","../node_modules/subscript/feature/mult.js","../node_modules/subscript/feature/add.js","../node_modules/subscript/feature/increment.js","../node_modules/subscript/feature/bitwise.js","../node_modules/subscript/feature/logic.js","../node_modules/subscript/feature/compare.js","../node_modules/subscript/feature/shift.js","../node_modules/subscript/subscript.js","../src/parser.ts","../src/parse-formula.ts","../src/validate-syntax.ts","../src/dependency-graph.ts","../src/extract-schema.ts","../src/validate-schema.ts"],"names":["__export","err","last","token","prop","b","next"],"mappings":";;;;;AAAA,IAAA,aAAA,GAAA,EAAA;AAAAA,0BAAA,CAAA,aAAA,EAAA;AAAA,EAAA,MAAA,EAAA,MAAA,MAAA;AAAA,EAAA,MAAA,EAAA,MAAA,MAAA;AAAA,EAAA,GAAA,EAAA,MAAA,GAAA;AAAA,EAAA,OAAA,EAAA,MAAA,aAAA;AAAA,EAAA,GAAA,EAAA,MAAAC,IAAAA;AAAA,EAAA,IAAA,EAAA,MAAA,IAAA;AAAA,EAAA,KAAA,EAAA,MAAA,KAAA;AAAA,EAAA,EAAA,EAAA,MAAA,EAAA;AAAA,EAAA,GAAA,EAAA,MAAA,GAAA;AAAA,EAAA,MAAA,EAAA,MAAA,MAAA;AAAA,EAAA,IAAA,EAAA,MAAA,IAAA;AAAA,EAAA,IAAA,EAAA,MAAA,IAAA;AAAA,EAAA,KAAA,EAAA,MAAA,KAAA;AAAA,EAAA,IAAA,EAAA,MAAA,IAAA;AAAA,EAAA,KAAA,EAAA,MAAA,KAAA;AAAA,EAAA,KAAA,EAAA,MAAA,KAAA;AAAA,EAAA,KAAA,EAAA,MAAA;AAAA,CAAA,CAAA;;;ACAO,IACL,MAAA,GAAS,EAAA;AADJ,IAQL,KAAA,GAAQ,EAAA;AARH,IAUL,MAAA,GAAS,EAAA;AAVJ,IAWL,KAAA,GAAQ,EAAA;AAXH,IAYL,EAAA,GAAK,EAAA;AAZA,IAaL,EAAA,GAAK,EAAA;AAbA,IAcL,EAAA,GAAK,EAAA;AAdA,IAeL,EAAA,GAAK,GAAA;AAfA,IAgBL,MAAA,GAAS,EAAA;AAMJ,IACL,cAAA,GAAiB,CAAA;AADZ,IAEL,QAAA,GAAW,EAAA;AAFN,IAGL,WAAA,GAAc,EAAA;AAHT,IAIL,QAAA,GAAW,EAAA;AAJN,IAKL,SAAA,GAAY,EAAA;AALP,IAML,OAAA,GAAU,EAAA;AANL,IAOL,QAAA,GAAW,EAAA;AAPN,IAQL,QAAA,GAAW,EAAA;AARN,IASL,OAAA,GAAU,EAAA;AATL,IAUL,SAAA,GAAY,EAAA;AAVP,IAWL,UAAA,GAAa,GAAA;AAXR,IAYL,QAAA,GAAW,GAAA;AAZN,IAaL,SAAA,GAAY,GAAA;AAbP,IAeL,WAAA,GAAc,GAAA;AAfT,IAgBL,YAAA,GAAe,GAAA;AAhBV,IAiBL,WAAA,GAAc,GAAA;AAKT,IAAM,MAAA,GAAS,CAAA,CAAA,KAAK,CAAA,GAAI,CAAC,CAAA,KAAM,GAAA,IAAO,CAAA,CAAE,CAAC,CAAA,KAAM,GAAA,IAAO,CAAA,KAAM,aAAA,IAAiB,CAAA,KAAM,WAAA;;;ADzCnF,IAAI,GAAA;AAAJ,IAAS,GAAA;AAAT,IAGL,KAAA,GAAQ,CAAA,CAAA,MAAM,GAAA,GAAM,CAAA,EAAG,MAAM,CAAA,EAAG,CAAA,GAAI,IAAA,EAAK,EAAG,GAAA,CAAI,GAAG,CAAA,GAAIA,IAAAA,KAAQ,CAAA,IAAK,EAAA,CAAA;AAH/D,IAMLA,IAAAA,GAAM,CAAC,GAAA,GAAM,kBAAA,EACX,QAAQ,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,GAAG,EAAE,KAAA,CAAM,IAAI,CAAA,EACpCC,KAAAA,GAAO,MAAM,GAAA,EAAI,EACjB,MAAA,GAAS,GAAA,CAAI,KAAA,CAAM,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,MAAM,EAAE,CAAA,EAAG,GAAG,CAAA,EAC7C,QAAQ,GAAA,CAAI,KAAA,CAAM,GAAA,EAAK,GAAA,GAAM,EAAE,CAAA,KAC5B;AACH,EAAA,MAAM,WAAA,CAAY,CAAA,EAAG,GAAG,CAAA,IAAA,EAAO,MAAM,MAAA,GAAS,CAAC,CAAA,CAAA,EAAIA,KAAAA,CAAK,SAAS,CAAC,CAAA,QAAA,EAAM,MAAM,CAAA,CAAA,EAAI,KAAK,CAAA,CAAE,CAAA;AAC3F,CAAA;AAbK,IAgBL,IAAA,GAAO,CAAC,EAAA,EAAI,IAAA,GAAO,KAAK,CAAA,KAAM;AAC5B,EAAA,OAAO,IAAI,EAAA,CAAG,GAAA,CAAI,WAAW,GAAG,CAAC,GAAG,GAAA,IAAO,CAAA;AAC3C,EAAA,OAAO,GAAA,CAAI,KAAA,CAAM,IAAA,EAAM,GAAG,CAAA;AAC5B,CAAA;AAnBK,IAsBL,IAAA,GAAO,MAAM,GAAA,CAAI,GAAA,EAAK,CAAA;AAtBjB,IAyBL,IAAA,GAAO,CAAC,IAAA,GAAO,CAAA,EAAG,GAAA,KAAQ;AACxB,EAAA,IAAI,EAAA,EAAIC,QAAO,OAAA,EAAS,EAAA;AAGxB,EAAA,OAAA,CACG,KAAK,KAAA,EAAM;AAAA;AAAA,GAEX,YACG,EAAA,GAAK,MAAA,CAAO,EAAE,CAAA,KAAM,EAAA,CAAGA,QAAO,IAAI,CAAA;AAAA,GACnC,CAACA,MAAAA,IAAS,IAAA,CAAK,MAAM,EAAE,CAAA,CAAA,CAAA,EAE1BA,MAAAA,GAAQ,OAAA;AAGV,EAAA,IAAI,GAAA,EAAK,EAAA,IAAM,GAAA,GAAM,GAAA,EAAA,GAAQF,IAAAA,CAAI,WAAA,GAAc,MAAA,CAAO,YAAA,CAAa,GAAA,IAAO,GAAA,GAAM,EAAA,GAAK,CAAA,GAAI,EAAE,CAAC,CAAA;AAE5F,EAAA,OAAOE,MAAAA;AACT,CAAA;AA1CK,IA6CL,QAAQ,CAAA,EAAA,KAAM;AAAE,EAAA,OAAA,CAAQ,EAAA,GAAK,GAAA,CAAI,UAAA,CAAW,GAAG,MAAM,KAAA,EAAO,GAAA,EAAA;AAAO,EAAA,OAAO,EAAA;AAAG,CAAA;AA7CxE,IAgDL,KAAK,KAAA,CAAM,EAAA,GAAK,CAAA,CAAA,KACb,CAAA,IAAK,MAAM,CAAA,IAAK,EAAA;AAChB,CAAA,IAAK,MAAM,CAAA,IAAK,EAAA;AAChB,CAAA,IAAK,MAAM,CAAA,IAAK,GAAA;AACjB,CAAA,IAAK,MAAM,CAAA,IAAK,EAAA;AACf,CAAA,IAAK,GAAA,IAAO,CAAA,IAAK,GAAA,IAAO,CAAA,IAAK,GAAA;AArD3B,IAyDL,SAAS,EAAC;AAzDL,IA6DL,KAAA,GAAQ,CACN,EAAA,EACA,IAAA,GAAO,OACP,GAAA,EACA,CAAA,GAAI,GAAG,UAAA,CAAW,CAAC,GACnB,CAAA,GAAI,EAAA,CAAG,QACP,IAAA,GAAO,MAAA,CAAO,CAAC,CAAA,EACf,IAAA,GAAO,GAAG,WAAA,EAAY,KAAM,OACzB,MAAA,CAAO,CAAC,IAAI,CAAC,CAAA,EAAG,SAAS,KAAA,EAAO,IAAA,GAAO,SAEvC,KAAA,GACC,EAAA,IAAM,SACJ,CAAA,GAAI,CAAA,IAAK,IAAI,MAAA,CAAO,GAAA,EAAK,CAAC,CAAA,IAAK,EAAA,MAAQ,KAAA,GAAQ,EAAA,CAAA,KAEnD,OAAA,GAAU,IAAA;AACV,EAAE,QAAQ,KAAA,CAAM,EAAA,CAAG,IAAI,UAAA,CAAW,GAAA,GAAM,CAAC,CAAC,CAAA,CAAA;AAAA,CACzC,GAAA,IAAO,CAAA,EAAG,GAAA,CAAI,CAAC,MAAM,GAAA,GAAM,IAAA,EAAM,CAAC,IAAA,IAAQF,IAAAA,EAAI,CAAA,CAAA,IAEjD,IAAA,GAAO,CAAA,EAAG,SAAS,KAAK,CAAA;AA/ErB,IAkFL,MAAA,GAAS,CAAC,EAAA,EAAI,IAAA,EAAM,KAAA,GAAQ,UAAU,KAAA,CAAM,EAAA,EAAI,IAAA,EAAM,CAAC,CAAA,EAAG,CAAA,KAAM,MAAM,CAAA,GAAI,IAAA,CAAK,IAAA,IAAQ,KAAA,GAAQ,GAAA,GAAK,CAAA,CAAE,MAAM,CAAC,EAAA,EAAI,CAAA,EAAG,CAAC,CAAC,CAAA;AAlFjH,IAqFL,KAAA,GAAQ,CAAC,EAAA,EAAI,IAAA,EAAM,IAAA,KAAS,MAAM,EAAA,EAAI,IAAA,EAAM,CAAA,CAAA,KAAK,IAAA,GAAQ,CAAA,IAAK,CAAC,IAAI,CAAC,CAAA,GAAM,CAAC,CAAA,KAAM,CAAA,GAAI,IAAA,CAAK,IAAA,GAAO,GAAE,CAAA,CAAA,IAAM,CAAC,EAAA,EAAI,CAAC,CAAE,CAAA;AArF5G,IAyFL,IAAA,GAAO,CAAC,EAAA,EAAI,IAAA,EAAM,KAAA,KAAU;AAC1B,EAAA,KAAA;AAAA,IAAM,EAAA;AAAA,IAAI,IAAA;AAAA,IACR,CAAC,CAAA,EAAG,CAAA,MACF,IAAI,IAAA,CAAK,IAAA,IAAQ,QAAQ,GAAA,GAAK,CAAA,CAAE,CAAA,EAE7B,CAAA,GAAI,CAAC,CAAA,KAAM,EAAA,KAAQ,IAAI,CAAC,EAAA,EAAI,KAAK,IAAI,CAAA,CAAA;AAAA,IACtC,CAAA,GAAI,CAAC,CAAA,KAAM,EAAA,GAAK,EAAE,IAAA,CAAK,GAAG,CAAA,CAAE,KAAA,CAAM,CAAC,CAAC,CAAA,GAAI,CAAA,CAAE,IAAA,CAAK,KAAK,IAAI,CAAA;AAAA,IACxD,CAAA;AAAA,GAEN;AACF,CAAA;AAnGK,IAsGL,KAAA,GAAQ,CAAC,EAAA,EAAI,IAAA,KAAS,MAAM,EAAA,CAAG,CAAC,GAAG,IAAA,EAAM,CAAA,CAAA,KAAM,CAAC,CAAA,IAAK,CAAC,IAAI,IAAA,CAAK,CAAA,EAAG,GAAG,UAAA,CAAW,CAAC,CAAC,CAAC,CAAE,CAAA;AAtGhF,IA0GL,MAAA,GAAS,CAAC,EAAA,EAAI,IAAA,KAAS,MAAM,EAAA,CAAG,CAAC,CAAA,EAAG,IAAA,EAAM,CAAA,CAAA,KAAM,CAAA,IAAK,CAAC,EAAA,EAAI,CAAA,EAAG,KAAK,CAAA,EAAG,EAAA,CAAG,WAAW,CAAC,CAAC,CAAA,IAAK,IAAI,CAAE,CAAA;AAGlG,IAAO,aAAA,GAAQ,KAAA;;;AE3Gf,IAAM,EAAA,GAAK,EAAA;AAAX,IAAe,EAAA,GAAK,EAAA;AAApB,IAAwB,EAAA,GAAK,GAAA;AAA7B,IAAkC,EAAA,GAAK,EAAA;AAAvC,IAA2C,EAAA,GAAK,GAAA;AAAhD,IAAqD,EAAA,GAAK,EAAA;AAC1D,IAAM,EAAA,GAAK,EAAA;AAAX,IAAe,EAAA,GAAK,GAAA;AAApB,IAAyB,EAAA,GAAK,EAAA;AAA9B,IAAkC,EAAA,GAAK,EAAA;AAGvC,IAAM,GAAA,GAAM,CAAC,CAAA,EAAG,CAAA,KAAM,GAAC,CACrB,CAAA,GAAI,CAAC,IAAA,CAAK,CAAA,CAAA,KAAM,CAAA,KAAM,MAAA,IAAY,CAAA,IAAK,MAAM,CAAA,IAAK,EAAA,KAAQ,CAAA,KAAM,EAAA,IAAM,CAAA,KAAM,EAAA,GAAK,CAAA,GAAI,CAAA,CAAE,CAAA,KACpF,CAAA,GAAIA,IAAAA,EAAI,GAAI,CAAC,CAAA;AAGlB,MAAA,CAAO,MAAM,CAAA,GAAI,CAAA,CAAA,KAAK,CAAC,KAAK,GAAA,EAAI;AAGhC,KAAA,IAAS,CAAA,GAAI,EAAA,GAAK,CAAA,EAAG,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAK,MAAA,CAAO,CAAC,CAAA,GAAI,CAAA,CAAA,KAAK,CAAA,GAAIA,IAAAA,KAAQ,GAAA,EAAI;AAGpE,MAAA,CAAO,EAAE,IAAI,CAAA,CAAA,KAAK;AAChB,EAAA,IAAI,CAAA,SAAUA,IAAAA,EAAI;AAClB,EAAA,MAAM,QAAA,GAAW,GAAA,CAAI,UAAA,CAAW,GAAA,GAAM,CAAC,CAAA;AAGvC,EAAA,IAAI,QAAA,KAAa,EAAA,IAAM,QAAA,KAAa,EAAA,EAAI;AACtC,IAAA,IAAA,EAAK;AAAG,IAAA,IAAA,EAAK;AACb,IAAA,MAAM,IAAI,IAAA,CAAK,CAAA,CAAA,KAAK,CAAA,KAAM,EAAA,IAAM,MAAM,EAAE,CAAA;AACxC,IAAA,OAAO,GAAG,QAAA,CAAS,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,EAC1B;AAEA,EAAA,IAAI,QAAA,KAAa,EAAA,IAAM,QAAA,KAAa,EAAA,EAAI;AACtC,IAAA,IAAA,EAAK;AAAG,IAAA,IAAA,EAAK;AACb,IAAA,MAAM,IAAI,IAAA,CAAK,CAAA,CAAA,KAAK,CAAA,IAAK,EAAA,IAAM,KAAK,EAAE,CAAA;AACtC,IAAA,OAAO,GAAG,QAAA,CAAS,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,EAC1B;AAEA,EAAA,IAAI,QAAA,KAAa,EAAA,IAAM,QAAA,KAAa,EAAA,EAAI;AACtC,IAAA,IAAA,EAAK;AAAG,IAAA,IAAA,EAAK;AACb,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,CAAA,CAAA,KAAM,CAAA,IAAK,MAAM,CAAA,IAAK,EAAA,IAAQ,CAAA,IAAK,EAAA,IAAM,CAAA,IAAK,EAAA,IAAQ,CAAA,IAAK,EAAA,IAAM,KAAK,EAAG,CAAA;AACxF,IAAA,OAAO,GAAG,QAAA,CAAS,CAAA,EAAG,EAAE,CAAC,CAAA;AAAA,EAC3B;AAEA,EAAA,OAAO,GAAA,EAAI;AACb,CAAA;;;ACzCA,IAAM,MAAA,GAAS,EAAE,CAAA,EAAG,IAAA,EAAM,CAAA,EAAG,IAAA,EAAM,CAAA,EAAG,GAAA,EAAM,CAAA,EAAG,IAAA,EAAM,CAAA,EAAG,IAAA,EAAM,GAAG,IAAA,EAAK;AAAtE,IACE,SAAS,CAAA,CAAA,KAAK,CAAC,EAAA,EAAI,IAAA,EAAM,MAAM,EAAA,KAAO;AACpC,EAAA,EAAA,IAAMA,KAAI,mBAAmB,CAAA;AAC7B,EAAA,IAAA,EAAK;AAKL,EAAA,IAAA,CAAK,CAAA,CAAA,KAAK,IAAI,CAAA,KAAM,CAAA,KAAM,UAAU,GAAA,IAAO,MAAA,CAAO,IAAI,GAAA,GAAI,CAAC,CAAC,CAAA,IAAK,GAAA,CAAI,MAAI,CAAC,CAAA,EAAG,MAAO,GAAA,IAAO,GAAA,CAAI,GAAG,CAAA,EAAG,CAAA,CAAA,CAAG,CAAA;AACxG,EAAA,IAAA,EAAK,IAAKA,KAAI,YAAY,CAAA;AAC1B,EAAA,OAAO,GAAG,GAAG,CAAA;AACf,CAAA;AAIF,MAAA,CAAO,MAAM,CAAA,GAAI,MAAA,CAAO,MAAM,CAAA;AAC9B,MAAA,CAAO,KAAK,CAAA,GAAI,MAAA,CAAO,KAAK,CAAA;;;AChBrB,IAAM,OAAA,GAAU,CAAC,IAAA,KAAS,CAAC,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,GAAI,OAAA,CAAQ,EAAA,CAAG,IAAI,CAAA,GAAI,CAAC,IAAA,CAAK,CAAC,CAAA,GAAI,MAAM,IAAA,CAAK,CAAC,CAAA,GAAI,SAAA,CAAU,IAAA,CAAK,CAAC,CAAC,CAAA,CAAE,IAAA,CAAK,GAAG,IAAI,CAAA;AAE9H,OAAA,CAAQ,EAAA,GAAK,CAAA,IAAA,KAAQ,CAAA,GAAA,KAAO,MAAM,IAAI;AAFtC,IAKL,YAAY,EAAC;AALR,IAQL,WAAW,CAAC,EAAA,EAAI,IAAI,IAAA,GAAO,SAAA,CAAU,EAAE,CAAA,KAAO,SAAA,CAAU,EAAE,CAAA,GAAI,CAAA,GAAI,SAAS,EAAA,CAAG,GAAG,IAAI,CAAA,IAAK,IAAA,GAAO,GAAG,IAAI,CAAA;AARnG,IAWLG,KAAAA,GAAO,CAAC,CAAA,EAAG,EAAA,EAAI,SAAS,GAAA,EAAK,IAAA;AAAA;AAAA,EAE3B,CAAA,CAAE,CAAC,CAAA,KAAM,IAAA,IAAQ,CAAA,CAAE,MAAA,IAAU,CAAA,GAAIA,KAAAA,CAAK,CAAA,CAAE,CAAC,CAAA,EAAG,EAAA,EAAI,OAAO,CAAA;AAAA;AAAA,IAErD,OAAO,CAAA,KAAM,QAAA,GAAW,SAAO,EAAA,CAAG,GAAA,EAAK,GAAG,GAAG,CAAA;AAAA;AAAA,MAE3C,CAAA,CAAE,CAAC,CAAA,KAAM,GAAA,IAAO,MAAM,OAAA,CAAQ,CAAA,CAAE,CAAC,CAAC,CAAA,EAAG,OAAO,CAAA,CAAE,CAAC,GAAG,CAAA,GAAA,KAAO,EAAA,CAAG,IAAI,GAAG,CAAA,EAAG,MAAM,GAAG,CAAA;AAAA;AAAA,QAE7E,CAAA,CAAE,CAAC,CAAA,KAAM,IAAA,IAAQ,CAAA,CAAE,MAAA,KAAW,CAAA,IAAK,GAAA,GAAM,OAAA,CAAQ,CAAA,CAAE,CAAC,CAAC,CAAA,EAAG,IAAA,GAAO,OAAA,CAAQ,CAAA,CAAE,CAAC,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAA,CAAG,GAAA,CAAI,GAAG,CAAA,EAAG,IAAA,CAAK,GAAG,CAAA,EAAG,GAAG,CAAA;AAAA;AAAA,UAE9G,WAAW,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,SAAO,EAAA,CAAG,CAAC,CAAA,CAAE,GAAG,CAAC,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,IAAK,MAAMH,KAAI,gBAAgB;AAAA;AAAA;AAAA;AAAA;AAAA,CAAA;AAGhG,IAAO,eAAA,GAAQ,OAAA;;;ACtBf,MAAA,CAAO,MAAM,WAAW,CAAA;AACxB,QAAA;AAAA,EAAS,IAAA;AAAA,EAAM,CAAC,CAAA,EAAG,CAAA,EAAG,IAAA,KAAS,CAAA,KAAM,WACnC,IAAA,GAAO,CAAC,CAAA,GAAI,MAAM,EAAC;AAAA;AAAA,IACjB,CAAA,CAAE,CAAC,CAAA,KAAM,GAAA,IAAO,CAAA,GAAI,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,CAAE,GAAA,CAAI,CAAAI,EAAAA,KAAK,CAACA,KAAI,GAAA,EAAI,GAAI,OAAA,CAAQA,EAAC,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,CAAA,CAAE,GAAA,CAAI,CAAA,GAAA,KAAO,GAAA,CAAI,GAAG,CAAC,CAAA;AAAA;AAAA,OAC3F,CAAA,GAAI,QAAQ,CAAC,CAAA,EAAG,SAAO,CAAC,CAAA,CAAE,GAAG,CAAC,CAAA;AAAA;AAAA,GAAA;AAAA;AAAA,EAGnCD,KAAAA,CAAK,CAAA,EAAG,CAAC,GAAA,EAAK,MAAM,GAAA,KAAQ,GAAA,CAAI,IAAI,CAAA,CAAE,GAAG,IAAA,CAAK,GAAG,CAAC,GAAG,IAAI,CAAA;AAE3D,CAAA;;;ACTA,MAAA,CAAO,MAAM,WAAW,CAAA;AACxB,QAAA,CAAS,MAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAC,IAAIH,IAAAA,EAAI,IAAK,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,GAAG,CAAA,GAAA,KAAO;AAAE,EAAA,MAAM,CAAA,GAAI,EAAE,GAAG,CAAA;AAAG,EAAA,OAAO,OAAO,CAAC,CAAA,GAAI,SAAY,CAAA,CAAE,GAAG,EAAE,CAAC,CAAA;AAAE,CAAA,CAAE,CAAA;AAG7I,MAAA,CAAO,KAAK,WAAW,CAAA;AACvB,QAAA,CAAS,GAAA,EAAK,CAAC,CAAA,EAAG,CAAA,MAAO,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,CAAC,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,EAAG,MAAA,CAAO,CAAC,CAAA,GAAI,MAAM,MAAA,GAAY,CAAA,GAAA,KAAO,CAAA,CAAE,GAAG,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA;;;ACL9G,KAAA,CAAM,MAAM,WAAW,CAAA;AACvB,QAAA,CAAS,IAAA,EAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,MAAA,KAAc,CAAC,CAAA,IAAKA,IAAAA,CAAI,UAAU,CAAA,EAAG,OAAA,CAAQ,CAAC,CAAA,CAAE,CAAA;AAE/E,IAAM,OAAO,CAAA,GAAI,IAAA,MAAU,IAAA,GAAO,IAAA,CAAK,IAAI,OAAO,CAAA,EAAG,CAAA,GAAA,KAAO,IAAA,CAAK,IAAI,CAAA,GAAA,KAAO,GAAA,CAAI,GAAG,CAAC,EAAE,GAAA,EAAI,CAAA;AAC1F,IAAA,CAAK,GAAA,EAAK,QAAQ,CAAA,EAAG,QAAA,CAAS,KAAK,IAAI,CAAA;AACvC,IAAA,CAAK,KAAK,cAAA,EAAgB,IAAI,CAAA,EAAG,QAAA,CAAS,KAAK,IAAI,CAAA;;;ACLnD,MAAA,CAAO,GAAA,EAAK,aAAa,IAAI,CAAA;AAC7B,QAAA,CAAS,KAAK,CAAC,CAAA,EAAG,CAAA,MAChB,CAAA,GAAI,QAAQ,CAAC,CAAA;AAEbG,KAAAA,CAAK,CAAA,EAAG,CAAC,SAAA,EAAW,IAAA,EAAM,GAAA,KAAQ,SAAA,CAAU,IAAI,CAAA,GAAI,CAAA,CAAE,GAAG,CAAC,CAAA,CAC3D,CAAA;;;ACND,MAAA,CAAO,GAAA,EAAK,SAAS,CAAA,EAAG,QAAA,CAAS,KAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,GAAI,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAC7G,MAAA,CAAO,GAAA,EAAK,SAAS,CAAA,EAAG,QAAA,CAAS,KAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,GAAI,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAC7G,MAAA,CAAO,GAAA,EAAK,SAAS,CAAA,EAAG,QAAA,CAAS,KAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,GAAI,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAE7G,MAAA,CAAO,IAAA,EAAM,aAAa,IAAI,CAAA;AAC9B,QAAA,CAAS,IAAA,EAAM,CAAC,CAAA,EAAG,CAAA,MACjB,IAAI,OAAA,CAAQ,CAAC,GACbA,KAAAA,CAAK,CAAA,EAAG,CAAC,SAAA,EAAW,IAAA,EAAM,QAAQ,SAAA,CAAU,IAAI,KAAK,CAAA,CAAE,GAAG,CAAC,CAAA,CAC5D,CAAA;AAED,MAAA,CAAO,IAAA,EAAM,aAAa,IAAI,CAAA;AAC9B,QAAA,CAAS,IAAA,EAAM,CAAC,CAAA,EAAG,CAAA,MACjB,IAAI,OAAA,CAAQ,CAAC,GACbA,KAAAA,CAAK,CAAA,EAAG,CAAC,SAAA,EAAW,IAAA,EAAM,QAAQ,SAAA,CAAU,IAAI,KAAK,CAAA,CAAE,GAAG,CAAC,CAAA,CAC5D,CAAA;AAED,MAAA,CAAO,IAAA,EAAM,aAAa,IAAI,CAAA;AAC9B,QAAA,CAAS,IAAA,EAAM,CAAC,CAAA,EAAG,CAAA,MACjB,IAAI,OAAA,CAAQ,CAAC,GACbA,KAAAA,CAAK,CAAA,EAAG,CAAC,SAAA,EAAW,IAAA,EAAM,QAAQ,SAAA,CAAU,IAAI,KAAK,CAAA,CAAE,GAAG,CAAC,CAAA,CAC5D,CAAA;;;ACnBD,MAAA,CAAO,GAAA,EAAK,QAAQ,CAAA,EAAG,QAAA,CAAS,KAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,GAAI,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAC5G,MAAA,CAAO,GAAA,EAAK,QAAQ,CAAA,EAAG,QAAA,CAAS,KAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,GAAI,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAE5G,KAAA,CAAM,KAAK,WAAW,CAAA,EAAG,SAAS,GAAA,EAAK,CAAC,GAAG,CAAA,KAAM,CAAC,CAAA,KAAM,CAAA,GAAI,QAAQ,CAAC,CAAA,EAAG,SAAO,CAAC,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AACvF,KAAA,CAAM,KAAK,WAAW,CAAA,EAAG,SAAS,GAAA,EAAK,CAAC,GAAG,CAAA,KAAM,CAAC,CAAA,KAAM,CAAA,GAAI,QAAQ,CAAC,CAAA,EAAG,SAAO,CAAC,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAEvF,MAAA,CAAO,IAAA,EAAM,aAAa,IAAI,CAAA;AAC9B,QAAA,CAAS,IAAA,EAAM,CAAC,CAAA,EAAG,CAAA,MACjB,IAAI,OAAA,CAAQ,CAAC,GACbA,KAAAA,CAAK,CAAA,EAAG,CAAC,SAAA,EAAW,IAAA,EAAM,QAAQ,SAAA,CAAU,IAAI,KAAK,CAAA,CAAE,GAAG,CAAC,CAAA,CAC5D,CAAA;AAED,MAAA,CAAO,IAAA,EAAM,aAAa,IAAI,CAAA;AAC9B,QAAA,CAAS,IAAA,EAAM,CAAC,CAAA,EAAG,CAAA,MACjB,IAAI,OAAA,CAAQ,CAAC,GACbA,KAAAA,CAAK,CAAA,EAAG,CAAC,SAAA,EAAW,IAAA,EAAM,QAAS,SAAA,CAAU,IAAI,KAAK,CAAA,CAAE,GAAG,CAAE,CAAA,CAC9D,CAAA;;;ACjBD,KAAA,CAAM,IAAA,EAAM,YAAA,EAAc,CAAA,CAAA,KAAK,CAAA,GAAI,CAAC,IAAA,EAAM,CAAA,EAAG,IAAK,CAAA,GAAI,CAAC,IAAA,EAAM,IAAA,CAAK,YAAA,GAAe,CAAC,CAAC,CAAC,CAAA;AAEpF,QAAA,CAAS,IAAA,EAAM,CAAC,CAAA,EAAE,CAAA,KAAMA,MAAK,CAAA,EAAG,CAAA,KAAM,OAAO,CAAC,GAAA,EAAK,SAAS,GAAA,CAAI,IAAI,MAAM,CAAC,GAAA,EAAK,SAAS,EAAE,GAAA,CAAI,IAAI,CAAC,CAAC,CAAA;AAErG,KAAA,CAAM,IAAA,EAAM,YAAA,EAAc,CAAA,CAAA,KAAK,CAAA,GAAI,CAAC,IAAA,EAAM,CAAA,EAAG,IAAK,CAAA,GAAI,CAAC,IAAA,EAAM,IAAA,CAAK,YAAA,GAAe,CAAC,CAAC,CAAC,CAAA;AAEpF,QAAA,CAAS,IAAA,EAAM,CAAC,CAAA,EAAG,CAAA,KAAMA,MAAK,CAAA,EAAG,CAAA,KAAM,OAAO,CAAC,GAAA,EAAK,SAAS,GAAA,CAAI,IAAI,MAAM,CAAC,GAAA,EAAK,SAAS,EAAE,GAAA,CAAI,IAAI,CAAC,CAAC,CAAA;;;ACNtG,KAAA,CAAM,KAAK,WAAW,CAAA,EAAG,SAAS,GAAA,EAAK,CAAC,GAAG,CAAA,KAAM,CAAC,CAAA,KAAM,CAAA,GAAI,QAAQ,CAAC,CAAA,EAAG,SAAO,CAAC,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAEvF,MAAA,CAAO,GAAA,EAAK,OAAO,CAAA,EAAG,QAAA,CAAS,KAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,GAAI,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAE3G,MAAA,CAAO,GAAA,EAAK,QAAQ,CAAA,EAAG,QAAA,CAAS,KAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,GAAI,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAE5G,MAAA,CAAO,GAAA,EAAK,QAAQ,CAAA,EAAG,QAAA,CAAS,KAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,GAAI,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;;;ACN5G,KAAA,CAAM,KAAK,WAAW,CAAA,EAAG,SAAS,GAAA,EAAK,CAAC,GAAG,CAAA,KAAM,CAAC,CAAA,KAAM,CAAA,GAAI,QAAQ,CAAC,CAAA,EAAG,SAAO,CAAC,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAEvF,MAAA,CAAO,MAAM,QAAQ,CAAA;AACrB,QAAA,CAAS,MAAM,CAAC,CAAA,EAAG,OAAO,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,GAAG,CAAA,GAAA,KAAO,CAAA,CAAE,GAAG,CAAA,IAAK,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAElF,MAAA,CAAO,MAAM,SAAS,CAAA;AACtB,QAAA,CAAS,MAAM,CAAC,CAAA,EAAG,OAAO,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,GAAG,CAAA,GAAA,KAAO,CAAA,CAAE,GAAG,CAAA,IAAK,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;;;ACLlF,MAAA,CAAO,IAAA,EAAM,OAAO,CAAA,EAAG,QAAA,CAAS,MAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,IAAK,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAC9G,MAAA,CAAO,IAAA,EAAM,OAAO,CAAA,EAAG,QAAA,CAAS,MAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,IAAK,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAC9G,MAAA,CAAO,GAAA,EAAK,SAAS,CAAA,EAAG,QAAA,CAAS,KAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,GAAI,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAC7G,MAAA,CAAO,GAAA,EAAK,SAAS,CAAA,EAAG,QAAA,CAAS,KAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,GAAI,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAC7G,MAAA,CAAO,IAAA,EAAM,SAAS,CAAA,EAAG,QAAA,CAAS,MAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,IAAK,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAChH,MAAA,CAAO,IAAA,EAAM,SAAS,CAAA,EAAG,QAAA,CAAS,MAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,IAAK,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;;;ACLhH,MAAA,CAAO,IAAA,EAAM,UAAU,CAAA,EAAG,QAAA,CAAS,MAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,IAAK,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AACjH,MAAA,CAAO,IAAA,EAAM,UAAU,CAAA,EAAG,QAAA,CAAS,MAAM,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,GAAA,KAAO,EAAE,GAAG,CAAA,IAAK,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA;AAEjH,MAAA,CAAO,KAAA,EAAO,aAAa,IAAI,CAAA;AAC/B,QAAA,CAAS,KAAA,EAAO,CAAC,CAAA,EAAG,CAAA,MAAO,IAAI,OAAA,CAAQ,CAAC,GAAG,IAAA,CAAK,CAAA,EAAG,CAAC,GAAA,EAAK,IAAA,EAAM,QAAS,GAAA,CAAI,IAAI,MAAM,CAAA,CAAE,GAAG,CAAE,CAAA,CAAE,CAAA;AAC/F,MAAA,CAAO,KAAA,EAAO,aAAa,IAAI,CAAA;AAC/B,QAAA,CAAS,KAAA,EAAO,CAAC,CAAA,EAAG,CAAA,MAAO,IAAI,OAAA,CAAQ,CAAC,GAAG,IAAA,CAAK,CAAA,EAAG,CAAC,GAAA,EAAK,IAAA,EAAM,QAAS,GAAA,CAAI,IAAI,MAAM,CAAA,CAAE,GAAG,CAAE,CAAA,CAAE,CAAA;;;ACY/F,IAAO,iBAAA,GAAQ,CAAA,CAAA,KAAK,eAAA,CAAQ,aAAA,CAAM,CAAC,CAAC,CAAA;;;AChBpC,IAAM,EAAE,IAAA,EAAAE,KAAAA,EAAK,GAAI,aAAA;AAGjB,IAAM,QAAA,GAAW,CAAC,CAAA,KACf,CAAA,IAAK,MAAM,CAAA,IAAK,GAAA;AAChB,CAAA,IAAK,MAAM,CAAA,IAAK,EAAA;AAChB,CAAA,IAAK,MAAM,CAAA,IAAK,EAAA;AACjB,CAAA,KAAM,KACF,CAAA,GACA,CAAA;AAGN,KAAA,CAAM,GAAA,EAAK,GAAA,EAAK,CAAC,CAAA,KAAe;AAC9B,EAAA,IAAI,CAAA,EAAG;AACP,EAAA,MAAM,IAAA,GAAOA,MAAK,QAAQ,CAAA;AAC1B,EAAA,IAAI,CAAC,IAAA,EAAM;AACX,EAAA,OAAO,GAAA,GAAM,IAAA;AACf,CAAC,CAAA;AAGD,KAAA,CAAM,GAAA,EAAK,GAAA,EAAK,CAAC,CAAA,KAAe;AAC9B,EAAA,IAAI,CAAA,EAAG;AACP,EAAA,MAAM,IAAA,GAAOA,MAAK,QAAQ,CAAA;AAC1B,EAAA,IAAI,CAAC,IAAA,EAAM;AACX,EAAA,OAAO,GAAA,GAAM,IAAA;AACf,CAAC,CAAA;AAGD,IAAM,wBAAwB,MAAiB;AAC7C,EAAA,MAAM,MAAiB,EAAC;AACxB,EAAA,GAAA,CAAI,CAAC,CAAA,GAAI,GAAA;AACT,EAAA,OAAO,GAAA;AACT,CAAA;AAGA,KAAA,CAAM,GAAA,EAAK,GAAA,EAAK,CAAC,CAAA,KAAe;AAC9B,EAAA,IAAI,CAAC,CAAA,EAAG,OAAO,qBAAA,EAAsB;AACrC,EAAA,OAAO,MAAA;AACT,CAAC,CAAA;AAID,IAAM,QAAA,uBAAe,GAAA,CAAI;AAAA,EACvB,MAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,IAAA;AAAA,EACA,aAAA;AAAA,EACA,WAAA;AAAA,EACA,WAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,OAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,QAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,QAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,SAAA;AAAA,EACA,UAAA;AAAA,EACA,YAAA;AAAA,EACA,UAAA;AAAA,EACA,UAAA;AAAA,EACA,UAAA;AAAA,EACA,WAAA;AAAA,EACA,QAAA;AAAA,EACA,UAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,QAAA;AAAA,EACA,KAAA;AAAA,EACA;AACF,CAAC,CAAA;AAED,IAAM,eAAA,uBAAsB,GAAA,CAAI;AAAA,EAC9B,KAAA;AAAA,EACA,KAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,QAAA;AAAA,EACA,KAAA;AAAA,EACA;AACF,CAAC,CAAA;AASD,SAAS,UAAU,IAAA,EAAuB;AACxC,EAAA,OAAO,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,WAAA,EAAa,CAAA;AACxC;AAEA,SAAS,gBAAgB,IAAA,EAAuB;AAC9C,EAAA,OAAO,eAAA,CAAgB,GAAA,CAAI,IAAA,CAAK,WAAA,EAAa,CAAA;AAC/C;AAEA,SAAS,eAAe,IAAA,EAAuB;AAC7C,EAAA,OAAO,KAAK,UAAA,CAAW,GAAG,CAAA,IAAK,IAAA,CAAK,WAAW,GAAG,CAAA;AACpD;AAEA,SAAS,sBAAsB,QAAA,EAA2B;AACxD,EAAA,OAAO,CAAC,SAAA,CAAU,QAAQ,CAAA,IAAK,CAAC,eAAe,QAAQ,CAAA;AACzD;AAEA,SAAS,gBAAgB,IAAA,EAAsB;AAC7C,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA,CAAE,CAAC,GAAG,KAAA,CAAM,GAAG,CAAA,CAAE,CAAC,CAAA,IAAK,EAAA;AAC9C;AAEA,SAAS,cAAA,CAAe,MAAqB,WAAA,EAAgC;AAC3E,EAAA,IAAI,IAAA,IAAQ,qBAAA,CAAsB,eAAA,CAAgB,IAAI,CAAC,CAAA,EAAG;AACxD,IAAA,WAAA,CAAY,IAAI,IAAI,CAAA;AAAA,EACtB;AACF;AAEA,SAAS,uBAAA,CAAwB,MAAc,WAAA,EAAgC;AAC7E,EAAA,IAAI,CAAC,cAAA,CAAe,IAAI,KAAK,CAAC,SAAA,CAAU,IAAI,CAAA,EAAG;AAC7C,IAAA,WAAA,CAAY,IAAI,IAAI,CAAA;AAAA,EACtB;AACF;AAEA,SAAS,8BAAA,CACP,MACA,WAAA,EACM;AACN,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAQ,CAAA,EAAA,EAAK;AACpC,IAAA,kBAAA,CAAmB,IAAA,CAAK,CAAC,CAAA,EAAc,WAAW,CAAA;AAAA,EACpD;AACA,EAAA,MAAM,QAAA,GAAW,KAAK,CAAC,CAAA;AACvB,EAAA,IAAI,OAAO,aAAa,QAAA,EAAU;AAChC,IAAA,kBAAA,CAAmB,UAAqB,WAAW,CAAA;AAAA,EACrD;AACF;AAEA,SAAS,qBAAA,CAAsB,MAAe,WAAA,EAAgC;AAC5E,EAAA,MAAM,IAAA,GAAO,aAAa,IAAI,CAAA;AAC9B,EAAA,IAAI,IAAA,EAAM;AACR,IAAA,cAAA,CAAe,MAAM,WAAW,CAAA;AAAA,EAClC,CAAA,MAAO;AACL,IAAA,MAAM,GAAG,GAAG,IAAI,CAAA,GAAI,IAAA;AACpB,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,MAAA,kBAAA,CAAmB,KAAK,WAAW,CAAA;AAAA,IACrC;AAAA,EACF;AACF;AAEA,SAAS,kBAAA,CAAmB,MAAe,WAAA,EAAgC;AACzE,EAAA,IAAI,OAAO,SAAS,QAAA,EAAU;AAC5B,IAAA,uBAAA,CAAwB,MAAM,WAAW,CAAA;AACzC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,EAAG;AACxB,IAAA;AAAA,EACF;AAEA,EAAA,MAAM,CAAC,EAAA,EAAI,GAAG,IAAI,CAAA,GAAI,IAAA;AAEtB,EAAA,IAAI,EAAA,KAAO,GAAA,IAAO,EAAA,KAAO,IAAA,EAAM;AAC7B,IAAA,qBAAA,CAAsB,MAAM,WAAW,CAAA;AACvC,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,OAAO,IAAA,EAAM;AACf,IAAA,8BAAA,CAA+B,MAAM,WAAW,CAAA;AAChD,IAAA;AAAA,EACF;AAEA,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,IAAA,kBAAA,CAAmB,KAAK,WAAW,CAAA;AAAA,EACrC;AACF;AAEA,SAAS,eAAe,GAAA,EAAyB;AAC/C,EAAA,OAAO,EAAE,CAAA,IAAK,GAAA,CAAA;AAChB;AAEA,SAAS,uBAAA,CAAwB,MAAe,KAAA,EAA+B;AAC7E,EAAA,MAAM,QAAA,GAAW,aAAa,IAAI,CAAA;AAClC,EAAA,MAAM,SAAA,GAAY,OAAO,KAAA,KAAU,QAAA,GAAW,KAAA,GAAQ,IAAA;AACtD,EAAA,IAAI,YAAY,SAAA,EAAW;AACzB,IAAA,OAAO,CAAA,EAAG,QAAQ,CAAA,CAAA,EAAI,SAAS,CAAA,CAAA;AAAA,EACjC;AACA,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,sBAAsB,KAAA,EAA+B;AAC5D,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,IAAK,KAAA,CAAM,CAAC,CAAA,KAAM,GAAA,IAAO,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG;AACnE,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,KAAA,GAAiB,MAAM,CAAC,CAAA;AAC9B,EAAA,IACE,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,IACnB,cAAA,CAAe,KAAK,CAAA,IACpB,OAAO,KAAA,CAAM,CAAC,CAAA,KAAM,QAAA,EACpB;AACA,IAAA,OAAO,CAAC,MAAM,CAAC,CAAA;AAAA,EACjB;AACA,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,oBAAA,CAAqB,MAAe,KAAA,EAA+B;AAC1E,EAAA,MAAM,QAAA,GAAW,aAAa,IAAI,CAAA;AAClC,EAAA,IAAI,CAAC,QAAA,EAAU;AACb,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,IAAI,MAAM,OAAA,CAAQ,KAAK,CAAA,IAAK,cAAA,CAAe,KAAK,CAAA,EAAG;AACjD,IAAA,IAAI,KAAA,CAAM,CAAC,CAAA,KAAM,GAAA,EAAK;AACpB,MAAA,OAAO,GAAG,QAAQ,CAAA,GAAA,CAAA;AAAA,IACpB;AACA,IAAA,IAAI,OAAO,KAAA,CAAM,CAAC,CAAA,KAAM,QAAA,EAAU;AAChC,MAAA,OAAO,CAAA,EAAG,QAAQ,CAAA,CAAA,EAAI,KAAA,CAAM,CAAC,CAAC,CAAA,CAAA,CAAA;AAAA,IAChC;AAAA,EACF;AAEA,EAAA,MAAM,aAAA,GAAgB,sBAAsB,KAAK,CAAA;AACjD,EAAA,IAAI,kBAAkB,IAAA,EAAM;AAC1B,IAAA,OAAO,CAAA,EAAG,QAAQ,CAAA,CAAA,EAAI,aAAa,CAAA,CAAA,CAAA;AAAA,EACrC;AAEA,EAAA,MAAM,SAAA,GAAY,aAAa,KAAK,CAAA;AACpC,EAAA,IAAI,SAAA,EAAW;AACb,IAAA,OAAO,CAAA,EAAG,QAAQ,CAAA,CAAA,EAAI,SAAS,CAAA,CAAA,CAAA;AAAA,EACjC;AACA,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,aAAa,IAAA,EAA8B;AAClD,EAAA,IAAI,OAAO,SAAS,QAAA,EAAU;AAC5B,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,IAAK,cAAA,CAAe,IAAI,CAAA,EAAG;AAChD,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,MAAM,CAAC,EAAA,EAAI,IAAA,EAAM,KAAK,CAAA,GAAI,IAAA;AAE1B,EAAA,IAAI,OAAO,GAAA,EAAK;AACd,IAAA,OAAO,uBAAA,CAAwB,MAAiB,KAAgB,CAAA;AAAA,EAClE;AAEA,EAAA,IAAI,OAAO,IAAA,EAAM;AACf,IAAA,OAAO,oBAAA,CAAqB,MAAiB,KAAgB,CAAA;AAAA,EAC/D;AAEA,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,uBAAuB,KAAA,EAAyB;AACvD,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,IAAK,KAAA,CAAM,CAAC,CAAA,KAAM,GAAA,IAAO,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG;AACnE,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,KAAA,GAAiB,MAAM,CAAC,CAAA;AAC9B,EAAA,OACE,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,IACnB,cAAA,CAAe,KAAK,CAAA,IACpB,OAAO,KAAA,CAAM,CAAC,CAAA,KAAM,QAAA;AAExB;AAEA,SAAS,yBAAA,CACP,OACA,QAAA,EACM;AACN,EAAA,IAAI,MAAM,OAAA,CAAQ,KAAK,CAAA,IAAK,cAAA,CAAe,KAAK,CAAA,EAAG;AACjD,IAAA,IAAI,KAAA,CAAM,CAAC,CAAA,KAAM,GAAA,EAAK;AACpB,MAAA,QAAA,CAAS,IAAI,gBAAgB,CAAA;AAAA,IAC/B,CAAA,MAAA,IAAW,OAAO,KAAA,CAAM,CAAC,MAAM,QAAA,EAAU;AACvC,MAAA,QAAA,CAAS,IAAI,aAAa,CAAA;AAAA,IAC5B;AAAA,EACF;AACA,EAAA,IAAI,sBAAA,CAAuB,KAAK,CAAA,EAAG;AACjC,IAAA,QAAA,CAAS,IAAI,aAAa,CAAA;AAAA,EAC5B;AACF;AAEA,SAAS,0BAAA,CACP,UACA,QAAA,EACM;AACN,EAAA,IAAI,OAAO,QAAA,KAAa,QAAA,IAAY,eAAA,CAAgB,QAAQ,CAAA,EAAG;AAC7D,IAAA,QAAA,CAAS,IAAI,gBAAgB,CAAA;AAAA,EAC/B;AACF;AAEA,SAAS,cAAA,CAAe,MAAe,QAAA,EAAqC;AAC1E,EAAA,IAAI,OAAO,SAAS,QAAA,EAAU;AAC5B,IAAA,IAAI,cAAA,CAAe,IAAI,CAAA,EAAG;AACxB,MAAA,QAAA,CAAS,IAAI,eAAe,CAAA;AAAA,IAC9B;AACA,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,IAAK,cAAA,CAAe,IAAI,CAAA,EAAG;AAChD,IAAA;AAAA,EACF;AAEA,EAAA,MAAM,EAAA,GAAK,KAAK,CAAC,CAAA;AAEjB,EAAA,IAAI,OAAO,GAAA,EAAK;AACd,IAAA,QAAA,CAAS,IAAI,aAAa,CAAA;AAAA,EAC5B;AAEA,EAAA,IAAI,OAAO,IAAA,EAAM;AACf,IAAA,yBAAA,CAA0B,IAAA,CAAK,CAAC,CAAA,EAAc,QAAQ,CAAA;AAAA,EACxD;AAEA,EAAA,IAAI,OAAO,IAAA,EAAM;AACf,IAAA,0BAAA,CAA2B,IAAA,CAAK,CAAC,CAAA,EAAc,QAAQ,CAAA;AAAA,EACzD;AAEA,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAQ,CAAA,EAAA,EAAK;AACpC,IAAA,cAAA,CAAe,IAAA,CAAK,CAAC,CAAA,EAAc,QAAQ,CAAA;AAAA,EAC7C;AACF;AAEO,SAAS,aAAa,UAAA,EAAiC;AAC5D,EAAA,MAAM,OAAA,GAAU,WAAW,IAAA,EAAK;AAChC,EAAA,IAAI,CAAC,OAAA,EAAS;AACZ,IAAA,MAAM,IAAI,MAAM,kBAAkB,CAAA;AAAA,EACpC;AAEA,EAAA,MAAM,GAAA,GAAM,MAAM,OAAO,CAAA;AAEzB,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAY;AACpC,EAAA,kBAAA,CAAmB,KAAK,WAAW,CAAA;AAEnC,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAoB;AAC5C,EAAA,cAAA,CAAe,KAAK,WAAW,CAAA;AAE/B,EAAA,MAAM,QAAA,GAAW,KAAA,CAAM,IAAA,CAAK,WAAW,CAAA;AACvC,EAAA,MAAM,UAAA,GAAkC,QAAA,CAAS,MAAA,GAAS,CAAA,GAAI,KAAA,GAAQ,KAAA;AAEtE,EAAA,OAAO;AAAA,IACL,GAAA;AAAA,IACA,YAAA,EAAc,KAAA,CAAM,IAAA,CAAK,WAAW,CAAA;AAAA,IACpC,QAAA;AAAA,IACA;AAAA,GACF;AACF;AAEO,SAAS,eACd,UAAA,EAC0E;AAC1E,EAAA,MAAM,OAAA,GAAU,WAAW,IAAA,EAAK;AAEhC,EAAA,IAAI,CAAC,OAAA,EAAS;AACZ,IAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,KAAA,EAAO,kBAAA,EAAmB;AAAA,EACrD;AAEA,EAAA,IAAI;AACF,IAAA,KAAA,CAAM,OAAO,CAAA;AACb,IAAA,OAAO,EAAE,SAAS,IAAA,EAAK;AAAA,EACzB,SAAS,CAAA,EAAG;AACV,IAAA,MAAM,KAAA,GAAQ,CAAA;AACd,IAAA,MAAM,KAAA,GAAQ,gBAAA,CAAiB,IAAA,CAAK,KAAA,CAAM,OAAO,CAAA;AACjD,IAAA,MAAM,QAAA,GAAW,KAAA,GACb,MAAA,CAAO,QAAA,CAAS,KAAA,CAAM,CAAC,CAAA,IAAK,GAAA,EAAK,EAAE,CAAA,GAAI,CAAA,GACvC,MAAA;AACJ,IAAA,OAAO;AAAA,MACL,OAAA,EAAS,KAAA;AAAA,MACT,OAAO,KAAA,CAAM,OAAA;AAAA,MACb;AAAA,KACF;AAAA,EACF;AACF;AAEO,SAAS,QAAA,CACd,YACA,OAAA,EACS;AACT,EAAA,MAAM,OAAA,GAAU,WAAW,IAAA,EAAK;AAChC,EAAA,IAAI,CAAC,OAAA,EAAS;AACZ,IAAA,MAAM,IAAI,MAAM,kBAAkB,CAAA;AAAA,EACpC;AACA,EAAA,MAAM,EAAA,GAAK,kBAAU,OAAO,CAAA;AAC5B,EAAA,OAAO,GAAG,OAAO,CAAA;AACnB;AAcA,IAAM,cAAA,uBAAqB,GAAA,CAAI,CAAC,KAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAG,CAAC,CAAA;AACxD,IAAM,cAAA,uBAAqB,GAAA,CAAI;AAAA,EAC7B,GAAA;AAAA,EACA,GAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA;AACF,CAAC,CAAA;AACD,IAAM,WAAA,mBAAc,IAAI,GAAA,CAAI,CAAC,IAAA,EAAM,MAAM,GAAA,EAAK,KAAA,EAAO,IAAA,EAAM,KAAK,CAAC,CAAA;AACjE,IAAM,iBAAA,uBAAwB,GAAA,CAAI;AAAA,EAChC,OAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,OAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,OAAA;AAAA,EACA;AACF,CAAC,CAAA;AACD,IAAM,gBAAA,uBAAuB,GAAA,CAAI;AAAA,EAC/B,QAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,SAAA;AAAA,EACA,UAAA;AAAA,EACA;AACF,CAAC,CAAA;AACD,IAAM,iBAAA,uBAAwB,GAAA,CAAI;AAAA,EAChC,UAAA;AAAA,EACA,YAAA;AAAA,EACA,UAAA;AAAA,EACA,QAAA;AAAA,EACA,WAAA;AAAA,EACA;AACF,CAAC,CAAA;AAED,SAAS,YAAA,CAAa,MAAc,UAAA,EAAsC;AACxE,EAAA,MAAM,SAAA,GAAY,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA,CAAE,CAAC,CAAA,EAAG,KAAA,CAAM,GAAG,CAAA,CAAE,CAAC,CAAA,IAAK,IAAA;AACvD,EAAA,MAAM,UAAA,GAAa,WAAW,SAAS,CAAA;AACvC,EAAA,IAAI,UAAA,KAAe,UAAU,OAAO,QAAA;AACpC,EAAA,IAAI,UAAA,KAAe,UAAU,OAAO,QAAA;AACpC,EAAA,IAAI,UAAA,KAAe,WAAW,OAAO,SAAA;AACrC,EAAA,OAAO,SAAA;AACT;AAEA,SAAS,kBAAA,CACP,MACA,UAAA,EACqB;AACrB,EAAA,IAAI,OAAO,IAAA,KAAS,QAAA,EAAU,OAAO,QAAA;AACrC,EAAA,IAAI,OAAO,IAAA,KAAS,SAAA,EAAW,OAAO,SAAA;AACtC,EAAA,IAAI,OAAO,IAAA,KAAS,QAAA,EAAU,OAAO,YAAA,CAAa,MAAM,UAAU,CAAA;AAClE,EAAA,IAAI,IAAA,KAAS,MAAM,OAAO,SAAA;AAC1B,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,sBAAsB,IAAA,EAA+B;AAC5D,EAAA,MAAM,GAAA,GAAM,KAAK,CAAC,CAAA;AAClB,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,OAAO,QAAA;AACpC,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,OAAO,QAAA;AACpC,EAAA,IAAI,OAAO,GAAA,KAAQ,SAAA,EAAW,OAAO,SAAA;AACrC,EAAA,OAAO,SAAA;AACT;AAEA,SAAS,iBAAA,CACP,IACA,UAAA,EACqB;AACrB,EAAA,IAAI,cAAA,CAAe,GAAA,CAAI,EAAE,CAAA,EAAG,OAAO,QAAA;AACnC,EAAA,IAAI,cAAA,CAAe,GAAA,CAAI,EAAE,CAAA,EAAG,OAAO,SAAA;AACnC,EAAA,IAAI,WAAA,CAAY,GAAA,CAAI,EAAE,CAAA,EAAG,OAAO,SAAA;AAChC,EAAA,IAAI,EAAA,KAAO,GAAA,IAAO,UAAA,KAAe,CAAA,EAAG,OAAO,QAAA;AAC3C,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,uBAAA,CACP,MACA,UAAA,EACc;AACd,EAAA,MAAM,IAAA,GAAO,aAAa,IAAI,CAAA;AAC9B,EAAA,OAAO,IAAA,GAAO,YAAA,CAAa,IAAA,EAAM,UAAU,CAAA,GAAI,SAAA;AACjD;AAEA,SAAS,sBAAsB,QAAA,EAAiC;AAC9D,EAAA,IAAI,OAAO,QAAA,KAAa,QAAA,EAAU,OAAO,SAAA;AACzC,EAAA,MAAM,SAAA,GAAY,SAAS,WAAA,EAAY;AACvC,EAAA,IAAI,iBAAA,CAAkB,GAAA,CAAI,SAAS,CAAA,EAAG,OAAO,QAAA;AAC7C,EAAA,IAAI,gBAAA,CAAiB,GAAA,CAAI,SAAS,CAAA,EAAG,OAAO,QAAA;AAC5C,EAAA,IAAI,iBAAA,CAAkB,GAAA,CAAI,SAAS,CAAA,EAAG,OAAO,SAAA;AAC7C,EAAA,OAAO,SAAA;AACT;AAEA,SAAS,iBAAA,CACP,MACA,UAAA,EACc;AACd,EAAA,MAAM,aAAA,GAAgB,kBAAA,CAAmB,IAAA,EAAM,UAAU,CAAA;AACzD,EAAA,IAAI,aAAA,KAAkB,MAAM,OAAO,aAAA;AAEnC,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,IAAI,GAAG,OAAO,SAAA;AACjC,EAAA,IAAI,cAAA,CAAe,IAAI,CAAA,EAAG,OAAO,sBAAsB,IAAI,CAAA;AAE3D,EAAA,MAAM,CAAC,EAAA,EAAI,GAAG,IAAI,CAAA,GAAI,IAAA;AAEtB,EAAA,MAAM,YAAA,GAAe,iBAAA,CAAkB,EAAA,EAAI,IAAA,CAAK,MAAM,CAAA;AACtD,EAAA,IAAI,YAAA,KAAiB,MAAM,OAAO,YAAA;AAElC,EAAA,IAAI,EAAA,KAAO,GAAA,IAAO,EAAA,KAAO,IAAA,EAAM;AAC7B,IAAA,OAAO,uBAAA,CAAwB,MAAM,UAAU,CAAA;AAAA,EACjD;AAEA,EAAA,IAAI,OAAO,IAAA,EAAM;AACf,IAAA,OAAO,qBAAA,CAAsB,IAAA,CAAK,CAAC,CAAY,CAAA;AAAA,EACjD;AAEA,EAAA,OAAO,SAAA;AACT;AAmBO,SAAS,gBAAA,CACd,UAAA,EACA,UAAA,GAAyB,EAAC,EACZ;AACd,EAAA,MAAM,OAAA,GAAU,WAAW,IAAA,EAAK;AAChC,EAAA,IAAI,CAAC,OAAA,EAAS;AACZ,IAAA,OAAO,SAAA;AAAA,EACT;AAEA,EAAA,IAAI;AACF,IAAA,MAAM,GAAA,GAAM,MAAM,OAAO,CAAA;AACzB,IAAA,OAAO,iBAAA,CAAkB,KAAK,UAAU,CAAA;AAAA,EAC1C,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,SAAA;AAAA,EACT;AACF;;;ACnjBO,SAAS,gBAAgB,UAAA,EAAsC;AACpE,EAAA,MAAM,MAAA,GAAS,aAAa,UAAU,CAAA;AACtC,EAAA,OAAO;AAAA,IACL,UAAA;AAAA,IACA,cAAc,MAAA,CAAO,YAAA;AAAA,IACrB,YAAY,MAAA,CAAO,UAAA;AAAA,IACnB,UAAU,MAAA,CAAO;AAAA,GACnB;AACF;;;ACZO,SAAS,sBACd,UAAA,EACwB;AACxB,EAAA,MAAM,MAAA,GAAS,eAAe,UAAU,CAAA;AAExC,EAAA,IAAI,OAAO,OAAA,EAAS;AAClB,IAAA,OAAO,EAAE,SAAS,IAAA,EAAK;AAAA,EACzB;AAEA,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,KAAA;AAAA,IACT,OAAO,MAAA,CAAO,KAAA;AAAA,IACd,UAAU,MAAA,CAAO;AAAA,GACnB;AACF;;;ACHO,SAAS,qBACd,YAAA,EACiB;AACjB,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAyB;AAE3C,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,YAAY,CAAA,EAAG;AACvD,IAAA,KAAA,CAAM,IAAI,IAAI,CAAA;AACd,IAAA,KAAA,CAAM,GAAA,CAAI,IAAA,EAAM,IAAI,GAAA,CAAI,IAAI,CAAC,CAAA;AAE7B,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,MAAA,KAAA,CAAM,IAAI,GAAG,CAAA;AAAA,IACf;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,OAAO,KAAA,EAAM;AACxB;AAYO,SAAS,2BACd,KAAA,EAC0B;AAC1B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,cAAA,uBAAqB,GAAA,EAAY;AACvC,EAAA,MAAM,OAAiB,EAAC;AAExB,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA,EAAG;AACtB,MAAA,MAAM,QAAQ,QAAA,CAAS,IAAA,EAAM,KAAA,EAAO,OAAA,EAAS,gBAAgB,IAAI,CAAA;AACjE,MAAA,IAAI,KAAA,EAAO;AACT,QAAA,OAAO,EAAE,WAAA,EAAa,IAAA,EAAM,KAAA,EAAM;AAAA,MACpC;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,WAAA,EAAa,KAAA,EAAO,KAAA,EAAO,IAAA,EAAK;AAC3C;AAEA,SAAS,QAAA,CACP,IAAA,EACA,KAAA,EACA,OAAA,EACA,gBACA,IAAA,EACiB;AACjB,EAAA,OAAA,CAAQ,IAAI,IAAI,CAAA;AAChB,EAAA,cAAA,CAAe,IAAI,IAAI,CAAA;AACvB,EAAA,IAAA,CAAK,KAAK,IAAI,CAAA;AAEd,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA;AACjC,EAAA,IAAI,IAAA,EAAM;AACR,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,MAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA,EAAG;AACrB,QAAA,MAAM,QAAQ,QAAA,CAAS,GAAA,EAAK,KAAA,EAAO,OAAA,EAAS,gBAAgB,IAAI,CAAA;AAChE,QAAA,IAAI,KAAA,EAAO;AACT,UAAA,OAAO,KAAA;AAAA,QACT;AAAA,MACF,CAAA,MAAA,IAAW,cAAA,CAAe,GAAA,CAAI,GAAG,CAAA,EAAG;AAClC,QAAA,MAAM,UAAA,GAAa,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AACnC,QAAA,OAAO,CAAC,GAAG,IAAA,CAAK,KAAA,CAAM,UAAU,GAAG,GAAG,CAAA;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AAEA,EAAA,IAAA,CAAK,GAAA,EAAI;AACT,EAAA,cAAA,CAAe,OAAO,IAAI,CAAA;AAC1B,EAAA,OAAO,IAAA;AACT;AAYO,SAAS,oBACd,KAAA,EACwB;AACxB,EAAA,MAAM,aAAA,GAAgB,2BAA2B,KAAK,CAAA;AACtD,EAAA,IAAI,aAAA,CAAc,WAAA,IAAe,aAAA,CAAc,KAAA,EAAO;AACpD,IAAA,OAAO;AAAA,MACL,OAAA,EAAS,KAAA;AAAA,MACT,OAAO,EAAC;AAAA,MACR,OAAO,CAAA,8BAAA,EAAiC,aAAA,CAAc,KAAA,CAAM,IAAA,CAAK,MAAM,CAAC,CAAA;AAAA,KAC1E;AAAA,EACF;AAEA,EAAA,MAAM,QAAA,GAAW,mBAAmB,KAAK,CAAA;AACzC,EAAA,MAAM,KAAA,GAAQ,sBAAsB,QAAQ,CAAA;AAC5C,EAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,KAAA,EAAO,KAAA,EAAO,QAAQ,CAAA;AAEjD,EAAA,KAAA,CAAM,OAAA,EAAQ;AACd,EAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,KAAA,EAAM;AAChC;AAEA,SAAS,mBAAmB,KAAA,EAA6C;AACvE,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AAEzC,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,QAAA,CAAS,GAAA,CAAI,MAAM,CAAC,CAAA;AAAA,EACtB;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,KAAA,CAAM,MAAA,EAAO,EAAG;AACvC,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,MAAA,QAAA,CAAS,IAAI,GAAA,EAAA,CAAM,QAAA,CAAS,IAAI,GAAG,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,IAChD;AAAA,EACF;AAEA,EAAA,OAAO,QAAA;AACT;AAEA,SAAS,sBAAsB,QAAA,EAAyC;AACtE,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,MAAM,CAAA,IAAK,QAAA,EAAU;AACrC,IAAA,IAAI,WAAW,CAAA,EAAG;AAChB,MAAA,MAAA,CAAO,KAAK,IAAI,CAAA;AAAA,IAClB;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,YAAA,CACP,KAAA,EACA,KAAA,EACA,QAAA,EACU;AACV,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,IAAI,IAAA,GAAO,CAAA;AAEX,EAAA,OAAO,IAAA,GAAO,MAAM,MAAA,EAAQ;AAC1B,IAAA,MAAM,IAAA,GAAO,MAAM,IAAI,CAAA;AACvB,IAAA,IAAA,EAAA;AACA,IAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AAEf,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA;AACjC,IAAA,IAAI,IAAA,EAAM;AACR,MAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,QAAA,MAAM,SAAA,GAAA,CAAa,QAAA,CAAS,GAAA,CAAI,GAAG,KAAK,CAAA,IAAK,CAAA;AAC7C,QAAA,QAAA,CAAS,GAAA,CAAI,KAAK,SAAS,CAAA;AAC3B,QAAA,IAAI,cAAc,CAAA,EAAG;AACnB,UAAA,KAAA,CAAM,KAAK,GAAG,CAAA;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,KAAA;AACT;;;ACvJO,SAAS,sBAAsB,MAAA,EAAwC;AAC5E,EAAA,MAAM,WAA+B,EAAC;AACtC,EAAA,MAAM,UAAA,GAAa,MAAA,CAAO,UAAA,IAAc,EAAC;AAEzC,EAAA,KAAA,MAAW,CAAC,SAAA,EAAW,WAAW,KAAK,MAAA,CAAO,OAAA,CAAQ,UAAU,CAAA,EAAG;AACjE,IAAA,MAAM,QAAA,GAAW,YAAY,WAAW,CAAA;AACxC,IAAA,IAAI,QAAA,EAAU;AACZ,MAAA,QAAA,CAAS,IAAA,CAAK;AAAA,QACZ,SAAA;AAAA,QACA,YAAY,QAAA,CAAS,UAAA;AAAA,QACrB,SAAA,EAAW,YAAY,IAAA,IAAQ;AAAA,OAChC,CAAA;AAAA,IACH;AAAA,EACF;AAEA,EAAA,OAAO,QAAA;AACT;;;ACnCA,SAAS,gBAAgB,MAAA,EAAiC;AACxD,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAY;AAC/B,EAAA,MAAM,UAAA,GAAa,MAAA,CAAO,UAAA,IAAc,EAAC;AAEzC,EAAA,KAAA,MAAW,SAAA,IAAa,MAAA,CAAO,IAAA,CAAK,UAAU,CAAA,EAAG;AAC/C,IAAA,MAAA,CAAO,IAAI,SAAS,CAAA;AAAA,EACtB;AAEA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,oBAAoB,MAAA,EAAgC;AAC3D,EAAA,MAAM,aAAyB,EAAC;AAChC,EAAA,MAAM,UAAA,GAAa,MAAA,CAAO,UAAA,IAAc,EAAC;AAEzC,EAAA,KAAA,MAAW,CAAC,SAAA,EAAW,WAAW,KAAK,MAAA,CAAO,OAAA,CAAQ,UAAU,CAAA,EAAG;AACjE,IAAA,MAAM,aAAa,WAAA,CAAY,IAAA;AAC/B,IAAA,IACE,UAAA,KAAe,YACf,UAAA,KAAe,QAAA,IACf,eAAe,SAAA,IACf,UAAA,KAAe,QAAA,IACf,UAAA,KAAe,OAAA,EACf;AACA,MAAA,UAAA,CAAW,SAAS,CAAA,GAAI,UAAA;AAAA,IAC1B;AAAA,EACF;AAEA,EAAA,OAAO,UAAA;AACT;AAEA,SAAS,qBACP,UAAA,EACqB;AACrB,EAAA,IAAI,UAAA,KAAe,UAAU,OAAO,QAAA;AACpC,EAAA,IAAI,UAAA,KAAe,UAAU,OAAO,QAAA;AACpC,EAAA,IAAI,UAAA,KAAe,WAAW,OAAO,SAAA;AACrC,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,gBAAA,CACP,cACA,YAAA,EACS;AACT,EAAA,IAAI,YAAA,KAAiB,MAAM,OAAO,IAAA;AAClC,EAAA,IAAI,YAAA,KAAiB,WAAW,OAAO,IAAA;AACvC,EAAA,OAAO,YAAA,KAAiB,YAAA;AAC1B;AAEA,SAAS,iBAAiB,UAAA,EAA4B;AACpD,EAAA,MAAM,IAAA,GAAO,UAAA,CAAW,KAAA,CAAM,GAAG,CAAA,CAAE,CAAC,CAAA,EAAG,KAAA,CAAM,GAAG,CAAA,CAAE,CAAC,CAAA;AACnD,EAAA,OAAO,IAAA,IAAQ,UAAA;AACjB;AAEO,SAAS,4BAAA,CACd,UAAA,EACA,SAAA,EACA,MAAA,EAC+B;AAC/B,EAAA,MAAM,YAAA,GAAe,sBAAsB,UAAU,CAAA;AACrD,EAAA,IAAI,CAAC,aAAa,OAAA,EAAS;AACzB,IAAA,OAAO;AAAA,MACL,KAAA,EAAO,SAAA;AAAA,MACP,OAAO,YAAA,CAAa,KAAA;AAAA,MACpB,UAAU,YAAA,CAAa;AAAA,KACzB;AAAA,EACF;AAEA,EAAA,MAAM,WAAA,GAAc,gBAAgB,UAAU,CAAA;AAC9C,EAAA,MAAM,YAAA,GAAe,gBAAgB,MAAM,CAAA;AAE3C,EAAA,KAAA,MAAW,GAAA,IAAO,YAAY,YAAA,EAAc;AAC1C,IAAA,MAAM,SAAA,GAAY,iBAAiB,GAAG,CAAA;AACtC,IAAA,IAAI,CAAC,YAAA,CAAa,GAAA,CAAI,SAAS,CAAA,EAAG;AAChC,MAAA,OAAO;AAAA,QACL,KAAA,EAAO,SAAA;AAAA,QACP,KAAA,EAAO,kBAAkB,SAAS,CAAA,YAAA;AAAA,OACpC;AAAA,IACF;AAAA,EACF;AAEA,EAAA,IAAI,WAAA,CAAY,aAAa,IAAA,CAAK,CAAC,MAAM,gBAAA,CAAiB,CAAC,CAAA,KAAM,SAAS,CAAA,EAAG;AAC3E,IAAA,OAAO;AAAA,MACL,KAAA,EAAO,SAAA;AAAA,MACP,KAAA,EAAO,CAAA,+BAAA;AAAA,KACT;AAAA,EACF;AAEA,EAAA,MAAM,WAAA,GAAc,MAAA,CAAO,UAAA,GAAa,SAAS,CAAA;AACjD,EAAA,MAAM,YAAA,GAAe,oBAAA,CAAqB,WAAA,EAAa,IAAI,CAAA;AAC3D,EAAA,MAAM,UAAA,GAAa,oBAAoB,MAAM,CAAA;AAC7C,EAAA,MAAM,YAAA,GAAe,gBAAA,CAAiB,UAAA,EAAY,UAAU,CAAA;AAE5D,EAAA,IAAI,CAAC,gBAAA,CAAiB,YAAA,EAAc,YAAY,CAAA,EAAG;AACjD,IAAA,OAAO;AAAA,MACL,KAAA,EAAO,SAAA;AAAA,MACP,KAAA,EAAO,CAAA,gCAAA,EAAmC,YAAY,CAAA,qBAAA,EAAwB,YAAY,CAAA,CAAA;AAAA,KAC5F;AAAA,EACF;AAEA,EAAA,OAAO,IAAA;AACT;AAEO,SAAS,uBACd,MAAA,EACwB;AACxB,EAAA,MAAM,SAAmC,EAAC;AAC1C,EAAA,MAAM,QAAA,GAAW,sBAAsB,MAAM,CAAA;AAE7C,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,MAAM,KAAA,GAAQ,4BAAA;AAAA,MACZ,OAAA,CAAQ,UAAA;AAAA,MACR,OAAA,CAAQ,SAAA;AAAA,MACR;AAAA,KACF;AACA,IAAA,IAAI,KAAA,EAAO;AACT,MAAA,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,IACnB;AAAA,EACF;AAEA,EAAA,IAAI,MAAA,CAAO,SAAS,CAAA,EAAG;AACrB,IAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,MAAA,EAAO;AAAA,EAClC;AAEA,EAAA,MAAM,eAAyC,EAAC;AAChD,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,MAAM,WAAA,GAAc,eAAA,CAAgB,OAAA,CAAQ,UAAU,CAAA;AACtD,IAAA,YAAA,CAAa,QAAQ,SAAS,CAAA,GAC5B,WAAA,CAAY,YAAA,CAAa,IAAI,gBAAgB,CAAA;AAAA,EACjD;AAEA,EAAA,MAAM,KAAA,GAAQ,qBAAqB,YAAY,CAAA;AAC/C,EAAA,MAAM,aAAA,GAAgB,2BAA2B,KAAK,CAAA;AAEtD,EAAA,MAAM,QAAQ,aAAA,CAAc,KAAA;AAC5B,EAAA,IAAI,aAAA,CAAc,WAAA,IAAe,KAAA,IAAS,KAAA,CAAM,SAAS,CAAA,EAAG;AAC1D,IAAA,MAAM,UAAA,GAAa,MAAM,CAAC,CAAA;AAC1B,IAAA,IAAI,UAAA,EAAY;AACd,MAAA,MAAA,CAAO,IAAA,CAAK;AAAA,QACV,KAAA,EAAO,UAAA;AAAA,QACP,KAAA,EAAO,CAAA,qBAAA,EAAwB,KAAA,CAAM,IAAA,CAAK,UAAK,CAAC,CAAA;AAAA,OACjD,CAAA;AACD,MAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,MAAA,EAAO;AAAA,IAClC;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,OAAA,EAAS,IAAA,EAAM,MAAA,EAAQ,EAAC,EAAE;AACrC","file":"chunk-5NMNSRHH.cjs","sourcesContent":["import { SPACE } from \"./const.js\"\n\n// current string, index and collected ids\nexport let idx, cur,\n\n  // no handling tagged literals since easily done on user side with cache, if needed\n  parse = s => (idx = 0, cur = s, s = expr(), cur[idx] ? err() : s || ''),\n\n  // display error with context\n  err = (msg = 'Unexpected token',\n    lines = cur.slice(0, idx).split('\\n'),\n    last = lines.pop(),\n    before = cur.slice(Math.max(0, idx - 40), idx),\n    after = cur.slice(idx, idx + 20)\n  ) => {\n    throw SyntaxError(`${msg} at ${lines.length + 1}:${last.length + 1} — ${before}^${after}`)\n  },\n\n  // advance until condition meets\n  next = (is, from = idx, l) => {\n    while (l = is(cur.charCodeAt(idx))) idx += l\n    return cur.slice(from, idx)\n  },\n\n  // advance n characters\n  skip = () => cur[idx++],\n\n  // a + b - c\n  expr = (prec = 0, end) => {\n    let cc, token, newNode, fn\n\n    // chunk/token parser\n    while (\n      (cc = space()) && // till not end\n      // NOTE: when lookup bails on lower precedence, parent expr re-calls space() — acceptable overhead\n      (newNode =\n        ((fn = lookup[cc]) && fn(token, prec)) ?? // if operator with higher precedence isn't found\n        (!token && next(parse.id)) // parse literal or quit. token seqs are forbidden: `a b`, `a \"b\"`, `1.32 a`\n      )\n    ) token = newNode;\n\n    // check end character\n    if (end) cc == end ? idx++ : err('Unclosed ' + String.fromCharCode(end - (end > 42 ? 2 : 1)))\n\n    return token\n  },\n\n  // skip space chars, return first non-space character\n  space = cc => { while ((cc = cur.charCodeAt(idx)) <= SPACE) idx++; return cc },\n\n  // parse identifier (configurable)\n  id = parse.id = c =>\n    (c >= 48 && c <= 57) || // 0..9\n    (c >= 65 && c <= 90) || // A...Z\n    (c >= 97 && c <= 122) || // a...z\n    c == 36 || c == 95 || // $, _,\n    (c >= 192 && c != 215 && c != 247), // any non-ASCII\n\n  // operator/token lookup table\n  // lookup[0] is id parser to let configs redefine it\n  lookup = [],\n\n\n  // create operator checker/mapper (see examples)\n  token = (\n    op,\n    prec = SPACE,\n    map,\n    c = op.charCodeAt(0),\n    l = op.length,\n    prev = lookup[c],\n    word = op.toUpperCase() !== op // make sure word boundary comes after word operator\n  ) => lookup[c] = (a, curPrec, curOp, from = idx) =>\n    (\n      (curOp ?\n        op == curOp :\n        ((l < 2 || cur.substr(idx, l) == op) && (curOp = op)) // save matched op to avoid mismatches like `|` as part of `||`\n      ) &&\n      curPrec < prec && // matches precedence AFTER operator matched\n      !(word && parse.id(cur.charCodeAt(idx + l))) && // finished word, not part of bigger word\n      (idx += l, map(a) || (idx = from, !prev && err())) // throw if operator didn't detect usage pattern: (a;^b) etc\n    ) ||\n    prev?.(a, curPrec, curOp),\n\n  // right assoc is indicated by negative precedence (meaning go from right to left)\n  binary = (op, prec, right = false) => token(op, prec, (a, b) => a && (b = expr(prec - (right ? .5 : 0))) && [op, a, b]),\n\n  // post indicates postfix rather than prefix operator\n  unary = (op, prec, post) => token(op, prec, a => post ? (a && [op, a]) : (!a && (a = expr(prec - .5)) && [op, a])),\n\n  // NOTE: allows ;;; (valid empty statements) and ,,, (debatable but harmless)\n  // right=true allows same-precedence tokens on RHS (like statements after semicolon)\n  nary = (op, prec, right) => {\n    token(op, prec,\n      (a, b) => (\n        b = expr(prec - (right ? .5 : 0)),\n        (\n          (a?.[0] !== op) && (a = [op, a || null]), // if beginning of sequence - init node\n          b?.[0] === op ? a.push(...b.slice(1)) : a.push(b || null), // comments can return same-token expr\n          a\n        ))\n    )\n  },\n\n  // register (a), [b], {c} etc groups\n  group = (op, prec) => token(op[0], prec, a => (!a && [op, expr(0, op.charCodeAt(1))])),\n\n  // register a(b), a[b], a<b> etc,\n  // NOTE: we make sure `null` indicates placeholder\n  access = (op, prec) => token(op[0], prec, a => (a && [op, a, expr(0, op.charCodeAt(1)) || null]))\n\n\nexport default parse\n","export const\n  PERIOD = 46,\n  OPAREN = 40,\n  CPAREN = 41,\n  OBRACK = 91,\n  CBRACK = 93,\n  OBRACE = 123,\n  CBRACE = 125,\n  SPACE = 32,\n  COLON = 58,\n  DQUOTE = 34,\n  QUOTE = 39,\n  _0 = 48,\n  _9 = 57,\n  _E = 69,\n  _e = 101,\n  BSLASH = 92,\n  SLASH = 47,\n  STAR = 42\n\n// ref: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Operator_precedence\n// we mult by 10 to leave space for extensions\nexport const\n  PREC_STATEMENT = 5,\n  PREC_SEQ = 10,\n  PREC_ASSIGN = 20,\n  PREC_LOR = 30,\n  PREC_LAND = 40,\n  PREC_OR = 50,\n  PREC_XOR = 60,\n  PREC_AND = 70,\n  PREC_EQ = 80,\n  PREC_COMP = 90,\n  PREC_SHIFT = 100,\n  PREC_ADD = 110,\n  PREC_MULT = 120,\n  PREC_EXP = 130,\n  PREC_PREFIX = 140,\n  PREC_POSTFIX = 150,\n  PREC_ACCESS = 170,\n  PREC_GROUP = 180,\n  PREC_TOKEN = 200\n\n// Block prototype chain attacks: constructor, prototype, __proto__, __defineGetter__, etc.\nexport const unsafe = k => k?.[0] === '_' && k[1] === '_' || k === 'constructor' || k === 'prototype'\n","import { lookup, next, err, skip } from \"../src/parse.js\"\nimport { cur, idx } from \"../src/parse.js\"\nimport { PERIOD, _0, _E, _e, _9 } from \"../src/const.js\"\n\n// Char codes for prefixes\nconst _b = 98, _B = 66, _o = 111, _O = 79, _x = 120, _X = 88\nconst _a = 97, _f = 102, _A = 65, _F = 70\n\n// parse decimal number (with optional exponent)\nconst num = (a, _) => [, (\n  a = +next(c => (c === PERIOD) || (c >= _0 && c <= _9) || (c === _E || c === _e ? 2 : 0))\n) != a ? err() : a]\n\n// .1\nlookup[PERIOD] = a => !a && num()\n\n// 1-9 (non-zero starts decimal)\nfor (let i = _0 + 1; i <= _9; i++) lookup[i] = a => a ? err() : num()\n\n// 0 - check for prefix (0b, 0o, 0x) or plain decimal\nlookup[_0] = a => {\n  if (a) return err()\n  const nextChar = cur.charCodeAt(idx + 1)\n  \n  // Binary: 0b\n  if (nextChar === _b || nextChar === _B) {\n    skip(); skip() // consume '0b'\n    const s = next(c => c === 48 || c === 49) // 0 or 1\n    return [, parseInt(s, 2)]\n  }\n  // Octal: 0o\n  if (nextChar === _o || nextChar === _O) {\n    skip(); skip() // consume '0o'\n    const s = next(c => c >= 48 && c <= 55) // 0-7\n    return [, parseInt(s, 8)]\n  }\n  // Hex: 0x\n  if (nextChar === _x || nextChar === _X) {\n    skip(); skip() // consume '0x'\n    const s = next(c => (c >= _0 && c <= _9) || (c >= _a && c <= _f) || (c >= _A && c <= _F))\n    return [, parseInt(s, 16)]\n  }\n  \n  return num()\n}\n","import { skip, err, next, cur, idx, lookup } from '../src/parse.js'\nimport { DQUOTE, QUOTE, BSLASH } from '../src/const.js'\n\nconst escape = { n: '\\n', r: '\\r', t: '\\t', b: '\\b', f: '\\f', v: '\\v' },\n  string = q => (qc, prec, str = '') => {\n    qc && err('Unexpected string') // must not follow another token\n    skip()\n    // while (c = cur.charCodeAt(idx), c - q) {\n    //   if (c === BSLASH) skip(), c = cur[idx], skip(), str += escape[c] || c\n    //   else str += cur[idx], skip()\n    // }\n    next(c => c - q && (c === BSLASH ? (str += escape[cur[idx+1]] || cur[idx+1], 2 ) : (str += cur[idx], 1)))\n    skip() || err('Bad string')\n    return [, str]\n  }\n\n\n// \"' with /\nlookup[DQUOTE] = string(DQUOTE)\nlookup[QUOTE] = string(QUOTE)\n","import { err } from \"./parse.js\"\n\n// build optimized evaluator for the tree\nexport const compile = (node) => !Array.isArray(node) ? compile.id(node) : !node[0] ? () => node[1] : operators[node[0]].call(...node),\n  // compile id getter\n  id = compile.id = name => ctx => ctx?.[name],\n\n  // registered operators\n  operators = {},\n\n  // register an operator\n  operator = (op, fn, prev = operators[op]) => (operators[op] = (...args) => fn(...args) || prev?.(...args)),\n\n  // takes node and returns evaluator depending on the case with passed params (container, path, ctx) =>\n  prop = (a, fn, generic, obj, path) => (\n    // (((x))) => x\n    a[0] === '()' && a.length == 2 ? prop(a[1], fn, generic) :\n      // (_, name, ctx) => ctx[path]\n      typeof a === 'string' ? ctx => fn(ctx, a, ctx) :\n        // (container, path, ctx) => container(ctx)[path]\n        a[0] === '.' ? (obj = compile(a[1]), path = a[2], ctx => fn(obj(ctx), path, ctx)) :\n          // (container, path, ctx) => container(ctx)[path(ctx)]\n          a[0] === '[]' && a.length === 3 ? (obj = compile(a[1]), path = compile(a[2]), ctx => fn(obj(ctx), path(ctx), ctx)) :\n            // (src, _, ctx) => src(ctx)\n            generic ? (a = compile(a), ctx => fn([a(ctx)], 0, ctx)) : () => err('Bad left value')\n  )\n\nexport default compile\n","import { access } from '../src/parse.js'\nimport { operator, compile, prop } from '../src/compile.js'\nimport { PREC_ACCESS } from '../src/const.js'\n\n// a(b,c,d), a()\naccess('()', PREC_ACCESS)\noperator('()', (a, b, args) => b !== undefined && (\n  args = !b ? () => [] : // a()\n    b[0] === ',' ? (b = b.slice(1).map(b => !b ? err() : compile(b)), ctx => b.map(arg => arg(ctx))) : // a(b,c)\n      (b = compile(b), ctx => [b(ctx)]), // a(b)\n\n  // a(...args), a.b(...args), a[b](...args)\n  prop(a, (obj, path, ctx) => obj[path](...args(ctx)), true)\n)\n)\n","import { access, binary, group, err } from '../src/parse.js'\nimport { operator, compile } from '../src/compile.js'\nimport { PREC_ACCESS, unsafe } from '../src/const.js'\n\n// a[b]\naccess('[]', PREC_ACCESS)\noperator('[]', (a, b) => !b ? err() : (a = compile(a), b = compile(b), ctx => { const k = b(ctx); return unsafe(k) ? undefined : a(ctx)[k] }))\n\n// a.b\nbinary('.', PREC_ACCESS)\noperator('.', (a, b) => (a = compile(a), b = !b[0] ? b[1] : b, unsafe(b) ? () => undefined : ctx => a(ctx)[b]))\n","import { err, nary, group } from '../src/parse.js'\nimport { compile, operator } from '../src/compile.js'\nimport { PREC_ACCESS, PREC_GROUP, PREC_SEQ, PREC_STATEMENT } from '../src/const.js'\n\n// (a,b,c), (a) — uses PREC_ACCESS to avoid conflict with ?.\ngroup('()', PREC_ACCESS)\noperator('()', (a, b) => b === undefined && (!a && err('Empty ()'), compile(a)))\n\nconst last = (...args) => (args = args.map(compile), ctx => args.map(arg => arg(ctx)).pop())\nnary(',', PREC_SEQ), operator(',', last)\nnary(';', PREC_STATEMENT, true), operator(';', last)\n","import { binary, err } from \"../src/parse.js\";\nimport { compile, operator, operators, prop } from \"../src/compile.js\";\nimport { PREC_ASSIGN } from \"../src/const.js\";\n\n// assignments\nbinary('=', PREC_ASSIGN, true)\noperator('=', (a, b) => (\n  b = compile(b),\n  // a = x, ((a)) = x, a.b = x, a['b'] = x\n  prop(a, (container, path, ctx) => container[path] = b(ctx))\n))\n","import { binary } from '../src/parse.js'\nimport { operator, compile, prop } from '../src/compile.js'\nimport { PREC_MULT, PREC_ASSIGN } from '../src/const.js'\n\nbinary('*', PREC_MULT), operator('*', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) * b(ctx)))\nbinary('/', PREC_MULT), operator('/', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) / b(ctx)))\nbinary('%', PREC_MULT), operator('%', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) % b(ctx)))\n\nbinary('*=', PREC_ASSIGN, true)\noperator('*=', (a, b) => (\n  b = compile(b),\n  prop(a, (container, path, ctx) => container[path] *= b(ctx))\n))\n\nbinary('/=', PREC_ASSIGN, true)\noperator('/=', (a, b) => (\n  b = compile(b),\n  prop(a, (container, path, ctx) => container[path] /= b(ctx))\n))\n\nbinary('%=', PREC_ASSIGN, true)\noperator('%=', (a, b) => (\n  b = compile(b),\n  prop(a, (container, path, ctx) => container[path] %= b(ctx))\n))\n","\nimport { binary, unary } from '../src/parse.js'\nimport { PREC_ADD, PREC_PREFIX, PREC_ASSIGN } from '../src/const.js'\nimport { compile, prop, operator } from '../src/compile.js'\n\nbinary('+', PREC_ADD), operator('+', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) + b(ctx)))\nbinary('-', PREC_ADD), operator('-', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) - b(ctx)))\n\nunary('+', PREC_PREFIX), operator('+', (a, b) => !b && (a = compile(a), ctx => +a(ctx)))\nunary('-', PREC_PREFIX), operator('-', (a, b) => !b && (a = compile(a), ctx => -a(ctx)))\n\nbinary('+=', PREC_ASSIGN, true)\noperator('+=', (a, b) => (\n  b = compile(b),\n  prop(a, (container, path, ctx) => container[path] += b(ctx))\n))\n\nbinary('-=', PREC_ASSIGN, true)\noperator('-=', (a, b) => (\n  b = compile(b),\n  prop(a, (container, path, ctx) => (container[path] -= b(ctx)))\n))\n","import { token, expr } from \"../src/parse.js\"\nimport { operator, compile, prop } from \"../src/compile.js\"\nimport { PREC_POSTFIX } from \"../src/const.js\"\n\ntoken('++', PREC_POSTFIX, a => a ? ['++', a, null,] : ['++', expr(PREC_POSTFIX - 1)])\n// ++a, ++((a)), ++a.b, ++a[b]\noperator('++', (a,b) => prop(a, b === null ? (obj, path) => obj[path]++ : (obj, path) => ++obj[path]))\n\ntoken('--', PREC_POSTFIX, a => a ? ['--', a, null,] : ['--', expr(PREC_POSTFIX - 1)])\n// --a, --a.b, --a[b]\noperator('--', (a, b) => prop(a, b === null ? (obj, path) => obj[path]-- : (obj, path) => --obj[path]))\n","import { PREC_OR, PREC_AND, PREC_SHIFT, PREC_XOR, PREC_PREFIX } from \"../src/const.js\"\nimport { unary, binary } from \"../src/parse.js\"\nimport { operator, compile } from \"../src/compile.js\"\n\nunary('~', PREC_PREFIX), operator('~', (a, b) => !b && (a = compile(a), ctx => ~a(ctx)))\n\nbinary('|', PREC_OR), operator('|', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) | b(ctx)))\n\nbinary('&', PREC_AND), operator('&', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) & b(ctx)))\n\nbinary('^', PREC_XOR), operator('^', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) ^ b(ctx)))\n","import { PREC_LOR, PREC_LAND, PREC_PREFIX, PREC_ASSIGN } from '../src/const.js';\nimport { unary, binary } from \"../src/parse.js\"\nimport { operator, compile } from \"../src/compile.js\"\n\nunary('!', PREC_PREFIX), operator('!', (a, b) => !b && (a = compile(a), ctx => !a(ctx)))\n\nbinary('||', PREC_LOR)\noperator('||', (a, b) => (a = compile(a), b = compile(b), ctx => a(ctx) || b(ctx)))\n\nbinary('&&', PREC_LAND)\noperator('&&', (a, b) => (a = compile(a), b = compile(b), ctx => a(ctx) && b(ctx)))\n","import { PREC_EQ, PREC_COMP } from '../src/const.js'\nimport { unary, binary } from \"../src/parse.js\"\nimport { operator, compile } from \"../src/compile.js\"\n\n\nbinary('==', PREC_EQ), operator('==', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) == b(ctx)))\nbinary('!=', PREC_EQ), operator('!=', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) != b(ctx)))\nbinary('>', PREC_COMP), operator('>', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) > b(ctx)))\nbinary('<', PREC_COMP), operator('<', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) < b(ctx)))\nbinary('>=', PREC_COMP), operator('>=', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) >= b(ctx)))\nbinary('<=', PREC_COMP), operator('<=', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) <= b(ctx)))\n","import { PREC_OR, PREC_AND, PREC_SHIFT, PREC_XOR, PREC_PREFIX, PREC_ASSIGN } from \"../src/const.js\"\nimport { unary, binary } from \"../src/parse.js\"\nimport { operator, compile } from \"../src/compile.js\"\n\n\nbinary('>>', PREC_SHIFT), operator('>>', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) >> b(ctx)))\nbinary('<<', PREC_SHIFT), operator('<<', (a, b) => b && (a = compile(a), b = compile(b), ctx => a(ctx) << b(ctx)))\n\nbinary('>>=', PREC_ASSIGN, true)\noperator('>>=', (a, b) => (b = compile(b), prop(a, (obj, path, ctx) => (obj[path] >>= b(ctx)))))\nbinary('<<=', PREC_ASSIGN, true)\noperator('<<=', (a, b) => (b = compile(b), prop(a, (obj, path, ctx) => (obj[path] <<= b(ctx)))))\n","/**\n * Subscript dialect includes common operators / primitives for all languages\n */\nimport './feature/number.js'\nimport './feature/string.js'\nimport './feature/call.js'\nimport './feature/access.js'\nimport './feature/group.js'\nimport './feature/assign.js'\nimport './feature/mult.js'\nimport './feature/add.js'\nimport './feature/increment.js'\nimport './feature/bitwise.js'\nimport './feature/logic.js'\nimport './feature/compare.js'\nimport './feature/shift.js'\nimport compile from './src/compile.js'\nimport parse from './src/parse.js'\n\nexport { parse, access, binary, unary, nary, group, token } from './src/parse.js'\nexport { compile, operator } from './src/compile.js'\nexport { stringify } from './src/stringify.js'\n\nexport default s => compile(parse(s))\n","import subscript, { parse, token } from 'subscript';\nimport { FormulaFeature, FormulaMinorVersion } from './types';\n\n// eslint-disable-next-line @typescript-eslint/ban-ts-comment\n// @ts-ignore - subscript internal module\nimport * as parseModule from 'subscript/src/parse.js';\n\nconst { next } = parseModule as { next: (fn: (c: number) => number) => string };\n\n// Helper for identifier chars - returns 1 if valid, 0 otherwise\nconst isIdChar = (c: number): number =>\n  (c >= 97 && c <= 122) || // a-z\n  (c >= 65 && c <= 90) || // A-Z\n  (c >= 48 && c <= 57) || // 0-9\n  c === 95 // _\n    ? 1\n    : 0;\n\n// Register @ for context tokens (@prev, @next, @current)\ntoken('@', 200, (a: unknown) => {\n  if (a) return; // must not follow another token\n  const name = next(isIdChar);\n  if (!name) return;\n  return '@' + name;\n});\n\n// Register # for position tokens (#index, #first, #last, #length)\ntoken('#', 200, (a: unknown) => {\n  if (a) return;\n  const name = next(isIdChar);\n  if (!name) return;\n  return '#' + name;\n});\n\n// Create sparse array literal for wildcard: [, '*'] means literal value '*'\nconst createWildcardLiteral = (): unknown[] => {\n  const arr: unknown[] = [];\n  arr[1] = '*';\n  return arr;\n};\n\n// Register * as wildcard when standalone (inside [])\ntoken('*', 200, (a: unknown) => {\n  if (!a) return createWildcardLiteral();\n  return undefined;\n});\n\nexport type ASTNode = string | number | boolean | null | [string, ...ASTNode[]];\n\nconst KEYWORDS = new Set([\n  'true',\n  'false',\n  'null',\n  'and',\n  'or',\n  'not',\n  'if',\n  'constructor',\n  '__proto__',\n  'prototype',\n  'round',\n  'floor',\n  'ceil',\n  'abs',\n  'sqrt',\n  'pow',\n  'min',\n  'max',\n  'log',\n  'log10',\n  'exp',\n  'sign',\n  'concat',\n  'upper',\n  'lower',\n  'length',\n  'trim',\n  'left',\n  'right',\n  'replace',\n  'contains',\n  'startswith',\n  'endswith',\n  'tostring',\n  'tonumber',\n  'toboolean',\n  'isnull',\n  'coalesce',\n  'sum',\n  'avg',\n  'count',\n  'first',\n  'last',\n  'join',\n  'filter',\n  'map',\n  'includes',\n]);\n\nconst ARRAY_FUNCTIONS = new Set([\n  'sum',\n  'avg',\n  'count',\n  'first',\n  'last',\n  'join',\n  'filter',\n  'map',\n  'includes',\n]);\n\nexport interface ParseResult {\n  ast: ASTNode;\n  dependencies: string[];\n  features: FormulaFeature[];\n  minVersion: FormulaMinorVersion;\n}\n\nfunction isKeyword(name: string): boolean {\n  return KEYWORDS.has(name.toLowerCase());\n}\n\nfunction isArrayFunction(name: string): boolean {\n  return ARRAY_FUNCTIONS.has(name.toLowerCase());\n}\n\nfunction isContextToken(name: string): boolean {\n  return name.startsWith('@') || name.startsWith('#');\n}\n\nfunction isValidIdentifierRoot(rootName: string): boolean {\n  return !isKeyword(rootName) && !isContextToken(rootName);\n}\n\nfunction extractRootName(path: string): string {\n  return path.split('.')[0]?.split('[')[0] ?? '';\n}\n\nfunction addPathIfValid(path: string | null, identifiers: Set<string>): void {\n  if (path && isValidIdentifierRoot(extractRootName(path))) {\n    identifiers.add(path);\n  }\n}\n\nfunction collectStringIdentifier(node: string, identifiers: Set<string>): void {\n  if (!isContextToken(node) && !isKeyword(node)) {\n    identifiers.add(node);\n  }\n}\n\nfunction collectFunctionCallIdentifiers(\n  args: ASTNode[],\n  identifiers: Set<string>,\n): void {\n  for (let i = 1; i < args.length; i++) {\n    collectIdentifiers(args[i] as ASTNode, identifiers);\n  }\n  const funcName = args[0];\n  if (typeof funcName !== 'string') {\n    collectIdentifiers(funcName as ASTNode, identifiers);\n  }\n}\n\nfunction collectPathOrFallback(node: ASTNode, identifiers: Set<string>): void {\n  const path = buildDotPath(node);\n  if (path) {\n    addPathIfValid(path, identifiers);\n  } else {\n    const [, ...args] = node as [string, ...ASTNode[]];\n    for (const arg of args) {\n      collectIdentifiers(arg, identifiers);\n    }\n  }\n}\n\nfunction collectIdentifiers(node: ASTNode, identifiers: Set<string>): void {\n  if (typeof node === 'string') {\n    collectStringIdentifier(node, identifiers);\n    return;\n  }\n\n  if (!Array.isArray(node)) {\n    return;\n  }\n\n  const [op, ...args] = node;\n\n  if (op === '.' || op === '[]') {\n    collectPathOrFallback(node, identifiers);\n    return;\n  }\n\n  if (op === '()') {\n    collectFunctionCallIdentifiers(args, identifiers);\n    return;\n  }\n\n  for (const arg of args) {\n    collectIdentifiers(arg, identifiers);\n  }\n}\n\nfunction isLiteralArray(arr: unknown[]): boolean {\n  return !(0 in arr);\n}\n\nfunction buildPropertyAccessPath(left: ASTNode, right: ASTNode): string | null {\n  const leftPath = buildDotPath(left);\n  const rightPath = typeof right === 'string' ? right : null;\n  if (leftPath && rightPath) {\n    return `${leftPath}.${rightPath}`;\n  }\n  return null;\n}\n\nfunction getNegativeIndexValue(index: unknown): number | null {\n  if (!Array.isArray(index) || index[0] !== '-' || index.length !== 2) {\n    return null;\n  }\n  const inner: unknown = index[1];\n  if (\n    Array.isArray(inner) &&\n    isLiteralArray(inner) &&\n    typeof inner[1] === 'number'\n  ) {\n    return -inner[1];\n  }\n  return null;\n}\n\nfunction buildArrayAccessPath(left: ASTNode, right: ASTNode): string | null {\n  const leftPath = buildDotPath(left);\n  if (!leftPath) {\n    return null;\n  }\n\n  if (Array.isArray(right) && isLiteralArray(right)) {\n    if (right[1] === '*') {\n      return `${leftPath}[*]`;\n    }\n    if (typeof right[1] === 'number') {\n      return `${leftPath}[${right[1]}]`;\n    }\n  }\n\n  const negativeIndex = getNegativeIndexValue(right);\n  if (negativeIndex !== null) {\n    return `${leftPath}[${negativeIndex}]`;\n  }\n\n  const rightPath = buildDotPath(right);\n  if (rightPath) {\n    return `${leftPath}[${rightPath}]`;\n  }\n  return null;\n}\n\nfunction buildDotPath(node: ASTNode): string | null {\n  if (typeof node === 'string') {\n    return node;\n  }\n\n  if (!Array.isArray(node) || isLiteralArray(node)) {\n    return null;\n  }\n\n  const [op, left, right] = node;\n\n  if (op === '.') {\n    return buildPropertyAccessPath(left as ASTNode, right as ASTNode);\n  }\n\n  if (op === '[]') {\n    return buildArrayAccessPath(left as ASTNode, right as ASTNode);\n  }\n\n  return null;\n}\n\nfunction isNegativeIndexLiteral(index: unknown): boolean {\n  if (!Array.isArray(index) || index[0] !== '-' || index.length !== 2) {\n    return false;\n  }\n  const inner: unknown = index[1];\n  return (\n    Array.isArray(inner) &&\n    isLiteralArray(inner) &&\n    typeof inner[1] === 'number'\n  );\n}\n\nfunction detectArrayAccessFeatures(\n  index: ASTNode,\n  features: Set<FormulaFeature>,\n): void {\n  if (Array.isArray(index) && isLiteralArray(index)) {\n    if (index[1] === '*') {\n      features.add('array_wildcard');\n    } else if (typeof index[1] === 'number') {\n      features.add('array_index');\n    }\n  }\n  if (isNegativeIndexLiteral(index)) {\n    features.add('array_index');\n  }\n}\n\nfunction detectFunctionCallFeatures(\n  funcName: ASTNode,\n  features: Set<FormulaFeature>,\n): void {\n  if (typeof funcName === 'string' && isArrayFunction(funcName)) {\n    features.add('array_function');\n  }\n}\n\nfunction detectFeatures(node: ASTNode, features: Set<FormulaFeature>): void {\n  if (typeof node === 'string') {\n    if (isContextToken(node)) {\n      features.add('context_token');\n    }\n    return;\n  }\n\n  if (!Array.isArray(node) || isLiteralArray(node)) {\n    return;\n  }\n\n  const op = node[0];\n\n  if (op === '.') {\n    features.add('nested_path');\n  }\n\n  if (op === '[]') {\n    detectArrayAccessFeatures(node[2] as ASTNode, features);\n  }\n\n  if (op === '()') {\n    detectFunctionCallFeatures(node[1] as ASTNode, features);\n  }\n\n  for (let i = 1; i < node.length; i++) {\n    detectFeatures(node[i] as ASTNode, features);\n  }\n}\n\nexport function parseFormula(expression: string): ParseResult {\n  const trimmed = expression.trim();\n  if (!trimmed) {\n    throw new Error('Empty expression');\n  }\n\n  const ast = parse(trimmed) as ASTNode;\n\n  const identifiers = new Set<string>();\n  collectIdentifiers(ast, identifiers);\n\n  const featuresSet = new Set<FormulaFeature>();\n  detectFeatures(ast, featuresSet);\n\n  const features = Array.from(featuresSet);\n  const minVersion: FormulaMinorVersion = features.length > 0 ? '1.1' : '1.0';\n\n  return {\n    ast,\n    dependencies: Array.from(identifiers),\n    features,\n    minVersion,\n  };\n}\n\nexport function validateSyntax(\n  expression: string,\n): { isValid: true } | { isValid: false; error: string; position?: number } {\n  const trimmed = expression.trim();\n\n  if (!trimmed) {\n    return { isValid: false, error: 'Empty expression' };\n  }\n\n  try {\n    parse(trimmed);\n    return { isValid: true };\n  } catch (e) {\n    const error = e as Error;\n    const match = /at (\\d+):(\\d+)/.exec(error.message);\n    const position = match\n      ? Number.parseInt(match[2] ?? '0', 10) - 1\n      : undefined;\n    return {\n      isValid: false,\n      error: error.message,\n      position,\n    };\n  }\n}\n\nexport function evaluate(\n  expression: string,\n  context: Record<string, unknown>,\n): unknown {\n  const trimmed = expression.trim();\n  if (!trimmed) {\n    throw new Error('Empty expression');\n  }\n  const fn = subscript(trimmed);\n  return fn(context);\n}\n\n/**\n * Inferred type of a formula expression\n */\nexport type InferredType = 'number' | 'boolean' | 'string' | 'unknown';\n\n/**\n * Schema field types for type inference\n */\nexport interface FieldTypes {\n  [fieldName: string]: 'number' | 'string' | 'boolean' | 'object' | 'array';\n}\n\nconst ARITHMETIC_OPS = new Set(['+', '-', '*', '/', '%']);\nconst COMPARISON_OPS = new Set([\n  '<',\n  '>',\n  '<=',\n  '>=',\n  '==',\n  '!=',\n  '===',\n  '!==',\n]);\nconst LOGICAL_OPS = new Set(['&&', '||', '!', 'and', 'or', 'not']);\nconst NUMERIC_FUNCTIONS = new Set([\n  'round',\n  'floor',\n  'ceil',\n  'abs',\n  'sqrt',\n  'pow',\n  'min',\n  'max',\n  'log',\n  'log10',\n  'exp',\n  'sign',\n  'sum',\n  'avg',\n  'count',\n  'tonumber',\n]);\nconst STRING_FUNCTIONS = new Set([\n  'concat',\n  'upper',\n  'lower',\n  'trim',\n  'left',\n  'right',\n  'replace',\n  'tostring',\n  'join',\n]);\nconst BOOLEAN_FUNCTIONS = new Set([\n  'contains',\n  'startswith',\n  'endswith',\n  'isnull',\n  'toboolean',\n  'includes',\n]);\n\nfunction getFieldType(path: string, fieldTypes: FieldTypes): InferredType {\n  const rootField = path.split('.')[0]?.split('[')[0] || path;\n  const schemaType = fieldTypes[rootField];\n  if (schemaType === 'number') return 'number';\n  if (schemaType === 'string') return 'string';\n  if (schemaType === 'boolean') return 'boolean';\n  return 'unknown';\n}\n\nfunction inferPrimitiveType(\n  node: ASTNode,\n  fieldTypes: FieldTypes,\n): InferredType | null {\n  if (typeof node === 'number') return 'number';\n  if (typeof node === 'boolean') return 'boolean';\n  if (typeof node === 'string') return getFieldType(node, fieldTypes);\n  if (node === null) return 'unknown';\n  return null;\n}\n\nfunction inferLiteralArrayType(node: unknown[]): InferredType {\n  const val = node[1];\n  if (typeof val === 'number') return 'number';\n  if (typeof val === 'string') return 'string';\n  if (typeof val === 'boolean') return 'boolean';\n  return 'unknown';\n}\n\nfunction inferOperatorType(\n  op: string,\n  argsLength: number,\n): InferredType | null {\n  if (ARITHMETIC_OPS.has(op)) return 'number';\n  if (COMPARISON_OPS.has(op)) return 'boolean';\n  if (LOGICAL_OPS.has(op)) return 'boolean';\n  if (op === '-' && argsLength === 1) return 'number';\n  return null;\n}\n\nfunction inferPropertyAccessType(\n  node: ASTNode,\n  fieldTypes: FieldTypes,\n): InferredType {\n  const path = buildDotPath(node);\n  return path ? getFieldType(path, fieldTypes) : 'unknown';\n}\n\nfunction inferFunctionCallType(funcName: ASTNode): InferredType {\n  if (typeof funcName !== 'string') return 'unknown';\n  const lowerName = funcName.toLowerCase();\n  if (NUMERIC_FUNCTIONS.has(lowerName)) return 'number';\n  if (STRING_FUNCTIONS.has(lowerName)) return 'string';\n  if (BOOLEAN_FUNCTIONS.has(lowerName)) return 'boolean';\n  return 'unknown';\n}\n\nfunction inferTypeFromNode(\n  node: ASTNode,\n  fieldTypes: FieldTypes,\n): InferredType {\n  const primitiveType = inferPrimitiveType(node, fieldTypes);\n  if (primitiveType !== null) return primitiveType;\n\n  if (!Array.isArray(node)) return 'unknown';\n  if (isLiteralArray(node)) return inferLiteralArrayType(node);\n\n  const [op, ...args] = node;\n\n  const operatorType = inferOperatorType(op, args.length);\n  if (operatorType !== null) return operatorType;\n\n  if (op === '.' || op === '[]') {\n    return inferPropertyAccessType(node, fieldTypes);\n  }\n\n  if (op === '()') {\n    return inferFunctionCallType(args[0] as ASTNode);\n  }\n\n  return 'unknown';\n}\n\n/**\n * Infer the return type of a formula expression\n *\n * @param expression - Formula expression string\n * @param fieldTypes - Map of field names to their types from schema\n * @returns Inferred type of the expression result\n *\n * @example\n * inferFormulaType('price * quantity', { price: 'number', quantity: 'number' })\n * // 'number'\n *\n * inferFormulaType('price > 100', { price: 'number' })\n * // 'boolean'\n *\n * inferFormulaType('name', { name: 'string' })\n * // 'string'\n */\nexport function inferFormulaType(\n  expression: string,\n  fieldTypes: FieldTypes = {},\n): InferredType {\n  const trimmed = expression.trim();\n  if (!trimmed) {\n    return 'unknown';\n  }\n\n  try {\n    const ast = parse(trimmed) as ASTNode;\n    return inferTypeFromNode(ast, fieldTypes);\n  } catch {\n    return 'unknown';\n  }\n}\n\nexport { parse, compile } from 'subscript';\n","import { FormulaFeature, FormulaMinorVersion } from './types';\nimport { parseFormula } from './parser';\n\nexport interface ParsedExpression {\n  expression: string;\n  dependencies: string[];\n  minVersion: FormulaMinorVersion;\n  features: FormulaFeature[];\n}\n\n/**\n * Parse a formula expression string\n *\n * @param expression - Formula expression string\n * @returns Parsed expression with dependencies and version info\n *\n * @example\n * parseExpression('price * 1.1')\n * // { expression: 'price * 1.1', dependencies: ['price'], minVersion: '1.0', features: [] }\n *\n * parseExpression('stats.damage * multiplier')\n * // { expression: '...', dependencies: ['stats.damage', 'multiplier'], minVersion: '1.1', features: ['nested_path'] }\n */\nexport function parseExpression(expression: string): ParsedExpression {\n  const result = parseFormula(expression);\n  return {\n    expression,\n    dependencies: result.dependencies,\n    minVersion: result.minVersion,\n    features: result.features,\n  };\n}\n","import { validateSyntax } from './parser';\n\nexport type SyntaxValidationResult =\n  | { isValid: true }\n  | { isValid: false; error: string; position?: number };\n\n/**\n * Validate formula expression syntax\n *\n * @param expression - Formula expression string\n * @returns Validation result with error details if invalid\n *\n * @example\n * validateFormulaSyntax('price * 1.1')\n * // { isValid: true }\n *\n * validateFormulaSyntax('price * (1.1')\n * // { isValid: false, error: 'Unclosed (', position: 8 }\n */\nexport function validateFormulaSyntax(\n  expression: string,\n): SyntaxValidationResult {\n  const result = validateSyntax(expression);\n\n  if (result.isValid) {\n    return { isValid: true };\n  }\n\n  return {\n    isValid: false,\n    error: result.error,\n    position: result.position,\n  };\n}\n","export interface DependencyGraph {\n  nodes: Set<string>;\n  edges: Map<string, Set<string>>;\n}\n\nexport interface CircularDependencyResult {\n  hasCircular: boolean;\n  cycle: string[] | null;\n}\n\nexport interface TopologicalOrderResult {\n  success: boolean;\n  order: string[];\n  error?: string;\n}\n\n/**\n * Build a dependency graph from a dependencies map\n *\n * @param dependencies - Map of node names to their dependencies\n * @returns Dependency graph with nodes and edges\n *\n * @example\n * const graph = buildDependencyGraph({\n *   tax: ['price'],\n *   total: ['price', 'tax']\n * });\n * // graph.edges.get('tax') = Set(['price'])\n * // graph.edges.get('total') = Set(['price', 'tax'])\n */\nexport function buildDependencyGraph(\n  dependencies: Record<string, string[]>,\n): DependencyGraph {\n  const nodes = new Set<string>();\n  const edges = new Map<string, Set<string>>();\n\n  for (const [node, deps] of Object.entries(dependencies)) {\n    nodes.add(node);\n    edges.set(node, new Set(deps));\n\n    for (const dep of deps) {\n      nodes.add(dep);\n    }\n  }\n\n  return { nodes, edges };\n}\n\n/**\n * Detect first circular dependency in a dependency graph\n *\n * @param graph - Dependency graph\n * @returns Result with detected cycle (null if no cycle)\n *\n * @example\n * detectCircularDependencies(graph)\n * // { hasCircular: true, cycle: ['a', 'b', 'c', 'a'] }\n */\nexport function detectCircularDependencies(\n  graph: DependencyGraph,\n): CircularDependencyResult {\n  const visited = new Set<string>();\n  const recursionStack = new Set<string>();\n  const path: string[] = [];\n\n  for (const node of graph.nodes) {\n    if (!visited.has(node)) {\n      const cycle = dfsVisit(node, graph, visited, recursionStack, path);\n      if (cycle) {\n        return { hasCircular: true, cycle };\n      }\n    }\n  }\n\n  return { hasCircular: false, cycle: null };\n}\n\nfunction dfsVisit(\n  node: string,\n  graph: DependencyGraph,\n  visited: Set<string>,\n  recursionStack: Set<string>,\n  path: string[],\n): string[] | null {\n  visited.add(node);\n  recursionStack.add(node);\n  path.push(node);\n\n  const deps = graph.edges.get(node);\n  if (deps) {\n    for (const dep of deps) {\n      if (!visited.has(dep)) {\n        const cycle = dfsVisit(dep, graph, visited, recursionStack, path);\n        if (cycle) {\n          return cycle;\n        }\n      } else if (recursionStack.has(dep)) {\n        const cycleStart = path.indexOf(dep);\n        return [...path.slice(cycleStart), dep];\n      }\n    }\n  }\n\n  path.pop();\n  recursionStack.delete(node);\n  return null;\n}\n\n/**\n * Get topological order for formula evaluation\n *\n * @param graph - Dependency graph\n * @returns Ordered list of field names for evaluation\n *\n * @example\n * getTopologicalOrder(graph)\n * // { success: true, order: ['price', 'tax', 'total'] }\n */\nexport function getTopologicalOrder(\n  graph: DependencyGraph,\n): TopologicalOrderResult {\n  const circularCheck = detectCircularDependencies(graph);\n  if (circularCheck.hasCircular && circularCheck.cycle) {\n    return {\n      success: false,\n      order: [],\n      error: `Circular dependency detected: ${circularCheck.cycle.join(' -> ')}`,\n    };\n  }\n\n  const inDegree = initializeInDegree(graph);\n  const queue = findZeroInDegreeNodes(inDegree);\n  const order = processQueue(queue, graph, inDegree);\n\n  order.reverse();\n  return { success: true, order };\n}\n\nfunction initializeInDegree(graph: DependencyGraph): Map<string, number> {\n  const inDegree = new Map<string, number>();\n\n  for (const node of graph.nodes) {\n    inDegree.set(node, 0);\n  }\n\n  for (const deps of graph.edges.values()) {\n    for (const dep of deps) {\n      inDegree.set(dep, (inDegree.get(dep) ?? 0) + 1);\n    }\n  }\n\n  return inDegree;\n}\n\nfunction findZeroInDegreeNodes(inDegree: Map<string, number>): string[] {\n  const result: string[] = [];\n  for (const [node, degree] of inDegree) {\n    if (degree === 0) {\n      result.push(node);\n    }\n  }\n  return result;\n}\n\nfunction processQueue(\n  queue: string[],\n  graph: DependencyGraph,\n  inDegree: Map<string, number>,\n): string[] {\n  const order: string[] = [];\n  let head = 0;\n\n  while (head < queue.length) {\n    const node = queue[head]!;\n    head++;\n    order.push(node);\n\n    const deps = graph.edges.get(node);\n    if (deps) {\n      for (const dep of deps) {\n        const newDegree = (inDegree.get(dep) ?? 0) - 1;\n        inDegree.set(dep, newDegree);\n        if (newDegree === 0) {\n          queue.push(dep);\n        }\n      }\n    }\n  }\n\n  return order;\n}\n","interface XFormulaInput {\n  version: number;\n  expression: string;\n}\n\ninterface SchemaProperty {\n  type?: string;\n  'x-formula'?: XFormulaInput;\n  [key: string]: unknown;\n}\n\nexport interface JsonSchema {\n  type?: string;\n  properties?: Record<string, SchemaProperty>;\n  [key: string]: unknown;\n}\n\nexport interface ExtractedFormula {\n  fieldName: string;\n  expression: string;\n  fieldType: string;\n}\n\n/**\n * Extract formula definitions from a JSON Schema\n *\n * @param schema - JSON Schema object with properties\n * @returns Array of extracted formulas with field names and expressions\n *\n * @example\n * extractSchemaFormulas({\n *   type: 'object',\n *   properties: {\n *     price: { type: 'number' },\n *     tax: { type: 'number', 'x-formula': { version: 1, expression: 'price * 0.1' } }\n *   }\n * });\n * // [{ fieldName: 'tax', expression: 'price * 0.1', fieldType: 'number' }]\n */\nexport function extractSchemaFormulas(schema: JsonSchema): ExtractedFormula[] {\n  const formulas: ExtractedFormula[] = [];\n  const properties = schema.properties ?? {};\n\n  for (const [fieldName, fieldSchema] of Object.entries(properties)) {\n    const xFormula = fieldSchema['x-formula'];\n    if (xFormula) {\n      formulas.push({\n        fieldName,\n        expression: xFormula.expression,\n        fieldType: fieldSchema.type ?? 'string',\n      });\n    }\n  }\n\n  return formulas;\n}\n","import { parseExpression } from './parse-formula';\nimport { validateFormulaSyntax } from './validate-syntax';\nimport { extractSchemaFormulas, JsonSchema } from './extract-schema';\nimport {\n  buildDependencyGraph,\n  detectCircularDependencies,\n} from './dependency-graph';\nimport { inferFormulaType, FieldTypes, InferredType } from './parser';\n\nexport interface FormulaValidationError {\n  field: string;\n  error: string;\n  position?: number;\n}\n\nexport interface SchemaValidationResult {\n  isValid: boolean;\n  errors: FormulaValidationError[];\n}\n\nfunction getSchemaFields(schema: JsonSchema): Set<string> {\n  const fields = new Set<string>();\n  const properties = schema.properties ?? {};\n\n  for (const fieldName of Object.keys(properties)) {\n    fields.add(fieldName);\n  }\n\n  return fields;\n}\n\nfunction getSchemaFieldTypes(schema: JsonSchema): FieldTypes {\n  const fieldTypes: FieldTypes = {};\n  const properties = schema.properties ?? {};\n\n  for (const [fieldName, fieldSchema] of Object.entries(properties)) {\n    const schemaType = fieldSchema.type;\n    if (\n      schemaType === 'number' ||\n      schemaType === 'string' ||\n      schemaType === 'boolean' ||\n      schemaType === 'object' ||\n      schemaType === 'array'\n    ) {\n      fieldTypes[fieldName] = schemaType;\n    }\n  }\n\n  return fieldTypes;\n}\n\nfunction schemaTypeToInferred(\n  schemaType: string | undefined,\n): InferredType | null {\n  if (schemaType === 'number') return 'number';\n  if (schemaType === 'string') return 'string';\n  if (schemaType === 'boolean') return 'boolean';\n  return null;\n}\n\nfunction isTypeCompatible(\n  inferredType: InferredType,\n  expectedType: InferredType | null,\n): boolean {\n  if (expectedType === null) return true;\n  if (inferredType === 'unknown') return true;\n  return inferredType === expectedType;\n}\n\nfunction extractFieldRoot(dependency: string): string {\n  const root = dependency.split('.')[0]?.split('[')[0];\n  return root || dependency;\n}\n\nexport function validateFormulaAgainstSchema(\n  expression: string,\n  fieldName: string,\n  schema: JsonSchema,\n): FormulaValidationError | null {\n  const syntaxResult = validateFormulaSyntax(expression);\n  if (!syntaxResult.isValid) {\n    return {\n      field: fieldName,\n      error: syntaxResult.error,\n      position: syntaxResult.position,\n    };\n  }\n\n  const parseResult = parseExpression(expression);\n  const schemaFields = getSchemaFields(schema);\n\n  for (const dep of parseResult.dependencies) {\n    const rootField = extractFieldRoot(dep);\n    if (!schemaFields.has(rootField)) {\n      return {\n        field: fieldName,\n        error: `Unknown field '${rootField}' in formula`,\n      };\n    }\n  }\n\n  if (parseResult.dependencies.some((d) => extractFieldRoot(d) === fieldName)) {\n    return {\n      field: fieldName,\n      error: `Formula cannot reference itself`,\n    };\n  }\n\n  const fieldSchema = schema.properties?.[fieldName];\n  const expectedType = schemaTypeToInferred(fieldSchema?.type);\n  const fieldTypes = getSchemaFieldTypes(schema);\n  const inferredType = inferFormulaType(expression, fieldTypes);\n\n  if (!isTypeCompatible(inferredType, expectedType)) {\n    return {\n      field: fieldName,\n      error: `Type mismatch: formula returns '${inferredType}' but field expects '${expectedType}'`,\n    };\n  }\n\n  return null;\n}\n\nexport function validateSchemaFormulas(\n  schema: JsonSchema,\n): SchemaValidationResult {\n  const errors: FormulaValidationError[] = [];\n  const formulas = extractSchemaFormulas(schema);\n\n  for (const formula of formulas) {\n    const error = validateFormulaAgainstSchema(\n      formula.expression,\n      formula.fieldName,\n      schema,\n    );\n    if (error) {\n      errors.push(error);\n    }\n  }\n\n  if (errors.length > 0) {\n    return { isValid: false, errors };\n  }\n\n  const dependencies: Record<string, string[]> = {};\n  for (const formula of formulas) {\n    const parseResult = parseExpression(formula.expression);\n    dependencies[formula.fieldName] =\n      parseResult.dependencies.map(extractFieldRoot);\n  }\n\n  const graph = buildDependencyGraph(dependencies);\n  const circularCheck = detectCircularDependencies(graph);\n\n  const cycle = circularCheck.cycle;\n  if (circularCheck.hasCircular && cycle && cycle.length > 0) {\n    const firstField = cycle[0];\n    if (firstField) {\n      errors.push({\n        field: firstField,\n        error: `Circular dependency: ${cycle.join(' → ')}`,\n      });\n      return { isValid: false, errors };\n    }\n  }\n\n  return { isValid: true, errors: [] };\n}\n"]}