@revisium/formula 0.4.0 → 0.6.0

package/dist/{index-JZFJ9oT6.d.cts → index-PFKKFfeI.d.cts}

@@ -41,7 +41,75 @@ interface FormulaContext {
 }
 type FormulaResult = number | string | boolean | null;
 
-type ASTNode = string | number | boolean | null | [string, ...ASTNode[]];
+type ASTNode = NumberLiteral | StringLiteral | BooleanLiteral | NullLiteral | Identifier | RootPath | RelativePath | ContextToken | BinaryOp | UnaryOp | TernaryOp | CallExpression | MemberExpression | IndexExpression | WildcardExpression;
+interface NumberLiteral {
+    type: 'NumberLiteral';
+    value: number;
+}
+interface StringLiteral {
+    type: 'StringLiteral';
+    value: string;
+}
+interface BooleanLiteral {
+    type: 'BooleanLiteral';
+    value: boolean;
+}
+interface NullLiteral {
+    type: 'NullLiteral';
+}
+interface Identifier {
+    type: 'Identifier';
+    name: string;
+}
+interface RootPath {
+    type: 'RootPath';
+    path: string;
+}
+interface RelativePath {
+    type: 'RelativePath';
+    path: string;
+}
+interface ContextToken {
+    type: 'ContextToken';
+    name: string;
+}
+interface BinaryOp {
+    type: 'BinaryOp';
+    op: string;
+    left: ASTNode;
+    right: ASTNode;
+}
+interface UnaryOp {
+    type: 'UnaryOp';
+    op: string;
+    argument: ASTNode;
+}
+interface TernaryOp {
+    type: 'TernaryOp';
+    condition: ASTNode;
+    consequent: ASTNode;
+    alternate: ASTNode;
+}
+interface CallExpression {
+    type: 'CallExpression';
+    callee: ASTNode;
+    arguments: ASTNode[];
+}
+interface MemberExpression {
+    type: 'MemberExpression';
+    object: ASTNode;
+    property: string;
+}
+interface IndexExpression {
+    type: 'IndexExpression';
+    object: ASTNode;
+    index: ASTNode;
+}
+interface WildcardExpression {
+    type: 'WildcardExpression';
+    object: ASTNode;
+}
+
 interface ParseResult {
     ast: ASTNode;
     dependencies: string[];
@@ -86,40 +154,4 @@ type SyntaxValidationResult = {
 };
 declare function validateFormulaSyntax(expression: string): SyntaxValidationResult;
 
-interface XFormulaInput {
-    version: number;
-    expression: string;
-}
-interface SchemaProperty {
-    type?: string;
-    'x-formula'?: XFormulaInput;
-    properties?: Record<string, SchemaProperty>;
-    items?: SchemaProperty;
-    [key: string]: unknown;
-}
-interface JsonSchema {
-    type?: string;
-    properties?: Record<string, SchemaProperty>;
-    items?: SchemaProperty;
-    [key: string]: unknown;
-}
-interface ExtractedFormula {
-    fieldName: string;
-    expression: string;
-    fieldType: string;
-}
-declare function extractSchemaFormulas(schema: JsonSchema): ExtractedFormula[];
-
-interface FormulaValidationError {
-    field: string;
-    error: string;
-    position?: number;
-}
-interface SchemaValidationResult {
-    isValid: boolean;
-    errors: FormulaValidationError[];
-}
-declare function validateFormulaAgainstSchema(expression: string, fieldName: string, schema: JsonSchema): FormulaValidationError | null;
-declare function validateSchemaFormulas(schema: JsonSchema): SchemaValidationResult;
-
-export { type ASTNode as A, type EvaluateContextOptions as E, type FieldTypes as F, type InferredType as I, type JsonSchema as J, type ParseResult as P, type SyntaxValidationResult as S, type XFormula as X, evaluateWithContext as a, parseExpression as b, type ParsedExpression as c, validateFormulaSyntax as d, evaluate as e, extractSchemaFormulas as f, type ExtractedFormula as g, validateFormulaAgainstSchema as h, inferFormulaType as i, validateSchemaFormulas as j, type FormulaValidationError as k, type SchemaValidationResult as l, type FormulaMinorVersion as m, type FormulaFeature as n, type FormulaAnalysis as o, parseFormula as p, type PathSegment as q, type ParsedPath as r, type PathValidationResult as s, type FormulaContext as t, type FormulaResult as u, validateSyntax as v };
+export { type ASTNode as A, type EvaluateContextOptions as E, type FieldTypes as F, type InferredType as I, type ParseResult as P, type SyntaxValidationResult as S, type XFormula as X, evaluateWithContext as a, parseExpression as b, type ParsedExpression as c, validateFormulaSyntax as d, evaluate as e, type FormulaMinorVersion as f, type FormulaFeature as g, type FormulaAnalysis as h, inferFormulaType as i, type PathSegment as j, type ParsedPath as k, type PathValidationResult as l, type FormulaContext as m, type FormulaResult as n, parseFormula as p, validateSyntax as v };

package/dist/{index-JZFJ9oT6.d.ts → index-PFKKFfeI.d.ts}

@@ -41,7 +41,75 @@ interface FormulaContext {
 }
 type FormulaResult = number | string | boolean | null;
 
-type ASTNode = string | number | boolean | null | [string, ...ASTNode[]];
+type ASTNode = NumberLiteral | StringLiteral | BooleanLiteral | NullLiteral | Identifier | RootPath | RelativePath | ContextToken | BinaryOp | UnaryOp | TernaryOp | CallExpression | MemberExpression | IndexExpression | WildcardExpression;
+interface NumberLiteral {
+    type: 'NumberLiteral';
+    value: number;
+}
+interface StringLiteral {
+    type: 'StringLiteral';
+    value: string;
+}
+interface BooleanLiteral {
+    type: 'BooleanLiteral';
+    value: boolean;
+}
+interface NullLiteral {
+    type: 'NullLiteral';
+}
+interface Identifier {
+    type: 'Identifier';
+    name: string;
+}
+interface RootPath {
+    type: 'RootPath';
+    path: string;
+}
+interface RelativePath {
+    type: 'RelativePath';
+    path: string;
+}
+interface ContextToken {
+    type: 'ContextToken';
+    name: string;
+}
+interface BinaryOp {
+    type: 'BinaryOp';
+    op: string;
+    left: ASTNode;
+    right: ASTNode;
+}
+interface UnaryOp {
+    type: 'UnaryOp';
+    op: string;
+    argument: ASTNode;
+}
+interface TernaryOp {
+    type: 'TernaryOp';
+    condition: ASTNode;
+    consequent: ASTNode;
+    alternate: ASTNode;
+}
+interface CallExpression {
+    type: 'CallExpression';
+    callee: ASTNode;
+    arguments: ASTNode[];
+}
+interface MemberExpression {
+    type: 'MemberExpression';
+    object: ASTNode;
+    property: string;
+}
+interface IndexExpression {
+    type: 'IndexExpression';
+    object: ASTNode;
+    index: ASTNode;
+}
+interface WildcardExpression {
+    type: 'WildcardExpression';
+    object: ASTNode;
+}
+
 interface ParseResult {
     ast: ASTNode;
     dependencies: string[];
@@ -86,40 +154,4 @@ type SyntaxValidationResult = {
 };
 declare function validateFormulaSyntax(expression: string): SyntaxValidationResult;
 
-interface XFormulaInput {
-    version: number;
-    expression: string;
-}
-interface SchemaProperty {
-    type?: string;
-    'x-formula'?: XFormulaInput;
-    properties?: Record<string, SchemaProperty>;
-    items?: SchemaProperty;
-    [key: string]: unknown;
-}
-interface JsonSchema {
-    type?: string;
-    properties?: Record<string, SchemaProperty>;
-    items?: SchemaProperty;
-    [key: string]: unknown;
-}
-interface ExtractedFormula {
-    fieldName: string;
-    expression: string;
-    fieldType: string;
-}
-declare function extractSchemaFormulas(schema: JsonSchema): ExtractedFormula[];
-
-interface FormulaValidationError {
-    field: string;
-    error: string;
-    position?: number;
-}
-interface SchemaValidationResult {
-    isValid: boolean;
-    errors: FormulaValidationError[];
-}
-declare function validateFormulaAgainstSchema(expression: string, fieldName: string, schema: JsonSchema): FormulaValidationError | null;
-declare function validateSchemaFormulas(schema: JsonSchema): SchemaValidationResult;
-
-export { type ASTNode as A, type EvaluateContextOptions as E, type FieldTypes as F, type InferredType as I, type JsonSchema as J, type ParseResult as P, type SyntaxValidationResult as S, type XFormula as X, evaluateWithContext as a, parseExpression as b, type ParsedExpression as c, validateFormulaSyntax as d, evaluate as e, extractSchemaFormulas as f, type ExtractedFormula as g, validateFormulaAgainstSchema as h, inferFormulaType as i, validateSchemaFormulas as j, type FormulaValidationError as k, type SchemaValidationResult as l, type FormulaMinorVersion as m, type FormulaFeature as n, type FormulaAnalysis as o, parseFormula as p, type PathSegment as q, type ParsedPath as r, type PathValidationResult as s, type FormulaContext as t, type FormulaResult as u, validateSyntax as v };
+export { type ASTNode as A, type EvaluateContextOptions as E, type FieldTypes as F, type InferredType as I, type ParseResult as P, type SyntaxValidationResult as S, type XFormula as X, evaluateWithContext as a, parseExpression as b, type ParsedExpression as c, validateFormulaSyntax as d, evaluate as e, type FormulaMinorVersion as f, type FormulaFeature as g, type FormulaAnalysis as h, inferFormulaType as i, type PathSegment as j, type ParsedPath as k, type PathValidationResult as l, type FormulaContext as m, type FormulaResult as n, parseFormula as p, validateSyntax as v };

package/dist/index.cjs

@@ -1,61 +1,143 @@
 'use strict';
 
-var chunkAGBOCJGV_cjs = require('./chunk-AGBOCJGV.cjs');
-require('./chunk-Q7SFCCGT.cjs');
+var chunkGOMUE724_cjs = require('./chunk-GOMUE724.cjs');
 
+// src/dependency-graph.ts
+function buildDependencyGraph(dependencies) {
+  const nodes = /* @__PURE__ */ new Set();
+  const edges = /* @__PURE__ */ new Map();
+  for (const [node, deps] of Object.entries(dependencies)) {
+    nodes.add(node);
+    edges.set(node, new Set(deps));
+    for (const dep of deps) {
+      nodes.add(dep);
+    }
+  }
+  return { nodes, edges };
+}
+function detectCircularDependencies(graph) {
+  const visited = /* @__PURE__ */ new Set();
+  const recursionStack = /* @__PURE__ */ new Set();
+  const path = [];
+  for (const node of graph.nodes) {
+    if (!visited.has(node)) {
+      const cycle = dfsVisit(node, graph, visited, recursionStack, path);
+      if (cycle) {
+        return { hasCircular: true, cycle };
+      }
+    }
+  }
+  return { hasCircular: false, cycle: null };
+}
+function dfsVisit(node, graph, visited, recursionStack, path) {
+  visited.add(node);
+  recursionStack.add(node);
+  path.push(node);
+  const deps = graph.edges.get(node);
+  if (deps) {
+    for (const dep of deps) {
+      if (!visited.has(dep)) {
+        const cycle = dfsVisit(dep, graph, visited, recursionStack, path);
+        if (cycle) {
+          return cycle;
+        }
+      } else if (recursionStack.has(dep)) {
+        const cycleStart = path.indexOf(dep);
+        return [...path.slice(cycleStart), dep];
+      }
+    }
+  }
+  path.pop();
+  recursionStack.delete(node);
+  return null;
+}
+function getTopologicalOrder(graph) {
+  const circularCheck = detectCircularDependencies(graph);
+  if (circularCheck.hasCircular && circularCheck.cycle) {
+    return {
+      success: false,
+      order: [],
+      error: `Circular dependency detected: ${circularCheck.cycle.join(" -> ")}`
+    };
+  }
+  const inDegree = initializeInDegree(graph);
+  const queue = findZeroInDegreeNodes(inDegree);
+  const order = processQueue(queue, graph, inDegree);
+  order.reverse();
+  return { success: true, order };
+}
+function initializeInDegree(graph) {
+  const inDegree = /* @__PURE__ */ new Map();
+  for (const node of graph.nodes) {
+    inDegree.set(node, 0);
+  }
+  for (const deps of graph.edges.values()) {
+    for (const dep of deps) {
+      inDegree.set(dep, (inDegree.get(dep) ?? 0) + 1);
+    }
+  }
+  return inDegree;
+}
+function findZeroInDegreeNodes(inDegree) {
+  const result = [];
+  for (const [node, degree] of inDegree) {
+    if (degree === 0) {
+      result.push(node);
+    }
+  }
+  return result;
+}
+function processQueue(queue, graph, inDegree) {
+  const order = [];
+  let head = 0;
+  while (head < queue.length) {
+    const node = queue[head];
+    head++;
+    order.push(node);
+    const deps = graph.edges.get(node);
+    if (deps) {
+      for (const dep of deps) {
+        const newDegree = (inDegree.get(dep) ?? 0) - 1;
+        inDegree.set(dep, newDegree);
+        if (newDegree === 0) {
+          queue.push(dep);
+        }
+      }
+    }
+  }
+  return order;
+}
 
-
-Object.defineProperty(exports, "buildDependencyGraph", {
-  enumerable: true,
-  get: function () { return chunkAGBOCJGV_cjs.buildDependencyGraph; }
-});
-Object.defineProperty(exports, "detectCircularDependencies", {
-  enumerable: true,
-  get: function () { return chunkAGBOCJGV_cjs.detectCircularDependencies; }
-});
 Object.defineProperty(exports, "evaluate", {
   enumerable: true,
-  get: function () { return chunkAGBOCJGV_cjs.evaluate; }
+  get: function () { return chunkGOMUE724_cjs.evaluate; }
 });
 Object.defineProperty(exports, "evaluateWithContext", {
   enumerable: true,
-  get: function () { return chunkAGBOCJGV_cjs.evaluateWithContext; }
-});
-Object.defineProperty(exports, "extractSchemaFormulas", {
-  enumerable: true,
-  get: function () { return chunkAGBOCJGV_cjs.extractSchemaFormulas; }
-});
-Object.defineProperty(exports, "getTopologicalOrder", {
-  enumerable: true,
-  get: function () { return chunkAGBOCJGV_cjs.getTopologicalOrder; }
+  get: function () { return chunkGOMUE724_cjs.evaluateWithContext; }
 });
 Object.defineProperty(exports, "inferFormulaType", {
   enumerable: true,
-  get: function () { return chunkAGBOCJGV_cjs.inferFormulaType; }
+  get: function () { return chunkGOMUE724_cjs.inferFormulaType; }
 });
 Object.defineProperty(exports, "parseExpression", {
   enumerable: true,
-  get: function () { return chunkAGBOCJGV_cjs.parseExpression; }
+  get: function () { return chunkGOMUE724_cjs.parseExpression; }
 });
 Object.defineProperty(exports, "parseFormula", {
   enumerable: true,
-  get: function () { return chunkAGBOCJGV_cjs.parseFormula; }
-});
-Object.defineProperty(exports, "validateFormulaAgainstSchema", {
-  enumerable: true,
-  get: function () { return chunkAGBOCJGV_cjs.validateFormulaAgainstSchema; }
+  get: function () { return chunkGOMUE724_cjs.parseFormula; }
 });
 Object.defineProperty(exports, "validateFormulaSyntax", {
   enumerable: true,
-  get: function () { return chunkAGBOCJGV_cjs.validateFormulaSyntax; }
-});
-Object.defineProperty(exports, "validateSchemaFormulas", {
-  enumerable: true,
-  get: function () { return chunkAGBOCJGV_cjs.validateSchemaFormulas; }
+  get: function () { return chunkGOMUE724_cjs.validateFormulaSyntax; }
 });
 Object.defineProperty(exports, "validateSyntax", {
   enumerable: true,
-  get: function () { return chunkAGBOCJGV_cjs.validateSyntax; }
+  get: function () { return chunkGOMUE724_cjs.validateSyntax; }
 });
+exports.buildDependencyGraph = buildDependencyGraph;
+exports.detectCircularDependencies = detectCircularDependencies;
+exports.getTopologicalOrder = getTopologicalOrder;
 //# sourceMappingURL=index.cjs.map
 //# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":[],"names":[],"mappings":"","file":"index.cjs"}
+{"version":3,"sources":["../src/dependency-graph.ts"],"names":[],"mappings":";;;;;AA8BO,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","file":"index.cjs","sourcesContent":["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"]}

package/dist/index.d.cts

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

package/dist/index.d.ts

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

package/dist/index.js

@@ -1,4 +1,111 @@
-export { buildDependencyGraph, detectCircularDependencies, evaluate, evaluateWithContext, extractSchemaFormulas, getTopologicalOrder, inferFormulaType, parseExpression, parseFormula, validateFormulaAgainstSchema, validateFormulaSyntax, validateSchemaFormulas, validateSyntax } from './chunk-FDIJPOVQ.js';
-import './chunk-PZ5AY32C.js';
+export { evaluate, evaluateWithContext, inferFormulaType, parseExpression, parseFormula, validateFormulaSyntax, validateSyntax } from './chunk-LFEHEGBL.js';
+
+// src/dependency-graph.ts
+function buildDependencyGraph(dependencies) {
+  const nodes = /* @__PURE__ */ new Set();
+  const edges = /* @__PURE__ */ new Map();
+  for (const [node, deps] of Object.entries(dependencies)) {
+    nodes.add(node);
+    edges.set(node, new Set(deps));
+    for (const dep of deps) {
+      nodes.add(dep);
+    }
+  }
+  return { nodes, edges };
+}
+function detectCircularDependencies(graph) {
+  const visited = /* @__PURE__ */ new Set();
+  const recursionStack = /* @__PURE__ */ new Set();
+  const path = [];
+  for (const node of graph.nodes) {
+    if (!visited.has(node)) {
+      const cycle = dfsVisit(node, graph, visited, recursionStack, path);
+      if (cycle) {
+        return { hasCircular: true, cycle };
+      }
+    }
+  }
+  return { hasCircular: false, cycle: null };
+}
+function dfsVisit(node, graph, visited, recursionStack, path) {
+  visited.add(node);
+  recursionStack.add(node);
+  path.push(node);
+  const deps = graph.edges.get(node);
+  if (deps) {
+    for (const dep of deps) {
+      if (!visited.has(dep)) {
+        const cycle = dfsVisit(dep, graph, visited, recursionStack, path);
+        if (cycle) {
+          return cycle;
+        }
+      } else if (recursionStack.has(dep)) {
+        const cycleStart = path.indexOf(dep);
+        return [...path.slice(cycleStart), dep];
+      }
+    }
+  }
+  path.pop();
+  recursionStack.delete(node);
+  return null;
+}
+function getTopologicalOrder(graph) {
+  const circularCheck = detectCircularDependencies(graph);
+  if (circularCheck.hasCircular && circularCheck.cycle) {
+    return {
+      success: false,
+      order: [],
+      error: `Circular dependency detected: ${circularCheck.cycle.join(" -> ")}`
+    };
+  }
+  const inDegree = initializeInDegree(graph);
+  const queue = findZeroInDegreeNodes(inDegree);
+  const order = processQueue(queue, graph, inDegree);
+  order.reverse();
+  return { success: true, order };
+}
+function initializeInDegree(graph) {
+  const inDegree = /* @__PURE__ */ new Map();
+  for (const node of graph.nodes) {
+    inDegree.set(node, 0);
+  }
+  for (const deps of graph.edges.values()) {
+    for (const dep of deps) {
+      inDegree.set(dep, (inDegree.get(dep) ?? 0) + 1);
+    }
+  }
+  return inDegree;
+}
+function findZeroInDegreeNodes(inDegree) {
+  const result = [];
+  for (const [node, degree] of inDegree) {
+    if (degree === 0) {
+      result.push(node);
+    }
+  }
+  return result;
+}
+function processQueue(queue, graph, inDegree) {
+  const order = [];
+  let head = 0;
+  while (head < queue.length) {
+    const node = queue[head];
+    head++;
+    order.push(node);
+    const deps = graph.edges.get(node);
+    if (deps) {
+      for (const dep of deps) {
+        const newDegree = (inDegree.get(dep) ?? 0) - 1;
+        inDegree.set(dep, newDegree);
+        if (newDegree === 0) {
+          queue.push(dep);
+        }
+      }
+    }
+  }
+  return order;
+}
+
+export { buildDependencyGraph, detectCircularDependencies, getTopologicalOrder };
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":[],"names":[],"mappings":"","file":"index.js"}
+{"version":3,"sources":["../src/dependency-graph.ts"],"names":[],"mappings":";;;AA8BO,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","file":"index.js","sourcesContent":["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"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@revisium/formula",
-  "version": "0.4.0",
+  "version": "0.6.0",
   "description": "Formula expression parser and evaluator for Revisium",
   "keywords": [
     "formula",
@@ -104,6 +104,6 @@
     "access": "public"
   },
   "dependencies": {
-    "subscript": "^9.2.0"
+    "ohm-js": "^17.3.0"
   }
 }