@revisium/formula 0.1.0 → 0.1.1

package/dist/{index-ChO-K1-Q.d.cts → index-DO2EZ7U6.d.cts}

@@ -1,7 +1,6 @@
 interface XFormula {
     version: 1;
     expression: string;
-    onError?: 'null' | 'default' | 'throw';
 }
 type FormulaMinorVersion = '1.0' | '1.1';
 type FormulaFeature = 'nested_path' | 'array_index' | 'array_wildcard' | 'relative_path' | 'root_path' | 'context_token' | 'array_function';
@@ -84,7 +83,6 @@ declare function validateFormulaSyntax(expression: string): SyntaxValidationResu
 interface XFormulaInput {
     version: number;
     expression: string;
-    onError?: 'null' | 'default' | 'throw';
 }
 interface SchemaProperty {
     type?: string;

package/dist/{index-ChO-K1-Q.d.ts → index-DO2EZ7U6.d.ts}

@@ -1,7 +1,6 @@
 interface XFormula {
     version: 1;
     expression: string;
-    onError?: 'null' | 'default' | 'throw';
 }
 type FormulaMinorVersion = '1.0' | '1.1';
 type FormulaFeature = 'nested_path' | 'array_index' | 'array_wildcard' | 'relative_path' | 'root_path' | 'context_token' | 'array_function';
@@ -84,7 +83,6 @@ declare function validateFormulaSyntax(expression: string): SyntaxValidationResu
 interface XFormulaInput {
     version: number;
     expression: string;
-    onError?: 'null' | 'default' | 'throw';
 }
 interface SchemaProperty {
     type?: string;

package/dist/index.cjs

@@ -1,56 +1,56 @@
 'use strict';
 
-var chunkDJBJIFBU_cjs = require('./chunk-DJBJIFBU.cjs');
+var chunkV4BMBATD_cjs = require('./chunk-V4BMBATD.cjs');
 
 
 
 Object.defineProperty(exports, "buildDependencyGraph", {
   enumerable: true,
-  get: function () { return chunkDJBJIFBU_cjs.buildDependencyGraph; }
+  get: function () { return chunkV4BMBATD_cjs.buildDependencyGraph; }
 });
 Object.defineProperty(exports, "detectCircularDependencies", {
   enumerable: true,
-  get: function () { return chunkDJBJIFBU_cjs.detectCircularDependencies; }
+  get: function () { return chunkV4BMBATD_cjs.detectCircularDependencies; }
 });
 Object.defineProperty(exports, "evaluate", {
   enumerable: true,
-  get: function () { return chunkDJBJIFBU_cjs.evaluate; }
+  get: function () { return chunkV4BMBATD_cjs.evaluate; }
 });
 Object.defineProperty(exports, "extractSchemaFormulas", {
   enumerable: true,
-  get: function () { return chunkDJBJIFBU_cjs.extractSchemaFormulas; }
+  get: function () { return chunkV4BMBATD_cjs.extractSchemaFormulas; }
 });
 Object.defineProperty(exports, "getTopologicalOrder", {
   enumerable: true,
-  get: function () { return chunkDJBJIFBU_cjs.getTopologicalOrder; }
+  get: function () { return chunkV4BMBATD_cjs.getTopologicalOrder; }
 });
 Object.defineProperty(exports, "inferFormulaType", {
   enumerable: true,
-  get: function () { return chunkDJBJIFBU_cjs.inferFormulaType; }
+  get: function () { return chunkV4BMBATD_cjs.inferFormulaType; }
 });
 Object.defineProperty(exports, "parseExpression", {
   enumerable: true,
-  get: function () { return chunkDJBJIFBU_cjs.parseExpression; }
+  get: function () { return chunkV4BMBATD_cjs.parseExpression; }
 });
 Object.defineProperty(exports, "parseFormula", {
   enumerable: true,
-  get: function () { return chunkDJBJIFBU_cjs.parseFormula; }
+  get: function () { return chunkV4BMBATD_cjs.parseFormula; }
 });
 Object.defineProperty(exports, "validateFormulaAgainstSchema", {
   enumerable: true,
-  get: function () { return chunkDJBJIFBU_cjs.validateFormulaAgainstSchema; }
+  get: function () { return chunkV4BMBATD_cjs.validateFormulaAgainstSchema; }
 });
 Object.defineProperty(exports, "validateFormulaSyntax", {
   enumerable: true,
-  get: function () { return chunkDJBJIFBU_cjs.validateFormulaSyntax; }
+  get: function () { return chunkV4BMBATD_cjs.validateFormulaSyntax; }
 });
 Object.defineProperty(exports, "validateSchemaFormulas", {
   enumerable: true,
-  get: function () { return chunkDJBJIFBU_cjs.validateSchemaFormulas; }
+  get: function () { return chunkV4BMBATD_cjs.validateSchemaFormulas; }
 });
 Object.defineProperty(exports, "validateSyntax", {
   enumerable: true,
-  get: function () { return chunkDJBJIFBU_cjs.validateSyntax; }
+  get: function () { return chunkV4BMBATD_cjs.validateSyntax; }
 });
 //# sourceMappingURL=index.cjs.map
 //# sourceMappingURL=index.cjs.map

package/dist/index.d.cts

@@ -1,4 +1,4 @@
-export { A as ASTNode, E as ExtractedFormula, F as FieldTypes, m as FormulaAnalysis, r as FormulaContext, l as FormulaFeature, k as FormulaMinorVersion, s as FormulaResult, h as FormulaValidationError, I as InferredType, J as JsonSchema, P as ParseResult, b as ParsedExpression, o as ParsedPath, n as PathSegment, q as PathValidationResult, j as SchemaValidationResult, S as SyntaxValidationResult, X as XFormula, e as evaluate, d as extractSchemaFormulas, i as inferFormulaType, a as parseExpression, p as parseFormula, f as validateFormulaAgainstSchema, c as validateFormulaSyntax, g as validateSchemaFormulas, v as validateSyntax } from './index-ChO-K1-Q.cjs';
+export { A as ASTNode, E as ExtractedFormula, F as FieldTypes, m as FormulaAnalysis, r as FormulaContext, l as FormulaFeature, k as FormulaMinorVersion, s as FormulaResult, h as FormulaValidationError, I as InferredType, J as JsonSchema, P as ParseResult, b as ParsedExpression, o as ParsedPath, n as PathSegment, q as PathValidationResult, j as SchemaValidationResult, S as SyntaxValidationResult, X as XFormula, e as evaluate, d as extractSchemaFormulas, i as inferFormulaType, a as parseExpression, p as parseFormula, f as validateFormulaAgainstSchema, c as validateFormulaSyntax, g as validateSchemaFormulas, v as validateSyntax } from './index-DO2EZ7U6.cjs';
 
 interface DependencyGraph {
     nodes: Set<string>;

package/dist/index.d.ts

@@ -1,4 +1,4 @@
-export { A as ASTNode, E as ExtractedFormula, F as FieldTypes, m as FormulaAnalysis, r as FormulaContext, l as FormulaFeature, k as FormulaMinorVersion, s as FormulaResult, h as FormulaValidationError, I as InferredType, J as JsonSchema, P as ParseResult, b as ParsedExpression, o as ParsedPath, n as PathSegment, q as PathValidationResult, j as SchemaValidationResult, S as SyntaxValidationResult, X as XFormula, e as evaluate, d as extractSchemaFormulas, i as inferFormulaType, a as parseExpression, p as parseFormula, f as validateFormulaAgainstSchema, c as validateFormulaSyntax, g as validateSchemaFormulas, v as validateSyntax } from './index-ChO-K1-Q.js';
+export { A as ASTNode, E as ExtractedFormula, F as FieldTypes, m as FormulaAnalysis, r as FormulaContext, l as FormulaFeature, k as FormulaMinorVersion, s as FormulaResult, h as FormulaValidationError, I as InferredType, J as JsonSchema, P as ParseResult, b as ParsedExpression, o as ParsedPath, n as PathSegment, q as PathValidationResult, j as SchemaValidationResult, S as SyntaxValidationResult, X as XFormula, e as evaluate, d as extractSchemaFormulas, i as inferFormulaType, a as parseExpression, p as parseFormula, f as validateFormulaAgainstSchema, c as validateFormulaSyntax, g as validateSchemaFormulas, v as validateSyntax } from './index-DO2EZ7U6.js';
 
 interface DependencyGraph {
     nodes: Set<string>;

package/dist/index.js

@@ -1,3 +1,3 @@
-export { buildDependencyGraph, detectCircularDependencies, evaluate, extractSchemaFormulas, getTopologicalOrder, inferFormulaType, parseExpression, parseFormula, validateFormulaAgainstSchema, validateFormulaSyntax, validateSchemaFormulas, validateSyntax } from './chunk-N7DFRM77.js';
+export { buildDependencyGraph, detectCircularDependencies, evaluate, extractSchemaFormulas, getTopologicalOrder, inferFormulaType, parseExpression, parseFormula, validateFormulaAgainstSchema, validateFormulaSyntax, validateSchemaFormulas, validateSyntax } from './chunk-5TRH7SCW.js';
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@revisium/formula",
-  "version": "0.1.0",
+  "version": "0.1.1",
   "description": "Formula expression parser and evaluator for Revisium",
   "keywords": [
     "formula",

package/dist/chunk-DJBJIFBU.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/parser.ts","../src/parse-formula.ts","../src/validate-syntax.ts","../src/dependency-graph.ts","../src/extract-schema.ts","../src/validate-schema.ts"],"names":["parseModule","token","parse","subscript"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAOA,IAAM,EAAE,MAAK,GAAIA,sBAAA;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;AAGNC,eAAA,CAAM,GAAA,EAAK,GAAA,EAAK,CAAC,CAAA,KAAe;AAC9B,EAAA,IAAI,CAAA,EAAG;AACP,EAAA,MAAM,IAAA,GAAO,KAAK,QAAQ,CAAA;AAC1B,EAAA,IAAI,CAAC,IAAA,EAAM;AACX,EAAA,OAAO,GAAA,GAAM,IAAA;AACf,CAAC,CAAA;AAGDA,eAAA,CAAM,GAAA,EAAK,GAAA,EAAK,CAAC,CAAA,KAAe;AAC9B,EAAA,IAAI,CAAA,EAAG;AACP,EAAA,MAAM,IAAA,GAAO,KAAK,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;AAGAA,eAAA,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,GAAMC,gBAAM,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,IAAAA,eAAA,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,GAAKC,2BAAU,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,GAAMD,gBAAM,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;;;ACtJO,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;;;ACpCA,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-DJBJIFBU.cjs","sourcesContent":["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  onError?: 'null' | 'default' | 'throw';\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"]}

package/dist/chunk-N7DFRM77.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/parser.ts","../src/parse-formula.ts","../src/validate-syntax.ts","../src/dependency-graph.ts","../src/extract-schema.ts","../src/validate-schema.ts"],"names":[],"mappings":";;;;AAOA,IAAM,EAAE,MAAK,GAAI,WAAA;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,GAAO,KAAK,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,GAAO,KAAK,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,UAAU,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;;;ACtJO,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;;;ACpCA,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-N7DFRM77.js","sourcesContent":["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  onError?: 'null' | 'default' | 'throw';\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"]}