formulakit 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 trananhtung
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,216 @@
+# formulakit
+
+[![All Contributors](https://img.shields.io/badge/all_contributors-1-orange.svg?style=flat-square)](#contributors-)
+
+> Zero-dependency safe arithmetic expression evaluator for TypeScript. Parse and evaluate math formulas with variables, custom functions, and ternary logic — no `eval()`. Port of Python `simpleeval` / Go `expr` / C# `DynamicExpresso`.
+
+[![npm](https://img.shields.io/npm/v/formulakit)](https://www.npmjs.com/package/formulakit)
+[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](LICENSE)
+
+## Install
+
+```bash
+npm install formulakit
+```
+
+## Quick start
+
+```typescript
+import { evaluate, compile } from "formulakit";
+
+// one-shot evaluation
+evaluate("2 + 3 * 4");              // 14
+evaluate("sqrt(a^2 + b^2)", { a: 3, b: 4 });   // 5
+
+// compile once, evaluate many times (faster)
+const bmi = compile("weight / (height * height)");
+bmi.evaluate({ weight: 70, height: 1.75 });     // 22.86
+bmi.evaluate({ weight: 90, height: 1.80 });     // 27.78
+
+// ternary / conditional
+evaluate("qty >= 100 ? price * 0.8 : price", { qty: 150, price: 10 });  // 8
+```
+
+## Why formulakit?
+
+| Package | Downloads/week | Status | TypeScript |
+|---|---|---|---|
+| `expr-eval` | ~200k | **Abandoned March 2021** | ❌ |
+| `mathjs` | ~1.2M | Active | ✅ | Has 3 deps, 180KB |
+| **`formulakit`** | — | **Active** | ✅ native |
+
+`expr-eval` is the de-facto choice for safe expression evaluation but has been abandoned for 3+ years and has no TypeScript types. `mathjs` is excellent but ships 180KB of linear algebra, units, and symbolic math — overkill if you just need `"2 * x + 1"`. `formulakit` fills the gap: 0 dependencies, native TypeScript, ESM+CJS.
+
+## Features
+
+- **Safe** — pure AST evaluator, never calls `eval()` or `Function()`
+- **Variables** — pass any `Record<string, number>` as context
+- **Custom functions** — extend with your own named functions
+- **Ternary operator** — `condition ? a : b`
+- **Comparison & logical operators** — `==`, `!=`, `<`, `<=`, `>`, `>=`, `&&`, `||`, `!`
+- **Right-associative `^`** — `2^3^2` = `2^9` = 512 (standard math)
+- **Short-circuit** — `&&` and `||` skip the right side when not needed
+- **compile()** — parse once, evaluate many times
+- **variables()** — introspect which variables a formula uses
+
+## API
+
+### `evaluate(expr, vars?, opts?)`
+
+```typescript
+evaluate("x^2 + y^2", { x: 3, y: 4 })   // 25
+evaluate("sin(PI/6)")                      // 0.5
+```
+
+### `tryEvaluate(expr, vars?, opts?)`
+
+Returns `null` instead of throwing on parse/evaluation errors.
+
+```typescript
+tryEvaluate("1 + 2")           // 3
+tryEvaluate("unknown_var")     // null
+tryEvaluate("2 @ 3")           // null  (bad syntax)
+```
+
+### `compile(expr): CompiledFormula`
+
+Pre-parse an expression for repeated use:
+
+```typescript
+const f = compile("a * b + c");
+f.evaluate({ a: 1, b: 2, c: 3 })   // 5
+f.evaluate({ a: 10, b: 20, c: 30 }) // 230
+
+f.variables()  // ["a", "b", "c"]  — sorted list of identifiers
+f.source       // "a * b + c"
+```
+
+### `parse(expr): ASTNode` / `evalAST(ast, opts?)`
+
+Low-level access to the parse tree:
+
+```typescript
+import { parse, evalAST } from "formulakit";
+const ast = parse("x + y");
+evalAST(ast, { vars: { x: 10, y: 20 } });  // 30
+```
+
+## Operators
+
+| Operator | Description | Example |
+|---|---|---|
+| `+` `-` | Addition / subtraction | `2 + 3`, `5 - 1` |
+| `*` `/` | Multiplication / division | `3 * 4`, `10 / 2` |
+| `%` | Modulo | `7 % 3` → 1 |
+| `^` | Power (right-associative) | `2^3^2` = `2^9` = 512 |
+| `==` `!=` | Equality (returns 0 or 1) | `x == y` |
+| `<` `<=` `>` `>=` | Comparison | `a < b` |
+| `&&` | Logical AND (short-circuit) | `x > 0 && x < 10` |
+| `\|\|` | Logical OR (short-circuit) | `x < 0 \|\| x > 100` |
+| `!` | Logical NOT | `!0` → 1 |
+| `? :` | Ternary | `x > 0 ? x : -x` |
+| `(` `)` | Grouping | `(a + b) * c` |
+
+## Built-in constants
+
+`PI`, `E`, `LN2`, `LN10`, `LOG2E`, `LOG10E`, `SQRT2`, `Infinity`, `NaN`
+
+## Built-in functions
+
+| Function | Description |
+|---|---|
+| `abs(x)` | Absolute value |
+| `ceil(x)` / `floor(x)` / `round(x)` / `trunc(x)` | Rounding |
+| `sign(x)` | Sign (-1 / 0 / 1) |
+| `sqrt(x)` / `cbrt(x)` | Square/cube root |
+| `pow(x, y)` | Power (same as `x^y`) |
+| `exp(x)` | e^x |
+| `log(x)` / `log2(x)` / `log10(x)` | Logarithms |
+| `sin(x)` / `cos(x)` / `tan(x)` | Trig (radians) |
+| `asin(x)` / `acos(x)` / `atan(x)` / `atan2(y,x)` | Inverse trig |
+| `sinh(x)` / `cosh(x)` / `tanh(x)` | Hyperbolic |
+| `min(...)` / `max(...)` | Min/max of N args |
+| `clamp(x, lo, hi)` | Clamp to [lo, hi] |
+| `hypot(x, y, ...)` | Hypotenuse |
+| `isNaN(x)` / `isFinite(x)` | Tests (returns 0 or 1) |
+
+## Options
+
+```typescript
+evaluate(expr, vars, {
+  functions: { double: (x) => x * 2 },  // custom functions
+  maxDepth:  200,                         // max AST recursion (default 200)
+});
+```
+
+## Examples
+
+### BMI calculator
+
+```typescript
+const bmi = compile("weight / height^2");
+bmi.evaluate({ weight: 70, height: 1.75 });  // 22.86
+```
+
+### Compound interest
+
+```typescript
+evaluate("P * (1 + r/n) ^ (n * t)", { P: 1000, r: 0.05, n: 12, t: 10 });
+// 1647.01
+```
+
+### Spreadsheet-style formula
+
+```typescript
+const formula = compile("IF > threshold ? value * multiplier : value");
+// ... or with ternary:
+compile("value > threshold ? value * multiplier : value")
+  .evaluate({ value: 200, threshold: 100, multiplier: 1.5 });  // 300
+```
+
+### Dynamic pricing
+
+```typescript
+const price = compile("qty >= 100 ? base * 0.8 : qty >= 50 ? base * 0.9 : base");
+price.evaluate({ qty: 150, base: 10 });  // 8
+price.evaluate({ qty: 75, base: 10 });   // 9
+price.evaluate({ qty: 10, base: 10 });   // 10
+```
+
+### Custom functions
+
+```typescript
+import { evaluate } from "formulakit";
+
+evaluate("toCelsius(98.6)", {}, {
+  functions: {
+    toCelsius: (f) => (f - 32) * 5/9,
+  },
+});  // 37
+```
+
+## Contributors ✨
+
+This project follows the [all-contributors](https://github.com/all-contributors/all-contributors) specification. Contributions of any kind are welcome — code, docs, bug reports, ideas, reviews! See the [emoji key](https://allcontributors.org/docs/en/emoji-key) for how each contribution is recognized, and open a PR or issue to get involved.
+
+Thanks goes to these wonderful people:
+
+<!-- ALL-CONTRIBUTORS-LIST:START - Do not remove or modify this section -->
+<!-- prettier-ignore-start -->
+<!-- markdownlint-disable -->
+<table>
+  <tbody>
+    <tr>
+      <td align="center" valign="top" width="14.28%"><a href="https://github.com/trananhtung"><img src="https://avatars.githubusercontent.com/u/30992229?v=4?s=100" width="100px;" alt="Tung Tran"/><br /><sub><b>Tung Tran</b></sub></a><br /><a href="https://github.com/trananhtung/formulakit/commits?author=trananhtung" title="Code">💻</a> <a href="#maintenance-trananhtung" title="Maintenance">🚧</a></td>
+    </tr>
+  </tbody>
+</table>
+
+<!-- markdownlint-restore -->
+<!-- prettier-ignore-end -->
+
+<!-- ALL-CONTRIBUTORS-LIST:END -->
+
+## License
+
+MIT © [trananhtung](https://github.com/trananhtung)

package/dist/index.cjs

@@ -0,0 +1,404 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/index.ts
+var index_exports = {};
+__export(index_exports, {
+  BUILTIN_FUNCTIONS: () => BUILTIN_FUNCTIONS,
+  BUILTIN_VARS: () => BUILTIN_VARS,
+  CompiledFormula: () => CompiledFormula,
+  FormulaError: () => FormulaError,
+  compile: () => compile,
+  evalAST: () => evalAST,
+  evaluate: () => evaluate,
+  parse: () => parse,
+  tryEvaluate: () => tryEvaluate
+});
+module.exports = __toCommonJS(index_exports);
+
+// src/types.ts
+var FormulaError = class extends Error {
+  constructor(message, position) {
+    super(message);
+    this.position = position;
+    this.name = "FormulaError";
+  }
+};
+
+// src/lexer.ts
+function tokenize(src) {
+  const tokens = [];
+  let i = 0;
+  while (i < src.length) {
+    if (/\s/.test(src[i])) {
+      i++;
+      continue;
+    }
+    const pos = i;
+    const ch = src[i];
+    if (/[0-9]/.test(ch) || ch === "." && /[0-9]/.test(src[i + 1] ?? "")) {
+      let raw = "";
+      while (i < src.length && /[0-9.]/.test(src[i])) raw += src[i++];
+      if (src[i] === "e" || src[i] === "E") {
+        raw += src[i++];
+        if (src[i] === "+" || src[i] === "-") raw += src[i++];
+        while (i < src.length && /[0-9]/.test(src[i])) raw += src[i++];
+      }
+      tokens.push({ type: "Number" /* Number */, raw, pos });
+      continue;
+    }
+    if (/[a-zA-Z_]/.test(ch)) {
+      let raw = "";
+      while (i < src.length && /[a-zA-Z0-9_]/.test(src[i])) raw += src[i++];
+      tokens.push({ type: "Ident" /* Ident */, raw, pos });
+      continue;
+    }
+    const two = src.slice(i, i + 2);
+    if (two === "==" || two === "!=" || two === "<=" || two === ">=" || two === "&&" || two === "||") {
+      tokens.push({ type: two, raw: two, pos });
+      i += 2;
+      continue;
+    }
+    const singles = {
+      "+": "+" /* Plus */,
+      "-": "-" /* Minus */,
+      "*": "*" /* Star */,
+      "/": "/" /* Slash */,
+      "%": "%" /* Percent */,
+      "^": "^" /* Caret */,
+      "(": "(" /* LParen */,
+      ")": ")" /* RParen */,
+      ",": "," /* Comma */,
+      "?": "?" /* Question */,
+      ":": ":" /* Colon */,
+      "<": "<" /* Lt */,
+      ">": ">" /* Gt */,
+      "!": "!" /* Not */
+    };
+    if (ch in singles) {
+      tokens.push({ type: singles[ch], raw: ch, pos });
+      i++;
+      continue;
+    }
+    throw new FormulaError(`Unexpected character '${ch}'`, pos);
+  }
+  tokens.push({ type: "EOF" /* EOF */, raw: "", pos: i });
+  return tokens;
+}
+
+// src/parser.ts
+var BP = {
+  ["||" /* Or */]: 10,
+  ["&&" /* And */]: 20,
+  ["==" /* Eq */]: 30,
+  ["!=" /* NEq */]: 30,
+  ["<" /* Lt */]: 40,
+  ["<=" /* Lte */]: 40,
+  [">" /* Gt */]: 40,
+  [">=" /* Gte */]: 40,
+  ["+" /* Plus */]: 50,
+  ["-" /* Minus */]: 50,
+  ["*" /* Star */]: 60,
+  ["/" /* Slash */]: 60,
+  ["%" /* Percent */]: 60,
+  ["^" /* Caret */]: 70
+  // right-assoc → parse at BP-1
+};
+var Parser = class {
+  constructor(src) {
+    this.pos = 0;
+    this.tokens = tokenize(src);
+  }
+  peek() {
+    return this.tokens[this.pos];
+  }
+  consume() {
+    return this.tokens[this.pos++];
+  }
+  expect(type) {
+    const t = this.consume();
+    if (t.type !== type) throw new FormulaError(`Expected '${type}' but got '${t.raw}'`, t.pos);
+    return t;
+  }
+  parse() {
+    const node = this.expr(0);
+    if (this.peek().type !== "EOF" /* EOF */) {
+      const t = this.peek();
+      throw new FormulaError(`Unexpected token '${t.raw}'`, t.pos);
+    }
+    return node;
+  }
+  expr(minBP) {
+    let left = this.prefix();
+    while (true) {
+      const t = this.peek();
+      if (t.type === "?" /* Question */ && minBP < 5) {
+        this.consume();
+        const consequent = this.expr(0);
+        this.expect(":" /* Colon */);
+        const alternate = this.expr(0);
+        left = { kind: "conditional", condition: left, consequent, alternate };
+        continue;
+      }
+      const bp = BP[t.type];
+      if (bp === void 0 || bp <= minBP) break;
+      this.consume();
+      const rightBP = t.type === "^" /* Caret */ ? bp - 1 : bp;
+      const right = this.expr(rightBP);
+      left = { kind: "binary", op: t.type, left, right };
+    }
+    return left;
+  }
+  prefix() {
+    const t = this.peek();
+    if (t.type === "Number" /* Number */) {
+      this.consume();
+      return { kind: "number", value: parseFloat(t.raw) };
+    }
+    if (t.type === "Ident" /* Ident */) {
+      this.consume();
+      if (this.peek().type === "(" /* LParen */) {
+        this.consume();
+        const args = [];
+        if (this.peek().type !== ")" /* RParen */) {
+          args.push(this.expr(0));
+          while (this.peek().type === "," /* Comma */) {
+            this.consume();
+            args.push(this.expr(0));
+          }
+        }
+        this.expect(")" /* RParen */);
+        return { kind: "call", name: t.raw, args };
+      }
+      return { kind: "identifier", name: t.raw };
+    }
+    if (t.type === "-" /* Minus */) {
+      this.consume();
+      return { kind: "unary", op: "-", operand: this.expr(65) };
+    }
+    if (t.type === "!" /* Not */) {
+      this.consume();
+      return { kind: "unary", op: "!", operand: this.expr(65) };
+    }
+    if (t.type === "+" /* Plus */) {
+      this.consume();
+      return this.expr(65);
+    }
+    if (t.type === "(" /* LParen */) {
+      this.consume();
+      const inner = this.expr(0);
+      this.expect(")" /* RParen */);
+      return inner;
+    }
+    throw new FormulaError(`Unexpected token '${t.raw}'`, t.pos);
+  }
+};
+function parse(src) {
+  return new Parser(src).parse();
+}
+
+// src/builtins.ts
+var BUILTIN_VARS = {
+  PI: Math.PI,
+  E: Math.E,
+  LN2: Math.LN2,
+  LN10: Math.LN10,
+  LOG2E: Math.LOG2E,
+  LOG10E: Math.LOG10E,
+  SQRT2: Math.SQRT2,
+  Infinity: Infinity,
+  NaN: NaN
+};
+var BUILTIN_FUNCTIONS = {
+  abs: (x) => Math.abs(x),
+  ceil: (x) => Math.ceil(x),
+  floor: (x) => Math.floor(x),
+  round: (x) => Math.round(x),
+  trunc: (x) => Math.trunc(x),
+  sign: (x) => Math.sign(x),
+  sqrt: (x) => Math.sqrt(x),
+  cbrt: (x) => Math.cbrt(x),
+  pow: (x, y) => Math.pow(x, y),
+  exp: (x) => Math.exp(x),
+  log: (x) => Math.log(x),
+  log2: (x) => Math.log2(x),
+  log10: (x) => Math.log10(x),
+  sin: (x) => Math.sin(x),
+  cos: (x) => Math.cos(x),
+  tan: (x) => Math.tan(x),
+  asin: (x) => Math.asin(x),
+  acos: (x) => Math.acos(x),
+  atan: (x) => Math.atan(x),
+  atan2: (y, x) => Math.atan2(y, x),
+  sinh: (x) => Math.sinh(x),
+  cosh: (x) => Math.cosh(x),
+  tanh: (x) => Math.tanh(x),
+  min: (...args) => Math.min(...args),
+  max: (...args) => Math.max(...args),
+  clamp: (x, lo, hi) => Math.min(Math.max(x, lo), hi),
+  hypot: (...args) => Math.hypot(...args),
+  random: () => Math.random(),
+  isNaN: (x) => isNaN(x) ? 1 : 0,
+  isFinite: (x) => isFinite(x) ? 1 : 0
+};
+
+// src/evaluator.ts
+function evalNode(node, opts, depth) {
+  if (depth > opts.maxDepth) throw new FormulaError("Maximum recursion depth exceeded");
+  const d = depth + 1;
+  switch (node.kind) {
+    case "number":
+      return node.value;
+    case "identifier": {
+      const name = node.name;
+      if (name in opts.vars) return opts.vars[name];
+      if (name in BUILTIN_VARS) return BUILTIN_VARS[name];
+      throw new FormulaError(`Unknown variable '${name}'`);
+    }
+    case "unary": {
+      const v = evalNode(node.operand, opts, d);
+      if (node.op === "-") return -v;
+      if (node.op === "!") return v === 0 ? 1 : 0;
+      throw new FormulaError(`Unknown unary operator '${node.op}'`);
+    }
+    case "binary": {
+      const l = evalNode(node.left, opts, d);
+      if (node.op === "&&") return l !== 0 ? evalNode(node.right, opts, d) : 0;
+      if (node.op === "||") return l !== 0 ? l : evalNode(node.right, opts, d);
+      const r = evalNode(node.right, opts, d);
+      switch (node.op) {
+        case "+":
+          return l + r;
+        case "-":
+          return l - r;
+        case "*":
+          return l * r;
+        case "/":
+          if (r === 0) throw new FormulaError("Division by zero");
+          return l / r;
+        case "%":
+          if (r === 0) throw new FormulaError("Modulo by zero");
+          return l % r;
+        case "^":
+          return Math.pow(l, r);
+        case "==":
+          return l === r ? 1 : 0;
+        case "!=":
+          return l !== r ? 1 : 0;
+        case "<":
+          return l < r ? 1 : 0;
+        case "<=":
+          return l <= r ? 1 : 0;
+        case ">":
+          return l > r ? 1 : 0;
+        case ">=":
+          return l >= r ? 1 : 0;
+        default:
+          throw new FormulaError(`Unknown operator '${node.op}'`);
+      }
+    }
+    case "call": {
+      const fn = opts.functions[node.name] ?? BUILTIN_FUNCTIONS[node.name];
+      if (!fn) throw new FormulaError(`Unknown function '${node.name}'`);
+      const args = node.args.map((a) => evalNode(a, opts, d));
+      return fn(...args);
+    }
+    case "conditional": {
+      const cond = evalNode(node.condition, opts, d);
+      return cond !== 0 ? evalNode(node.consequent, opts, d) : evalNode(node.alternate, opts, d);
+    }
+  }
+}
+function evalAST(node, opts = {}) {
+  const resolved = {
+    vars: opts.vars ?? {},
+    functions: opts.functions ?? {},
+    maxDepth: opts.maxDepth ?? 200
+  };
+  return evalNode(node, resolved, 0);
+}
+
+// src/formula.ts
+function compile(expr) {
+  const ast = parse(expr);
+  return new CompiledFormula(ast, expr);
+}
+function evaluate(expr, vars, opts) {
+  const ast = parse(expr);
+  return evalAST(ast, { ...opts, vars });
+}
+function tryEvaluate(expr, vars, opts) {
+  try {
+    return evaluate(expr, vars, opts);
+  } catch {
+    return null;
+  }
+}
+var CompiledFormula = class {
+  constructor(ast, source) {
+    this._ast = ast;
+    this.source = source;
+  }
+  evaluate(vars, opts) {
+    return evalAST(this._ast, { ...opts, vars });
+  }
+  /** Return all variable names referenced in this formula. */
+  variables() {
+    const names = /* @__PURE__ */ new Set();
+    collectVars(this._ast, names);
+    return [...names].sort();
+  }
+};
+function collectVars(node, out) {
+  switch (node.kind) {
+    case "number":
+      break;
+    case "identifier":
+      out.add(node.name);
+      break;
+    case "unary":
+      collectVars(node.operand, out);
+      break;
+    case "binary":
+      collectVars(node.left, out);
+      collectVars(node.right, out);
+      break;
+    case "call":
+      node.args.forEach((a) => collectVars(a, out));
+      break;
+    case "conditional":
+      collectVars(node.condition, out);
+      collectVars(node.consequent, out);
+      collectVars(node.alternate, out);
+      break;
+  }
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  BUILTIN_FUNCTIONS,
+  BUILTIN_VARS,
+  CompiledFormula,
+  FormulaError,
+  compile,
+  evalAST,
+  evaluate,
+  parse,
+  tryEvaluate
+});
+//# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts","../src/types.ts","../src/lexer.ts","../src/parser.ts","../src/builtins.ts","../src/evaluator.ts","../src/formula.ts"],"sourcesContent":["export type { Value, Variables, FunctionMap, EvalOptions, ASTNode } from \"./types.js\";\nexport { FormulaError } from \"./types.js\";\nexport { parse } from \"./parser.js\";\nexport { evalAST } from \"./evaluator.js\";\nexport { evaluate, tryEvaluate, compile, CompiledFormula } from \"./formula.js\";\nexport { BUILTIN_VARS, BUILTIN_FUNCTIONS } from \"./builtins.js\";\n","export type Value = number;\n\nexport type Variables = Record<string, Value>;\n\nexport type FunctionMap = Record<string, (...args: Value[]) => Value>;\n\nexport interface EvalOptions {\n  vars?: Variables;\n  functions?: FunctionMap;\n  maxDepth?: number;\n}\n\nexport class FormulaError extends Error {\n  constructor(\n    message: string,\n    public readonly position?: number\n  ) {\n    super(message);\n    this.name = \"FormulaError\";\n  }\n}\n\n// ── AST node types ────────────────────────────────────────────────────────────\n\nexport type NodeKind =\n  | \"number\"\n  | \"identifier\"\n  | \"binary\"\n  | \"unary\"\n  | \"call\"\n  | \"conditional\";\n\nexport interface NumberNode {\n  kind: \"number\";\n  value: number;\n}\n\nexport interface IdentifierNode {\n  kind: \"identifier\";\n  name: string;\n}\n\nexport interface BinaryNode {\n  kind: \"binary\";\n  op: string;\n  left: ASTNode;\n  right: ASTNode;\n}\n\nexport interface UnaryNode {\n  kind: \"unary\";\n  op: string;\n  operand: ASTNode;\n}\n\nexport interface CallNode {\n  kind: \"call\";\n  name: string;\n  args: ASTNode[];\n}\n\nexport interface ConditionalNode {\n  kind: \"conditional\";\n  condition: ASTNode;\n  consequent: ASTNode;\n  alternate: ASTNode;\n}\n\nexport type ASTNode =\n  | NumberNode\n  | IdentifierNode\n  | BinaryNode\n  | UnaryNode\n  | CallNode\n  | ConditionalNode;\n","import { FormulaError } from \"./types.js\";\n\nexport const enum TT {\n  Number     = \"Number\",\n  Ident      = \"Ident\",\n  Plus       = \"+\",\n  Minus      = \"-\",\n  Star       = \"*\",\n  Slash      = \"/\",\n  Percent    = \"%\",\n  Caret      = \"^\",\n  LParen     = \"(\",\n  RParen     = \")\",\n  Comma      = \",\",\n  Question   = \"?\",\n  Colon      = \":\",\n  Eq         = \"==\",\n  NEq        = \"!=\",\n  Lt         = \"<\",\n  Lte        = \"<=\",\n  Gt         = \">\",\n  Gte        = \">=\",\n  And        = \"&&\",\n  Or         = \"||\",\n  Not        = \"!\",\n  EOF        = \"EOF\",\n}\n\nexport interface Token {\n  type: TT;\n  raw: string;\n  pos: number;\n}\n\nexport function tokenize(src: string): Token[] {\n  const tokens: Token[] = [];\n  let i = 0;\n\n  while (i < src.length) {\n    // skip whitespace\n    if (/\\s/.test(src[i])) { i++; continue; }\n\n    const pos = i;\n    const ch = src[i];\n\n    // numbers (int or float, optional exponent)\n    if (/[0-9]/.test(ch) || (ch === \".\" && /[0-9]/.test(src[i + 1] ?? \"\"))) {\n      let raw = \"\";\n      while (i < src.length && /[0-9.]/.test(src[i])) raw += src[i++];\n      if (src[i] === \"e\" || src[i] === \"E\") {\n        raw += src[i++];\n        if (src[i] === \"+\" || src[i] === \"-\") raw += src[i++];\n        while (i < src.length && /[0-9]/.test(src[i])) raw += src[i++];\n      }\n      tokens.push({ type: TT.Number, raw, pos });\n      continue;\n    }\n\n    // identifiers and keywords (only PI/E)\n    if (/[a-zA-Z_]/.test(ch)) {\n      let raw = \"\";\n      while (i < src.length && /[a-zA-Z0-9_]/.test(src[i])) raw += src[i++];\n      tokens.push({ type: TT.Ident, raw, pos });\n      continue;\n    }\n\n    // two-char operators\n    const two = src.slice(i, i + 2);\n    if (two === \"==\" || two === \"!=\" || two === \"<=\" || two === \">=\" || two === \"&&\" || two === \"||\") {\n      tokens.push({ type: two as TT, raw: two, pos });\n      i += 2;\n      continue;\n    }\n\n    // one-char operators\n    const singles: Record<string, TT> = {\n      \"+\": TT.Plus, \"-\": TT.Minus, \"*\": TT.Star, \"/\": TT.Slash,\n      \"%\": TT.Percent, \"^\": TT.Caret,\n      \"(\": TT.LParen, \")\": TT.RParen, \",\": TT.Comma,\n      \"?\": TT.Question, \":\": TT.Colon,\n      \"<\": TT.Lt, \">\": TT.Gt, \"!\": TT.Not,\n    };\n    if (ch in singles) {\n      tokens.push({ type: singles[ch], raw: ch, pos });\n      i++;\n      continue;\n    }\n\n    throw new FormulaError(`Unexpected character '${ch}'`, pos);\n  }\n\n  tokens.push({ type: TT.EOF, raw: \"\", pos: i });\n  return tokens;\n}\n","import { tokenize, Token, TT } from \"./lexer.js\";\nimport {\n  ASTNode, NumberNode, IdentifierNode, BinaryNode,\n  UnaryNode, CallNode, ConditionalNode, FormulaError,\n} from \"./types.js\";\n\n// Pratt parser (top-down operator precedence)\n\nconst BP: Partial<Record<TT, number>> = {\n  [TT.Or]:      10,\n  [TT.And]:     20,\n  [TT.Eq]:      30, [TT.NEq]: 30,\n  [TT.Lt]:      40, [TT.Lte]: 40, [TT.Gt]: 40, [TT.Gte]: 40,\n  [TT.Plus]:    50, [TT.Minus]: 50,\n  [TT.Star]:    60, [TT.Slash]: 60, [TT.Percent]: 60,\n  [TT.Caret]:   70,  // right-assoc → parse at BP-1\n};\n\nclass Parser {\n  private tokens: Token[];\n  private pos: number = 0;\n\n  constructor(src: string) {\n    this.tokens = tokenize(src);\n  }\n\n  private peek(): Token { return this.tokens[this.pos]; }\n  private consume(): Token { return this.tokens[this.pos++]; }\n  private expect(type: TT): Token {\n    const t = this.consume();\n    if (t.type !== type) throw new FormulaError(`Expected '${type}' but got '${t.raw}'`, t.pos);\n    return t;\n  }\n\n  parse(): ASTNode {\n    const node = this.expr(0);\n    if (this.peek().type !== TT.EOF) {\n      const t = this.peek();\n      throw new FormulaError(`Unexpected token '${t.raw}'`, t.pos);\n    }\n    return node;\n  }\n\n  private expr(minBP: number): ASTNode {\n    let left = this.prefix();\n\n    while (true) {\n      const t = this.peek();\n\n      // ternary ?  :\n      if (t.type === TT.Question && minBP < 5) {\n        this.consume();\n        const consequent = this.expr(0);\n        this.expect(TT.Colon);\n        const alternate = this.expr(0);\n        left = { kind: \"conditional\", condition: left, consequent, alternate } as ConditionalNode;\n        continue;\n      }\n\n      const bp = BP[t.type as TT];\n      if (bp === undefined || bp <= minBP) break;\n\n      this.consume();\n      const rightBP = t.type === TT.Caret ? bp - 1 : bp; // ^ is right-assoc\n      const right = this.expr(rightBP);\n      left = { kind: \"binary\", op: t.type, left, right } as BinaryNode;\n    }\n\n    return left;\n  }\n\n  private prefix(): ASTNode {\n    const t = this.peek();\n\n    if (t.type === TT.Number) {\n      this.consume();\n      return { kind: \"number\", value: parseFloat(t.raw) } as NumberNode;\n    }\n\n    if (t.type === TT.Ident) {\n      this.consume();\n      // function call?\n      if (this.peek().type === TT.LParen) {\n        this.consume(); // (\n        const args: ASTNode[] = [];\n        if (this.peek().type !== TT.RParen) {\n          args.push(this.expr(0));\n          while (this.peek().type === TT.Comma) {\n            this.consume();\n            args.push(this.expr(0));\n          }\n        }\n        this.expect(TT.RParen);\n        return { kind: \"call\", name: t.raw, args } as CallNode;\n      }\n      return { kind: \"identifier\", name: t.raw } as IdentifierNode;\n    }\n\n    if (t.type === TT.Minus) {\n      this.consume();\n      return { kind: \"unary\", op: \"-\", operand: this.expr(65) } as UnaryNode;\n    }\n\n    if (t.type === TT.Not) {\n      this.consume();\n      return { kind: \"unary\", op: \"!\", operand: this.expr(65) } as UnaryNode;\n    }\n\n    if (t.type === TT.Plus) {\n      this.consume();\n      return this.expr(65); // unary +\n    }\n\n    if (t.type === TT.LParen) {\n      this.consume();\n      const inner = this.expr(0);\n      this.expect(TT.RParen);\n      return inner;\n    }\n\n    throw new FormulaError(`Unexpected token '${t.raw}'`, t.pos);\n  }\n}\n\nexport function parse(src: string): ASTNode {\n  return new Parser(src).parse();\n}\n","import { FunctionMap, Variables } from \"./types.js\";\n\nexport const BUILTIN_VARS: Variables = {\n  PI:  Math.PI,\n  E:   Math.E,\n  LN2: Math.LN2,\n  LN10: Math.LN10,\n  LOG2E: Math.LOG2E,\n  LOG10E: Math.LOG10E,\n  SQRT2: Math.SQRT2,\n  Infinity: Infinity,\n  NaN: NaN,\n};\n\nexport const BUILTIN_FUNCTIONS: FunctionMap = {\n  abs:   (x) => Math.abs(x),\n  ceil:  (x) => Math.ceil(x),\n  floor: (x) => Math.floor(x),\n  round: (x) => Math.round(x),\n  trunc: (x) => Math.trunc(x),\n  sign:  (x) => Math.sign(x),\n\n  sqrt:  (x) => Math.sqrt(x),\n  cbrt:  (x) => Math.cbrt(x),\n  pow:   (x, y) => Math.pow(x, y),\n  exp:   (x) => Math.exp(x),\n  log:   (x) => Math.log(x),\n  log2:  (x) => Math.log2(x),\n  log10: (x) => Math.log10(x),\n\n  sin:   (x) => Math.sin(x),\n  cos:   (x) => Math.cos(x),\n  tan:   (x) => Math.tan(x),\n  asin:  (x) => Math.asin(x),\n  acos:  (x) => Math.acos(x),\n  atan:  (x) => Math.atan(x),\n  atan2: (y, x) => Math.atan2(y, x),\n  sinh:  (x) => Math.sinh(x),\n  cosh:  (x) => Math.cosh(x),\n  tanh:  (x) => Math.tanh(x),\n\n  min:   (...args) => Math.min(...args),\n  max:   (...args) => Math.max(...args),\n  clamp: (x, lo, hi) => Math.min(Math.max(x, lo), hi),\n\n  hypot: (...args) => Math.hypot(...args),\n\n  random: () => Math.random(),\n\n  isNaN:    (x) => (isNaN(x) ? 1 : 0),\n  isFinite: (x) => (isFinite(x) ? 1 : 0),\n};\n","import { ASTNode, EvalOptions, FormulaError, Value } from \"./types.js\";\nimport { BUILTIN_VARS, BUILTIN_FUNCTIONS } from \"./builtins.js\";\n\nfunction evalNode(node: ASTNode, opts: Required<EvalOptions>, depth: number): Value {\n  if (depth > opts.maxDepth) throw new FormulaError(\"Maximum recursion depth exceeded\");\n\n  const d = depth + 1;\n\n  switch (node.kind) {\n    case \"number\":\n      return node.value;\n\n    case \"identifier\": {\n      const name = node.name;\n      if (name in opts.vars) return opts.vars[name];\n      if (name in BUILTIN_VARS) return BUILTIN_VARS[name];\n      throw new FormulaError(`Unknown variable '${name}'`);\n    }\n\n    case \"unary\": {\n      const v = evalNode(node.operand, opts, d);\n      if (node.op === \"-\") return -v;\n      if (node.op === \"!\") return v === 0 ? 1 : 0;\n      throw new FormulaError(`Unknown unary operator '${node.op}'`);\n    }\n\n    case \"binary\": {\n      const l = evalNode(node.left, opts, d);\n      // short-circuit for && / ||\n      if (node.op === \"&&\") return (l !== 0 ? evalNode(node.right, opts, d) : 0);\n      if (node.op === \"||\") return (l !== 0 ? l : evalNode(node.right, opts, d));\n\n      const r = evalNode(node.right, opts, d);\n      switch (node.op) {\n        case \"+\": return l + r;\n        case \"-\": return l - r;\n        case \"*\": return l * r;\n        case \"/\":\n          if (r === 0) throw new FormulaError(\"Division by zero\");\n          return l / r;\n        case \"%\":\n          if (r === 0) throw new FormulaError(\"Modulo by zero\");\n          return l % r;\n        case \"^\": return Math.pow(l, r);\n        case \"==\": return l === r ? 1 : 0;\n        case \"!=\": return l !== r ? 1 : 0;\n        case \"<\":  return l < r ? 1 : 0;\n        case \"<=\": return l <= r ? 1 : 0;\n        case \">\":  return l > r ? 1 : 0;\n        case \">=\": return l >= r ? 1 : 0;\n        default:\n          throw new FormulaError(`Unknown operator '${node.op}'`);\n      }\n    }\n\n    case \"call\": {\n      const fn = opts.functions[node.name] ?? BUILTIN_FUNCTIONS[node.name];\n      if (!fn) throw new FormulaError(`Unknown function '${node.name}'`);\n      const args = node.args.map((a) => evalNode(a, opts, d));\n      return fn(...args);\n    }\n\n    case \"conditional\": {\n      const cond = evalNode(node.condition, opts, d);\n      return cond !== 0\n        ? evalNode(node.consequent, opts, d)\n        : evalNode(node.alternate, opts, d);\n    }\n  }\n}\n\nexport function evalAST(node: ASTNode, opts: EvalOptions = {}): Value {\n  const resolved: Required<EvalOptions> = {\n    vars: opts.vars ?? {},\n    functions: opts.functions ?? {},\n    maxDepth: opts.maxDepth ?? 200,\n  };\n  return evalNode(node, resolved, 0);\n}\n","import { parse } from \"./parser.js\";\nimport { evalAST } from \"./evaluator.js\";\nimport { ASTNode, EvalOptions, Value } from \"./types.js\";\n\n/**\n * Parse an expression string into an AST (reuse for repeated evaluations).\n */\nexport function compile(expr: string): CompiledFormula {\n  const ast = parse(expr);\n  return new CompiledFormula(ast, expr);\n}\n\n/**\n * Parse and evaluate an expression in one step.\n */\nexport function evaluate(expr: string, vars?: Record<string, Value>, opts?: Omit<EvalOptions, \"vars\">): Value {\n  const ast = parse(expr);\n  return evalAST(ast, { ...opts, vars });\n}\n\n/**\n * Parse and evaluate, returning null instead of throwing on parse/eval errors.\n */\nexport function tryEvaluate(expr: string, vars?: Record<string, Value>, opts?: Omit<EvalOptions, \"vars\">): Value | null {\n  try { return evaluate(expr, vars, opts); }\n  catch { return null; }\n}\n\nexport class CompiledFormula {\n  readonly source: string;\n  private readonly _ast: ASTNode;\n\n  constructor(ast: ASTNode, source: string) {\n    this._ast = ast;\n    this.source = source;\n  }\n\n  evaluate(vars?: Record<string, Value>, opts?: Omit<EvalOptions, \"vars\">): Value {\n    return evalAST(this._ast, { ...opts, vars });\n  }\n\n  /** Return all variable names referenced in this formula. */\n  variables(): string[] {\n    const names = new Set<string>();\n    collectVars(this._ast, names);\n    return [...names].sort();\n  }\n}\n\nfunction collectVars(node: ASTNode, out: Set<string>): void {\n  switch (node.kind) {\n    case \"number\": break;\n    case \"identifier\": out.add(node.name); break;\n    case \"unary\": collectVars(node.operand, out); break;\n    case \"binary\": collectVars(node.left, out); collectVars(node.right, out); break;\n    case \"call\": node.args.forEach((a) => collectVars(a, out)); break;\n    case \"conditional\":\n      collectVars(node.condition, out);\n      collectVars(node.consequent, out);\n      collectVars(node.alternate, out);\n      break;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACYO,IAAM,eAAN,cAA2B,MAAM;AAAA,EACtC,YACE,SACgB,UAChB;AACA,UAAM,OAAO;AAFG;AAGhB,SAAK,OAAO;AAAA,EACd;AACF;;;ACcO,SAAS,SAAS,KAAsB;AAC7C,QAAM,SAAkB,CAAC;AACzB,MAAI,IAAI;AAER,SAAO,IAAI,IAAI,QAAQ;AAErB,QAAI,KAAK,KAAK,IAAI,CAAC,CAAC,GAAG;AAAE;AAAK;AAAA,IAAU;AAExC,UAAM,MAAM;AACZ,UAAM,KAAK,IAAI,CAAC;AAGhB,QAAI,QAAQ,KAAK,EAAE,KAAM,OAAO,OAAO,QAAQ,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,GAAI;AACtE,UAAI,MAAM;AACV,aAAO,IAAI,IAAI,UAAU,SAAS,KAAK,IAAI,CAAC,CAAC,EAAG,QAAO,IAAI,GAAG;AAC9D,UAAI,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,MAAM,KAAK;AACpC,eAAO,IAAI,GAAG;AACd,YAAI,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,MAAM,IAAK,QAAO,IAAI,GAAG;AACpD,eAAO,IAAI,IAAI,UAAU,QAAQ,KAAK,IAAI,CAAC,CAAC,EAAG,QAAO,IAAI,GAAG;AAAA,MAC/D;AACA,aAAO,KAAK,EAAE,MAAM,uBAAW,KAAK,IAAI,CAAC;AACzC;AAAA,IACF;AAGA,QAAI,YAAY,KAAK,EAAE,GAAG;AACxB,UAAI,MAAM;AACV,aAAO,IAAI,IAAI,UAAU,eAAe,KAAK,IAAI,CAAC,CAAC,EAAG,QAAO,IAAI,GAAG;AACpE,aAAO,KAAK,EAAE,MAAM,qBAAU,KAAK,IAAI,CAAC;AACxC;AAAA,IACF;AAGA,UAAM,MAAM,IAAI,MAAM,GAAG,IAAI,CAAC;AAC9B,QAAI,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,MAAM;AAChG,aAAO,KAAK,EAAE,MAAM,KAAW,KAAK,KAAK,IAAI,CAAC;AAC9C,WAAK;AACL;AAAA,IACF;AAGA,UAAM,UAA8B;AAAA,MAClC,KAAK;AAAA,MAAS,KAAK;AAAA,MAAU,KAAK;AAAA,MAAS,KAAK;AAAA,MAChD,KAAK;AAAA,MAAY,KAAK;AAAA,MACtB,KAAK;AAAA,MAAW,KAAK;AAAA,MAAW,KAAK;AAAA,MACrC,KAAK;AAAA,MAAa,KAAK;AAAA,MACvB,KAAK;AAAA,MAAO,KAAK;AAAA,MAAO,KAAK;AAAA,IAC/B;AACA,QAAI,MAAM,SAAS;AACjB,aAAO,KAAK,EAAE,MAAM,QAAQ,EAAE,GAAG,KAAK,IAAI,IAAI,CAAC;AAC/C;AACA;AAAA,IACF;AAEA,UAAM,IAAI,aAAa,yBAAyB,EAAE,KAAK,GAAG;AAAA,EAC5D;AAEA,SAAO,KAAK,EAAE,MAAM,iBAAQ,KAAK,IAAI,KAAK,EAAE,CAAC;AAC7C,SAAO;AACT;;;ACrFA,IAAM,KAAkC;AAAA,EACtC,cAAM,GAAQ;AAAA,EACd,eAAO,GAAO;AAAA,EACd,cAAM,GAAQ;AAAA,EAAI,eAAO,GAAG;AAAA,EAC5B,aAAM,GAAQ;AAAA,EAAI,eAAO,GAAG;AAAA,EAAI,aAAM,GAAG;AAAA,EAAI,eAAO,GAAG;AAAA,EACvD,eAAQ,GAAM;AAAA,EAAI,gBAAS,GAAG;AAAA,EAC9B,eAAQ,GAAM;AAAA,EAAI,gBAAS,GAAG;AAAA,EAAI,kBAAW,GAAG;AAAA,EAChD,gBAAS,GAAK;AAAA;AAChB;AAEA,IAAM,SAAN,MAAa;AAAA,EAIX,YAAY,KAAa;AAFzB,SAAQ,MAAc;AAGpB,SAAK,SAAS,SAAS,GAAG;AAAA,EAC5B;AAAA,EAEQ,OAAc;AAAE,WAAO,KAAK,OAAO,KAAK,GAAG;AAAA,EAAG;AAAA,EAC9C,UAAiB;AAAE,WAAO,KAAK,OAAO,KAAK,KAAK;AAAA,EAAG;AAAA,EACnD,OAAO,MAAiB;AAC9B,UAAM,IAAI,KAAK,QAAQ;AACvB,QAAI,EAAE,SAAS,KAAM,OAAM,IAAI,aAAa,aAAa,IAAI,cAAc,EAAE,GAAG,KAAK,EAAE,GAAG;AAC1F,WAAO;AAAA,EACT;AAAA,EAEA,QAAiB;AACf,UAAM,OAAO,KAAK,KAAK,CAAC;AACxB,QAAI,KAAK,KAAK,EAAE,0BAAiB;AAC/B,YAAM,IAAI,KAAK,KAAK;AACpB,YAAM,IAAI,aAAa,qBAAqB,EAAE,GAAG,KAAK,EAAE,GAAG;AAAA,IAC7D;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,KAAK,OAAwB;AACnC,QAAI,OAAO,KAAK,OAAO;AAEvB,WAAO,MAAM;AACX,YAAM,IAAI,KAAK,KAAK;AAGpB,UAAI,EAAE,+BAAwB,QAAQ,GAAG;AACvC,aAAK,QAAQ;AACb,cAAM,aAAa,KAAK,KAAK,CAAC;AAC9B,aAAK,sBAAe;AACpB,cAAM,YAAY,KAAK,KAAK,CAAC;AAC7B,eAAO,EAAE,MAAM,eAAe,WAAW,MAAM,YAAY,UAAU;AACrE;AAAA,MACF;AAEA,YAAM,KAAK,GAAG,EAAE,IAAU;AAC1B,UAAI,OAAO,UAAa,MAAM,MAAO;AAErC,WAAK,QAAQ;AACb,YAAM,UAAU,EAAE,2BAAoB,KAAK,IAAI;AAC/C,YAAM,QAAQ,KAAK,KAAK,OAAO;AAC/B,aAAO,EAAE,MAAM,UAAU,IAAI,EAAE,MAAM,MAAM,MAAM;AAAA,IACnD;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,SAAkB;AACxB,UAAM,IAAI,KAAK,KAAK;AAEpB,QAAI,EAAE,gCAAoB;AACxB,WAAK,QAAQ;AACb,aAAO,EAAE,MAAM,UAAU,OAAO,WAAW,EAAE,GAAG,EAAE;AAAA,IACpD;AAEA,QAAI,EAAE,8BAAmB;AACvB,WAAK,QAAQ;AAEb,UAAI,KAAK,KAAK,EAAE,2BAAoB;AAClC,aAAK,QAAQ;AACb,cAAM,OAAkB,CAAC;AACzB,YAAI,KAAK,KAAK,EAAE,2BAAoB;AAClC,eAAK,KAAK,KAAK,KAAK,CAAC,CAAC;AACtB,iBAAO,KAAK,KAAK,EAAE,0BAAmB;AACpC,iBAAK,QAAQ;AACb,iBAAK,KAAK,KAAK,KAAK,CAAC,CAAC;AAAA,UACxB;AAAA,QACF;AACA,aAAK,uBAAgB;AACrB,eAAO,EAAE,MAAM,QAAQ,MAAM,EAAE,KAAK,KAAK;AAAA,MAC3C;AACA,aAAO,EAAE,MAAM,cAAc,MAAM,EAAE,IAAI;AAAA,IAC3C;AAEA,QAAI,EAAE,0BAAmB;AACvB,WAAK,QAAQ;AACb,aAAO,EAAE,MAAM,SAAS,IAAI,KAAK,SAAS,KAAK,KAAK,EAAE,EAAE;AAAA,IAC1D;AAEA,QAAI,EAAE,wBAAiB;AACrB,WAAK,QAAQ;AACb,aAAO,EAAE,MAAM,SAAS,IAAI,KAAK,SAAS,KAAK,KAAK,EAAE,EAAE;AAAA,IAC1D;AAEA,QAAI,EAAE,yBAAkB;AACtB,WAAK,QAAQ;AACb,aAAO,KAAK,KAAK,EAAE;AAAA,IACrB;AAEA,QAAI,EAAE,2BAAoB;AACxB,WAAK,QAAQ;AACb,YAAM,QAAQ,KAAK,KAAK,CAAC;AACzB,WAAK,uBAAgB;AACrB,aAAO;AAAA,IACT;AAEA,UAAM,IAAI,aAAa,qBAAqB,EAAE,GAAG,KAAK,EAAE,GAAG;AAAA,EAC7D;AACF;AAEO,SAAS,MAAM,KAAsB;AAC1C,SAAO,IAAI,OAAO,GAAG,EAAE,MAAM;AAC/B;;;AC5HO,IAAM,eAA0B;AAAA,EACrC,IAAK,KAAK;AAAA,EACV,GAAK,KAAK;AAAA,EACV,KAAK,KAAK;AAAA,EACV,MAAM,KAAK;AAAA,EACX,OAAO,KAAK;AAAA,EACZ,QAAQ,KAAK;AAAA,EACb,OAAO,KAAK;AAAA,EACZ,UAAU;AAAA,EACV,KAAK;AACP;AAEO,IAAM,oBAAiC;AAAA,EAC5C,KAAO,CAAC,MAAM,KAAK,IAAI,CAAC;AAAA,EACxB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC;AAAA,EAC1B,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC;AAAA,EAC1B,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC;AAAA,EAC1B,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EAEzB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,KAAO,CAAC,GAAG,MAAM,KAAK,IAAI,GAAG,CAAC;AAAA,EAC9B,KAAO,CAAC,MAAM,KAAK,IAAI,CAAC;AAAA,EACxB,KAAO,CAAC,MAAM,KAAK,IAAI,CAAC;AAAA,EACxB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC;AAAA,EAE1B,KAAO,CAAC,MAAM,KAAK,IAAI,CAAC;AAAA,EACxB,KAAO,CAAC,MAAM,KAAK,IAAI,CAAC;AAAA,EACxB,KAAO,CAAC,MAAM,KAAK,IAAI,CAAC;AAAA,EACxB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,OAAO,CAAC,GAAG,MAAM,KAAK,MAAM,GAAG,CAAC;AAAA,EAChC,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EAEzB,KAAO,IAAI,SAAS,KAAK,IAAI,GAAG,IAAI;AAAA,EACpC,KAAO,IAAI,SAAS,KAAK,IAAI,GAAG,IAAI;AAAA,EACpC,OAAO,CAAC,GAAG,IAAI,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,GAAG,EAAE;AAAA,EAElD,OAAO,IAAI,SAAS,KAAK,MAAM,GAAG,IAAI;AAAA,EAEtC,QAAQ,MAAM,KAAK,OAAO;AAAA,EAE1B,OAAU,CAAC,MAAO,MAAM,CAAC,IAAI,IAAI;AAAA,EACjC,UAAU,CAAC,MAAO,SAAS,CAAC,IAAI,IAAI;AACtC;;;AChDA,SAAS,SAAS,MAAe,MAA6B,OAAsB;AAClF,MAAI,QAAQ,KAAK,SAAU,OAAM,IAAI,aAAa,kCAAkC;AAEpF,QAAM,IAAI,QAAQ;AAElB,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AACH,aAAO,KAAK;AAAA,IAEd,KAAK,cAAc;AACjB,YAAM,OAAO,KAAK;AAClB,UAAI,QAAQ,KAAK,KAAM,QAAO,KAAK,KAAK,IAAI;AAC5C,UAAI,QAAQ,aAAc,QAAO,aAAa,IAAI;AAClD,YAAM,IAAI,aAAa,qBAAqB,IAAI,GAAG;AAAA,IACrD;AAAA,IAEA,KAAK,SAAS;AACZ,YAAM,IAAI,SAAS,KAAK,SAAS,MAAM,CAAC;AACxC,UAAI,KAAK,OAAO,IAAK,QAAO,CAAC;AAC7B,UAAI,KAAK,OAAO,IAAK,QAAO,MAAM,IAAI,IAAI;AAC1C,YAAM,IAAI,aAAa,2BAA2B,KAAK,EAAE,GAAG;AAAA,IAC9D;AAAA,IAEA,KAAK,UAAU;AACb,YAAM,IAAI,SAAS,KAAK,MAAM,MAAM,CAAC;AAErC,UAAI,KAAK,OAAO,KAAM,QAAQ,MAAM,IAAI,SAAS,KAAK,OAAO,MAAM,CAAC,IAAI;AACxE,UAAI,KAAK,OAAO,KAAM,QAAQ,MAAM,IAAI,IAAI,SAAS,KAAK,OAAO,MAAM,CAAC;AAExE,YAAM,IAAI,SAAS,KAAK,OAAO,MAAM,CAAC;AACtC,cAAQ,KAAK,IAAI;AAAA,QACf,KAAK;AAAK,iBAAO,IAAI;AAAA,QACrB,KAAK;AAAK,iBAAO,IAAI;AAAA,QACrB,KAAK;AAAK,iBAAO,IAAI;AAAA,QACrB,KAAK;AACH,cAAI,MAAM,EAAG,OAAM,IAAI,aAAa,kBAAkB;AACtD,iBAAO,IAAI;AAAA,QACb,KAAK;AACH,cAAI,MAAM,EAAG,OAAM,IAAI,aAAa,gBAAgB;AACpD,iBAAO,IAAI;AAAA,QACb,KAAK;AAAK,iBAAO,KAAK,IAAI,GAAG,CAAC;AAAA,QAC9B,KAAK;AAAM,iBAAO,MAAM,IAAI,IAAI;AAAA,QAChC,KAAK;AAAM,iBAAO,MAAM,IAAI,IAAI;AAAA,QAChC,KAAK;AAAM,iBAAO,IAAI,IAAI,IAAI;AAAA,QAC9B,KAAK;AAAM,iBAAO,KAAK,IAAI,IAAI;AAAA,QAC/B,KAAK;AAAM,iBAAO,IAAI,IAAI,IAAI;AAAA,QAC9B,KAAK;AAAM,iBAAO,KAAK,IAAI,IAAI;AAAA,QAC/B;AACE,gBAAM,IAAI,aAAa,qBAAqB,KAAK,EAAE,GAAG;AAAA,MAC1D;AAAA,IACF;AAAA,IAEA,KAAK,QAAQ;AACX,YAAM,KAAK,KAAK,UAAU,KAAK,IAAI,KAAK,kBAAkB,KAAK,IAAI;AACnE,UAAI,CAAC,GAAI,OAAM,IAAI,aAAa,qBAAqB,KAAK,IAAI,GAAG;AACjE,YAAM,OAAO,KAAK,KAAK,IAAI,CAAC,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC;AACtD,aAAO,GAAG,GAAG,IAAI;AAAA,IACnB;AAAA,IAEA,KAAK,eAAe;AAClB,YAAM,OAAO,SAAS,KAAK,WAAW,MAAM,CAAC;AAC7C,aAAO,SAAS,IACZ,SAAS,KAAK,YAAY,MAAM,CAAC,IACjC,SAAS,KAAK,WAAW,MAAM,CAAC;AAAA,IACtC;AAAA,EACF;AACF;AAEO,SAAS,QAAQ,MAAe,OAAoB,CAAC,GAAU;AACpE,QAAM,WAAkC;AAAA,IACtC,MAAM,KAAK,QAAQ,CAAC;AAAA,IACpB,WAAW,KAAK,aAAa,CAAC;AAAA,IAC9B,UAAU,KAAK,YAAY;AAAA,EAC7B;AACA,SAAO,SAAS,MAAM,UAAU,CAAC;AACnC;;;ACvEO,SAAS,QAAQ,MAA+B;AACrD,QAAM,MAAM,MAAM,IAAI;AACtB,SAAO,IAAI,gBAAgB,KAAK,IAAI;AACtC;AAKO,SAAS,SAAS,MAAc,MAA8B,MAAyC;AAC5G,QAAM,MAAM,MAAM,IAAI;AACtB,SAAO,QAAQ,KAAK,EAAE,GAAG,MAAM,KAAK,CAAC;AACvC;AAKO,SAAS,YAAY,MAAc,MAA8B,MAAgD;AACtH,MAAI;AAAE,WAAO,SAAS,MAAM,MAAM,IAAI;AAAA,EAAG,QACnC;AAAE,WAAO;AAAA,EAAM;AACvB;AAEO,IAAM,kBAAN,MAAsB;AAAA,EAI3B,YAAY,KAAc,QAAgB;AACxC,SAAK,OAAO;AACZ,SAAK,SAAS;AAAA,EAChB;AAAA,EAEA,SAAS,MAA8B,MAAyC;AAC9E,WAAO,QAAQ,KAAK,MAAM,EAAE,GAAG,MAAM,KAAK,CAAC;AAAA,EAC7C;AAAA;AAAA,EAGA,YAAsB;AACpB,UAAM,QAAQ,oBAAI,IAAY;AAC9B,gBAAY,KAAK,MAAM,KAAK;AAC5B,WAAO,CAAC,GAAG,KAAK,EAAE,KAAK;AAAA,EACzB;AACF;AAEA,SAAS,YAAY,MAAe,KAAwB;AAC1D,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AAAU;AAAA,IACf,KAAK;AAAc,UAAI,IAAI,KAAK,IAAI;AAAG;AAAA,IACvC,KAAK;AAAS,kBAAY,KAAK,SAAS,GAAG;AAAG;AAAA,IAC9C,KAAK;AAAU,kBAAY,KAAK,MAAM,GAAG;AAAG,kBAAY,KAAK,OAAO,GAAG;AAAG;AAAA,IAC1E,KAAK;AAAQ,WAAK,KAAK,QAAQ,CAAC,MAAM,YAAY,GAAG,GAAG,CAAC;AAAG;AAAA,IAC5D,KAAK;AACH,kBAAY,KAAK,WAAW,GAAG;AAC/B,kBAAY,KAAK,YAAY,GAAG;AAChC,kBAAY,KAAK,WAAW,GAAG;AAC/B;AAAA,EACJ;AACF;","names":[]}

package/dist/index.d.cts

@@ -0,0 +1,73 @@
+type Value = number;
+type Variables = Record<string, Value>;
+type FunctionMap = Record<string, (...args: Value[]) => Value>;
+interface EvalOptions {
+    vars?: Variables;
+    functions?: FunctionMap;
+    maxDepth?: number;
+}
+declare class FormulaError extends Error {
+    readonly position?: number | undefined;
+    constructor(message: string, position?: number | undefined);
+}
+interface NumberNode {
+    kind: "number";
+    value: number;
+}
+interface IdentifierNode {
+    kind: "identifier";
+    name: string;
+}
+interface BinaryNode {
+    kind: "binary";
+    op: string;
+    left: ASTNode;
+    right: ASTNode;
+}
+interface UnaryNode {
+    kind: "unary";
+    op: string;
+    operand: ASTNode;
+}
+interface CallNode {
+    kind: "call";
+    name: string;
+    args: ASTNode[];
+}
+interface ConditionalNode {
+    kind: "conditional";
+    condition: ASTNode;
+    consequent: ASTNode;
+    alternate: ASTNode;
+}
+type ASTNode = NumberNode | IdentifierNode | BinaryNode | UnaryNode | CallNode | ConditionalNode;
+
+declare function parse(src: string): ASTNode;
+
+declare function evalAST(node: ASTNode, opts?: EvalOptions): Value;
+
+/**
+ * Parse an expression string into an AST (reuse for repeated evaluations).
+ */
+declare function compile(expr: string): CompiledFormula;
+/**
+ * Parse and evaluate an expression in one step.
+ */
+declare function evaluate(expr: string, vars?: Record<string, Value>, opts?: Omit<EvalOptions, "vars">): Value;
+/**
+ * Parse and evaluate, returning null instead of throwing on parse/eval errors.
+ */
+declare function tryEvaluate(expr: string, vars?: Record<string, Value>, opts?: Omit<EvalOptions, "vars">): Value | null;
+declare class CompiledFormula {
+    readonly source: string;
+    private readonly _ast;
+    constructor(ast: ASTNode, source: string);
+    evaluate(vars?: Record<string, Value>, opts?: Omit<EvalOptions, "vars">): Value;
+    /** Return all variable names referenced in this formula. */
+    variables(): string[];
+}
+
+declare const BUILTIN_VARS: Variables;
+declare const BUILTIN_FUNCTIONS: FunctionMap;
+
+export { type ASTNode, BUILTIN_FUNCTIONS, BUILTIN_VARS, CompiledFormula, type EvalOptions, FormulaError, type FunctionMap, type Value, type Variables, compile, evalAST, evaluate, parse, tryEvaluate };

package/dist/index.d.ts

@@ -0,0 +1,73 @@
+type Value = number;
+type Variables = Record<string, Value>;
+type FunctionMap = Record<string, (...args: Value[]) => Value>;
+interface EvalOptions {
+    vars?: Variables;
+    functions?: FunctionMap;
+    maxDepth?: number;
+}
+declare class FormulaError extends Error {
+    readonly position?: number | undefined;
+    constructor(message: string, position?: number | undefined);
+}
+interface NumberNode {
+    kind: "number";
+    value: number;
+}
+interface IdentifierNode {
+    kind: "identifier";
+    name: string;
+}
+interface BinaryNode {
+    kind: "binary";
+    op: string;
+    left: ASTNode;
+    right: ASTNode;
+}
+interface UnaryNode {
+    kind: "unary";
+    op: string;
+    operand: ASTNode;
+}
+interface CallNode {
+    kind: "call";
+    name: string;
+    args: ASTNode[];
+}
+interface ConditionalNode {
+    kind: "conditional";
+    condition: ASTNode;
+    consequent: ASTNode;
+    alternate: ASTNode;
+}
+type ASTNode = NumberNode | IdentifierNode | BinaryNode | UnaryNode | CallNode | ConditionalNode;
+
+declare function parse(src: string): ASTNode;
+
+declare function evalAST(node: ASTNode, opts?: EvalOptions): Value;
+
+/**
+ * Parse an expression string into an AST (reuse for repeated evaluations).
+ */
+declare function compile(expr: string): CompiledFormula;
+/**
+ * Parse and evaluate an expression in one step.
+ */
+declare function evaluate(expr: string, vars?: Record<string, Value>, opts?: Omit<EvalOptions, "vars">): Value;
+/**
+ * Parse and evaluate, returning null instead of throwing on parse/eval errors.
+ */
+declare function tryEvaluate(expr: string, vars?: Record<string, Value>, opts?: Omit<EvalOptions, "vars">): Value | null;
+declare class CompiledFormula {
+    readonly source: string;
+    private readonly _ast;
+    constructor(ast: ASTNode, source: string);
+    evaluate(vars?: Record<string, Value>, opts?: Omit<EvalOptions, "vars">): Value;
+    /** Return all variable names referenced in this formula. */
+    variables(): string[];
+}
+
+declare const BUILTIN_VARS: Variables;
+declare const BUILTIN_FUNCTIONS: FunctionMap;
+
+export { type ASTNode, BUILTIN_FUNCTIONS, BUILTIN_VARS, CompiledFormula, type EvalOptions, FormulaError, type FunctionMap, type Value, type Variables, compile, evalAST, evaluate, parse, tryEvaluate };

package/dist/index.js

@@ -0,0 +1,369 @@
+// src/types.ts
+var FormulaError = class extends Error {
+  constructor(message, position) {
+    super(message);
+    this.position = position;
+    this.name = "FormulaError";
+  }
+};
+
+// src/lexer.ts
+function tokenize(src) {
+  const tokens = [];
+  let i = 0;
+  while (i < src.length) {
+    if (/\s/.test(src[i])) {
+      i++;
+      continue;
+    }
+    const pos = i;
+    const ch = src[i];
+    if (/[0-9]/.test(ch) || ch === "." && /[0-9]/.test(src[i + 1] ?? "")) {
+      let raw = "";
+      while (i < src.length && /[0-9.]/.test(src[i])) raw += src[i++];
+      if (src[i] === "e" || src[i] === "E") {
+        raw += src[i++];
+        if (src[i] === "+" || src[i] === "-") raw += src[i++];
+        while (i < src.length && /[0-9]/.test(src[i])) raw += src[i++];
+      }
+      tokens.push({ type: "Number" /* Number */, raw, pos });
+      continue;
+    }
+    if (/[a-zA-Z_]/.test(ch)) {
+      let raw = "";
+      while (i < src.length && /[a-zA-Z0-9_]/.test(src[i])) raw += src[i++];
+      tokens.push({ type: "Ident" /* Ident */, raw, pos });
+      continue;
+    }
+    const two = src.slice(i, i + 2);
+    if (two === "==" || two === "!=" || two === "<=" || two === ">=" || two === "&&" || two === "||") {
+      tokens.push({ type: two, raw: two, pos });
+      i += 2;
+      continue;
+    }
+    const singles = {
+      "+": "+" /* Plus */,
+      "-": "-" /* Minus */,
+      "*": "*" /* Star */,
+      "/": "/" /* Slash */,
+      "%": "%" /* Percent */,
+      "^": "^" /* Caret */,
+      "(": "(" /* LParen */,
+      ")": ")" /* RParen */,
+      ",": "," /* Comma */,
+      "?": "?" /* Question */,
+      ":": ":" /* Colon */,
+      "<": "<" /* Lt */,
+      ">": ">" /* Gt */,
+      "!": "!" /* Not */
+    };
+    if (ch in singles) {
+      tokens.push({ type: singles[ch], raw: ch, pos });
+      i++;
+      continue;
+    }
+    throw new FormulaError(`Unexpected character '${ch}'`, pos);
+  }
+  tokens.push({ type: "EOF" /* EOF */, raw: "", pos: i });
+  return tokens;
+}
+
+// src/parser.ts
+var BP = {
+  ["||" /* Or */]: 10,
+  ["&&" /* And */]: 20,
+  ["==" /* Eq */]: 30,
+  ["!=" /* NEq */]: 30,
+  ["<" /* Lt */]: 40,
+  ["<=" /* Lte */]: 40,
+  [">" /* Gt */]: 40,
+  [">=" /* Gte */]: 40,
+  ["+" /* Plus */]: 50,
+  ["-" /* Minus */]: 50,
+  ["*" /* Star */]: 60,
+  ["/" /* Slash */]: 60,
+  ["%" /* Percent */]: 60,
+  ["^" /* Caret */]: 70
+  // right-assoc → parse at BP-1
+};
+var Parser = class {
+  constructor(src) {
+    this.pos = 0;
+    this.tokens = tokenize(src);
+  }
+  peek() {
+    return this.tokens[this.pos];
+  }
+  consume() {
+    return this.tokens[this.pos++];
+  }
+  expect(type) {
+    const t = this.consume();
+    if (t.type !== type) throw new FormulaError(`Expected '${type}' but got '${t.raw}'`, t.pos);
+    return t;
+  }
+  parse() {
+    const node = this.expr(0);
+    if (this.peek().type !== "EOF" /* EOF */) {
+      const t = this.peek();
+      throw new FormulaError(`Unexpected token '${t.raw}'`, t.pos);
+    }
+    return node;
+  }
+  expr(minBP) {
+    let left = this.prefix();
+    while (true) {
+      const t = this.peek();
+      if (t.type === "?" /* Question */ && minBP < 5) {
+        this.consume();
+        const consequent = this.expr(0);
+        this.expect(":" /* Colon */);
+        const alternate = this.expr(0);
+        left = { kind: "conditional", condition: left, consequent, alternate };
+        continue;
+      }
+      const bp = BP[t.type];
+      if (bp === void 0 || bp <= minBP) break;
+      this.consume();
+      const rightBP = t.type === "^" /* Caret */ ? bp - 1 : bp;
+      const right = this.expr(rightBP);
+      left = { kind: "binary", op: t.type, left, right };
+    }
+    return left;
+  }
+  prefix() {
+    const t = this.peek();
+    if (t.type === "Number" /* Number */) {
+      this.consume();
+      return { kind: "number", value: parseFloat(t.raw) };
+    }
+    if (t.type === "Ident" /* Ident */) {
+      this.consume();
+      if (this.peek().type === "(" /* LParen */) {
+        this.consume();
+        const args = [];
+        if (this.peek().type !== ")" /* RParen */) {
+          args.push(this.expr(0));
+          while (this.peek().type === "," /* Comma */) {
+            this.consume();
+            args.push(this.expr(0));
+          }
+        }
+        this.expect(")" /* RParen */);
+        return { kind: "call", name: t.raw, args };
+      }
+      return { kind: "identifier", name: t.raw };
+    }
+    if (t.type === "-" /* Minus */) {
+      this.consume();
+      return { kind: "unary", op: "-", operand: this.expr(65) };
+    }
+    if (t.type === "!" /* Not */) {
+      this.consume();
+      return { kind: "unary", op: "!", operand: this.expr(65) };
+    }
+    if (t.type === "+" /* Plus */) {
+      this.consume();
+      return this.expr(65);
+    }
+    if (t.type === "(" /* LParen */) {
+      this.consume();
+      const inner = this.expr(0);
+      this.expect(")" /* RParen */);
+      return inner;
+    }
+    throw new FormulaError(`Unexpected token '${t.raw}'`, t.pos);
+  }
+};
+function parse(src) {
+  return new Parser(src).parse();
+}
+
+// src/builtins.ts
+var BUILTIN_VARS = {
+  PI: Math.PI,
+  E: Math.E,
+  LN2: Math.LN2,
+  LN10: Math.LN10,
+  LOG2E: Math.LOG2E,
+  LOG10E: Math.LOG10E,
+  SQRT2: Math.SQRT2,
+  Infinity: Infinity,
+  NaN: NaN
+};
+var BUILTIN_FUNCTIONS = {
+  abs: (x) => Math.abs(x),
+  ceil: (x) => Math.ceil(x),
+  floor: (x) => Math.floor(x),
+  round: (x) => Math.round(x),
+  trunc: (x) => Math.trunc(x),
+  sign: (x) => Math.sign(x),
+  sqrt: (x) => Math.sqrt(x),
+  cbrt: (x) => Math.cbrt(x),
+  pow: (x, y) => Math.pow(x, y),
+  exp: (x) => Math.exp(x),
+  log: (x) => Math.log(x),
+  log2: (x) => Math.log2(x),
+  log10: (x) => Math.log10(x),
+  sin: (x) => Math.sin(x),
+  cos: (x) => Math.cos(x),
+  tan: (x) => Math.tan(x),
+  asin: (x) => Math.asin(x),
+  acos: (x) => Math.acos(x),
+  atan: (x) => Math.atan(x),
+  atan2: (y, x) => Math.atan2(y, x),
+  sinh: (x) => Math.sinh(x),
+  cosh: (x) => Math.cosh(x),
+  tanh: (x) => Math.tanh(x),
+  min: (...args) => Math.min(...args),
+  max: (...args) => Math.max(...args),
+  clamp: (x, lo, hi) => Math.min(Math.max(x, lo), hi),
+  hypot: (...args) => Math.hypot(...args),
+  random: () => Math.random(),
+  isNaN: (x) => isNaN(x) ? 1 : 0,
+  isFinite: (x) => isFinite(x) ? 1 : 0
+};
+
+// src/evaluator.ts
+function evalNode(node, opts, depth) {
+  if (depth > opts.maxDepth) throw new FormulaError("Maximum recursion depth exceeded");
+  const d = depth + 1;
+  switch (node.kind) {
+    case "number":
+      return node.value;
+    case "identifier": {
+      const name = node.name;
+      if (name in opts.vars) return opts.vars[name];
+      if (name in BUILTIN_VARS) return BUILTIN_VARS[name];
+      throw new FormulaError(`Unknown variable '${name}'`);
+    }
+    case "unary": {
+      const v = evalNode(node.operand, opts, d);
+      if (node.op === "-") return -v;
+      if (node.op === "!") return v === 0 ? 1 : 0;
+      throw new FormulaError(`Unknown unary operator '${node.op}'`);
+    }
+    case "binary": {
+      const l = evalNode(node.left, opts, d);
+      if (node.op === "&&") return l !== 0 ? evalNode(node.right, opts, d) : 0;
+      if (node.op === "||") return l !== 0 ? l : evalNode(node.right, opts, d);
+      const r = evalNode(node.right, opts, d);
+      switch (node.op) {
+        case "+":
+          return l + r;
+        case "-":
+          return l - r;
+        case "*":
+          return l * r;
+        case "/":
+          if (r === 0) throw new FormulaError("Division by zero");
+          return l / r;
+        case "%":
+          if (r === 0) throw new FormulaError("Modulo by zero");
+          return l % r;
+        case "^":
+          return Math.pow(l, r);
+        case "==":
+          return l === r ? 1 : 0;
+        case "!=":
+          return l !== r ? 1 : 0;
+        case "<":
+          return l < r ? 1 : 0;
+        case "<=":
+          return l <= r ? 1 : 0;
+        case ">":
+          return l > r ? 1 : 0;
+        case ">=":
+          return l >= r ? 1 : 0;
+        default:
+          throw new FormulaError(`Unknown operator '${node.op}'`);
+      }
+    }
+    case "call": {
+      const fn = opts.functions[node.name] ?? BUILTIN_FUNCTIONS[node.name];
+      if (!fn) throw new FormulaError(`Unknown function '${node.name}'`);
+      const args = node.args.map((a) => evalNode(a, opts, d));
+      return fn(...args);
+    }
+    case "conditional": {
+      const cond = evalNode(node.condition, opts, d);
+      return cond !== 0 ? evalNode(node.consequent, opts, d) : evalNode(node.alternate, opts, d);
+    }
+  }
+}
+function evalAST(node, opts = {}) {
+  const resolved = {
+    vars: opts.vars ?? {},
+    functions: opts.functions ?? {},
+    maxDepth: opts.maxDepth ?? 200
+  };
+  return evalNode(node, resolved, 0);
+}
+
+// src/formula.ts
+function compile(expr) {
+  const ast = parse(expr);
+  return new CompiledFormula(ast, expr);
+}
+function evaluate(expr, vars, opts) {
+  const ast = parse(expr);
+  return evalAST(ast, { ...opts, vars });
+}
+function tryEvaluate(expr, vars, opts) {
+  try {
+    return evaluate(expr, vars, opts);
+  } catch {
+    return null;
+  }
+}
+var CompiledFormula = class {
+  constructor(ast, source) {
+    this._ast = ast;
+    this.source = source;
+  }
+  evaluate(vars, opts) {
+    return evalAST(this._ast, { ...opts, vars });
+  }
+  /** Return all variable names referenced in this formula. */
+  variables() {
+    const names = /* @__PURE__ */ new Set();
+    collectVars(this._ast, names);
+    return [...names].sort();
+  }
+};
+function collectVars(node, out) {
+  switch (node.kind) {
+    case "number":
+      break;
+    case "identifier":
+      out.add(node.name);
+      break;
+    case "unary":
+      collectVars(node.operand, out);
+      break;
+    case "binary":
+      collectVars(node.left, out);
+      collectVars(node.right, out);
+      break;
+    case "call":
+      node.args.forEach((a) => collectVars(a, out));
+      break;
+    case "conditional":
+      collectVars(node.condition, out);
+      collectVars(node.consequent, out);
+      collectVars(node.alternate, out);
+      break;
+  }
+}
+export {
+  BUILTIN_FUNCTIONS,
+  BUILTIN_VARS,
+  CompiledFormula,
+  FormulaError,
+  compile,
+  evalAST,
+  evaluate,
+  parse,
+  tryEvaluate
+};
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/types.ts","../src/lexer.ts","../src/parser.ts","../src/builtins.ts","../src/evaluator.ts","../src/formula.ts"],"sourcesContent":["export type Value = number;\n\nexport type Variables = Record<string, Value>;\n\nexport type FunctionMap = Record<string, (...args: Value[]) => Value>;\n\nexport interface EvalOptions {\n  vars?: Variables;\n  functions?: FunctionMap;\n  maxDepth?: number;\n}\n\nexport class FormulaError extends Error {\n  constructor(\n    message: string,\n    public readonly position?: number\n  ) {\n    super(message);\n    this.name = \"FormulaError\";\n  }\n}\n\n// ── AST node types ────────────────────────────────────────────────────────────\n\nexport type NodeKind =\n  | \"number\"\n  | \"identifier\"\n  | \"binary\"\n  | \"unary\"\n  | \"call\"\n  | \"conditional\";\n\nexport interface NumberNode {\n  kind: \"number\";\n  value: number;\n}\n\nexport interface IdentifierNode {\n  kind: \"identifier\";\n  name: string;\n}\n\nexport interface BinaryNode {\n  kind: \"binary\";\n  op: string;\n  left: ASTNode;\n  right: ASTNode;\n}\n\nexport interface UnaryNode {\n  kind: \"unary\";\n  op: string;\n  operand: ASTNode;\n}\n\nexport interface CallNode {\n  kind: \"call\";\n  name: string;\n  args: ASTNode[];\n}\n\nexport interface ConditionalNode {\n  kind: \"conditional\";\n  condition: ASTNode;\n  consequent: ASTNode;\n  alternate: ASTNode;\n}\n\nexport type ASTNode =\n  | NumberNode\n  | IdentifierNode\n  | BinaryNode\n  | UnaryNode\n  | CallNode\n  | ConditionalNode;\n","import { FormulaError } from \"./types.js\";\n\nexport const enum TT {\n  Number     = \"Number\",\n  Ident      = \"Ident\",\n  Plus       = \"+\",\n  Minus      = \"-\",\n  Star       = \"*\",\n  Slash      = \"/\",\n  Percent    = \"%\",\n  Caret      = \"^\",\n  LParen     = \"(\",\n  RParen     = \")\",\n  Comma      = \",\",\n  Question   = \"?\",\n  Colon      = \":\",\n  Eq         = \"==\",\n  NEq        = \"!=\",\n  Lt         = \"<\",\n  Lte        = \"<=\",\n  Gt         = \">\",\n  Gte        = \">=\",\n  And        = \"&&\",\n  Or         = \"||\",\n  Not        = \"!\",\n  EOF        = \"EOF\",\n}\n\nexport interface Token {\n  type: TT;\n  raw: string;\n  pos: number;\n}\n\nexport function tokenize(src: string): Token[] {\n  const tokens: Token[] = [];\n  let i = 0;\n\n  while (i < src.length) {\n    // skip whitespace\n    if (/\\s/.test(src[i])) { i++; continue; }\n\n    const pos = i;\n    const ch = src[i];\n\n    // numbers (int or float, optional exponent)\n    if (/[0-9]/.test(ch) || (ch === \".\" && /[0-9]/.test(src[i + 1] ?? \"\"))) {\n      let raw = \"\";\n      while (i < src.length && /[0-9.]/.test(src[i])) raw += src[i++];\n      if (src[i] === \"e\" || src[i] === \"E\") {\n        raw += src[i++];\n        if (src[i] === \"+\" || src[i] === \"-\") raw += src[i++];\n        while (i < src.length && /[0-9]/.test(src[i])) raw += src[i++];\n      }\n      tokens.push({ type: TT.Number, raw, pos });\n      continue;\n    }\n\n    // identifiers and keywords (only PI/E)\n    if (/[a-zA-Z_]/.test(ch)) {\n      let raw = \"\";\n      while (i < src.length && /[a-zA-Z0-9_]/.test(src[i])) raw += src[i++];\n      tokens.push({ type: TT.Ident, raw, pos });\n      continue;\n    }\n\n    // two-char operators\n    const two = src.slice(i, i + 2);\n    if (two === \"==\" || two === \"!=\" || two === \"<=\" || two === \">=\" || two === \"&&\" || two === \"||\") {\n      tokens.push({ type: two as TT, raw: two, pos });\n      i += 2;\n      continue;\n    }\n\n    // one-char operators\n    const singles: Record<string, TT> = {\n      \"+\": TT.Plus, \"-\": TT.Minus, \"*\": TT.Star, \"/\": TT.Slash,\n      \"%\": TT.Percent, \"^\": TT.Caret,\n      \"(\": TT.LParen, \")\": TT.RParen, \",\": TT.Comma,\n      \"?\": TT.Question, \":\": TT.Colon,\n      \"<\": TT.Lt, \">\": TT.Gt, \"!\": TT.Not,\n    };\n    if (ch in singles) {\n      tokens.push({ type: singles[ch], raw: ch, pos });\n      i++;\n      continue;\n    }\n\n    throw new FormulaError(`Unexpected character '${ch}'`, pos);\n  }\n\n  tokens.push({ type: TT.EOF, raw: \"\", pos: i });\n  return tokens;\n}\n","import { tokenize, Token, TT } from \"./lexer.js\";\nimport {\n  ASTNode, NumberNode, IdentifierNode, BinaryNode,\n  UnaryNode, CallNode, ConditionalNode, FormulaError,\n} from \"./types.js\";\n\n// Pratt parser (top-down operator precedence)\n\nconst BP: Partial<Record<TT, number>> = {\n  [TT.Or]:      10,\n  [TT.And]:     20,\n  [TT.Eq]:      30, [TT.NEq]: 30,\n  [TT.Lt]:      40, [TT.Lte]: 40, [TT.Gt]: 40, [TT.Gte]: 40,\n  [TT.Plus]:    50, [TT.Minus]: 50,\n  [TT.Star]:    60, [TT.Slash]: 60, [TT.Percent]: 60,\n  [TT.Caret]:   70,  // right-assoc → parse at BP-1\n};\n\nclass Parser {\n  private tokens: Token[];\n  private pos: number = 0;\n\n  constructor(src: string) {\n    this.tokens = tokenize(src);\n  }\n\n  private peek(): Token { return this.tokens[this.pos]; }\n  private consume(): Token { return this.tokens[this.pos++]; }\n  private expect(type: TT): Token {\n    const t = this.consume();\n    if (t.type !== type) throw new FormulaError(`Expected '${type}' but got '${t.raw}'`, t.pos);\n    return t;\n  }\n\n  parse(): ASTNode {\n    const node = this.expr(0);\n    if (this.peek().type !== TT.EOF) {\n      const t = this.peek();\n      throw new FormulaError(`Unexpected token '${t.raw}'`, t.pos);\n    }\n    return node;\n  }\n\n  private expr(minBP: number): ASTNode {\n    let left = this.prefix();\n\n    while (true) {\n      const t = this.peek();\n\n      // ternary ?  :\n      if (t.type === TT.Question && minBP < 5) {\n        this.consume();\n        const consequent = this.expr(0);\n        this.expect(TT.Colon);\n        const alternate = this.expr(0);\n        left = { kind: \"conditional\", condition: left, consequent, alternate } as ConditionalNode;\n        continue;\n      }\n\n      const bp = BP[t.type as TT];\n      if (bp === undefined || bp <= minBP) break;\n\n      this.consume();\n      const rightBP = t.type === TT.Caret ? bp - 1 : bp; // ^ is right-assoc\n      const right = this.expr(rightBP);\n      left = { kind: \"binary\", op: t.type, left, right } as BinaryNode;\n    }\n\n    return left;\n  }\n\n  private prefix(): ASTNode {\n    const t = this.peek();\n\n    if (t.type === TT.Number) {\n      this.consume();\n      return { kind: \"number\", value: parseFloat(t.raw) } as NumberNode;\n    }\n\n    if (t.type === TT.Ident) {\n      this.consume();\n      // function call?\n      if (this.peek().type === TT.LParen) {\n        this.consume(); // (\n        const args: ASTNode[] = [];\n        if (this.peek().type !== TT.RParen) {\n          args.push(this.expr(0));\n          while (this.peek().type === TT.Comma) {\n            this.consume();\n            args.push(this.expr(0));\n          }\n        }\n        this.expect(TT.RParen);\n        return { kind: \"call\", name: t.raw, args } as CallNode;\n      }\n      return { kind: \"identifier\", name: t.raw } as IdentifierNode;\n    }\n\n    if (t.type === TT.Minus) {\n      this.consume();\n      return { kind: \"unary\", op: \"-\", operand: this.expr(65) } as UnaryNode;\n    }\n\n    if (t.type === TT.Not) {\n      this.consume();\n      return { kind: \"unary\", op: \"!\", operand: this.expr(65) } as UnaryNode;\n    }\n\n    if (t.type === TT.Plus) {\n      this.consume();\n      return this.expr(65); // unary +\n    }\n\n    if (t.type === TT.LParen) {\n      this.consume();\n      const inner = this.expr(0);\n      this.expect(TT.RParen);\n      return inner;\n    }\n\n    throw new FormulaError(`Unexpected token '${t.raw}'`, t.pos);\n  }\n}\n\nexport function parse(src: string): ASTNode {\n  return new Parser(src).parse();\n}\n","import { FunctionMap, Variables } from \"./types.js\";\n\nexport const BUILTIN_VARS: Variables = {\n  PI:  Math.PI,\n  E:   Math.E,\n  LN2: Math.LN2,\n  LN10: Math.LN10,\n  LOG2E: Math.LOG2E,\n  LOG10E: Math.LOG10E,\n  SQRT2: Math.SQRT2,\n  Infinity: Infinity,\n  NaN: NaN,\n};\n\nexport const BUILTIN_FUNCTIONS: FunctionMap = {\n  abs:   (x) => Math.abs(x),\n  ceil:  (x) => Math.ceil(x),\n  floor: (x) => Math.floor(x),\n  round: (x) => Math.round(x),\n  trunc: (x) => Math.trunc(x),\n  sign:  (x) => Math.sign(x),\n\n  sqrt:  (x) => Math.sqrt(x),\n  cbrt:  (x) => Math.cbrt(x),\n  pow:   (x, y) => Math.pow(x, y),\n  exp:   (x) => Math.exp(x),\n  log:   (x) => Math.log(x),\n  log2:  (x) => Math.log2(x),\n  log10: (x) => Math.log10(x),\n\n  sin:   (x) => Math.sin(x),\n  cos:   (x) => Math.cos(x),\n  tan:   (x) => Math.tan(x),\n  asin:  (x) => Math.asin(x),\n  acos:  (x) => Math.acos(x),\n  atan:  (x) => Math.atan(x),\n  atan2: (y, x) => Math.atan2(y, x),\n  sinh:  (x) => Math.sinh(x),\n  cosh:  (x) => Math.cosh(x),\n  tanh:  (x) => Math.tanh(x),\n\n  min:   (...args) => Math.min(...args),\n  max:   (...args) => Math.max(...args),\n  clamp: (x, lo, hi) => Math.min(Math.max(x, lo), hi),\n\n  hypot: (...args) => Math.hypot(...args),\n\n  random: () => Math.random(),\n\n  isNaN:    (x) => (isNaN(x) ? 1 : 0),\n  isFinite: (x) => (isFinite(x) ? 1 : 0),\n};\n","import { ASTNode, EvalOptions, FormulaError, Value } from \"./types.js\";\nimport { BUILTIN_VARS, BUILTIN_FUNCTIONS } from \"./builtins.js\";\n\nfunction evalNode(node: ASTNode, opts: Required<EvalOptions>, depth: number): Value {\n  if (depth > opts.maxDepth) throw new FormulaError(\"Maximum recursion depth exceeded\");\n\n  const d = depth + 1;\n\n  switch (node.kind) {\n    case \"number\":\n      return node.value;\n\n    case \"identifier\": {\n      const name = node.name;\n      if (name in opts.vars) return opts.vars[name];\n      if (name in BUILTIN_VARS) return BUILTIN_VARS[name];\n      throw new FormulaError(`Unknown variable '${name}'`);\n    }\n\n    case \"unary\": {\n      const v = evalNode(node.operand, opts, d);\n      if (node.op === \"-\") return -v;\n      if (node.op === \"!\") return v === 0 ? 1 : 0;\n      throw new FormulaError(`Unknown unary operator '${node.op}'`);\n    }\n\n    case \"binary\": {\n      const l = evalNode(node.left, opts, d);\n      // short-circuit for && / ||\n      if (node.op === \"&&\") return (l !== 0 ? evalNode(node.right, opts, d) : 0);\n      if (node.op === \"||\") return (l !== 0 ? l : evalNode(node.right, opts, d));\n\n      const r = evalNode(node.right, opts, d);\n      switch (node.op) {\n        case \"+\": return l + r;\n        case \"-\": return l - r;\n        case \"*\": return l * r;\n        case \"/\":\n          if (r === 0) throw new FormulaError(\"Division by zero\");\n          return l / r;\n        case \"%\":\n          if (r === 0) throw new FormulaError(\"Modulo by zero\");\n          return l % r;\n        case \"^\": return Math.pow(l, r);\n        case \"==\": return l === r ? 1 : 0;\n        case \"!=\": return l !== r ? 1 : 0;\n        case \"<\":  return l < r ? 1 : 0;\n        case \"<=\": return l <= r ? 1 : 0;\n        case \">\":  return l > r ? 1 : 0;\n        case \">=\": return l >= r ? 1 : 0;\n        default:\n          throw new FormulaError(`Unknown operator '${node.op}'`);\n      }\n    }\n\n    case \"call\": {\n      const fn = opts.functions[node.name] ?? BUILTIN_FUNCTIONS[node.name];\n      if (!fn) throw new FormulaError(`Unknown function '${node.name}'`);\n      const args = node.args.map((a) => evalNode(a, opts, d));\n      return fn(...args);\n    }\n\n    case \"conditional\": {\n      const cond = evalNode(node.condition, opts, d);\n      return cond !== 0\n        ? evalNode(node.consequent, opts, d)\n        : evalNode(node.alternate, opts, d);\n    }\n  }\n}\n\nexport function evalAST(node: ASTNode, opts: EvalOptions = {}): Value {\n  const resolved: Required<EvalOptions> = {\n    vars: opts.vars ?? {},\n    functions: opts.functions ?? {},\n    maxDepth: opts.maxDepth ?? 200,\n  };\n  return evalNode(node, resolved, 0);\n}\n","import { parse } from \"./parser.js\";\nimport { evalAST } from \"./evaluator.js\";\nimport { ASTNode, EvalOptions, Value } from \"./types.js\";\n\n/**\n * Parse an expression string into an AST (reuse for repeated evaluations).\n */\nexport function compile(expr: string): CompiledFormula {\n  const ast = parse(expr);\n  return new CompiledFormula(ast, expr);\n}\n\n/**\n * Parse and evaluate an expression in one step.\n */\nexport function evaluate(expr: string, vars?: Record<string, Value>, opts?: Omit<EvalOptions, \"vars\">): Value {\n  const ast = parse(expr);\n  return evalAST(ast, { ...opts, vars });\n}\n\n/**\n * Parse and evaluate, returning null instead of throwing on parse/eval errors.\n */\nexport function tryEvaluate(expr: string, vars?: Record<string, Value>, opts?: Omit<EvalOptions, \"vars\">): Value | null {\n  try { return evaluate(expr, vars, opts); }\n  catch { return null; }\n}\n\nexport class CompiledFormula {\n  readonly source: string;\n  private readonly _ast: ASTNode;\n\n  constructor(ast: ASTNode, source: string) {\n    this._ast = ast;\n    this.source = source;\n  }\n\n  evaluate(vars?: Record<string, Value>, opts?: Omit<EvalOptions, \"vars\">): Value {\n    return evalAST(this._ast, { ...opts, vars });\n  }\n\n  /** Return all variable names referenced in this formula. */\n  variables(): string[] {\n    const names = new Set<string>();\n    collectVars(this._ast, names);\n    return [...names].sort();\n  }\n}\n\nfunction collectVars(node: ASTNode, out: Set<string>): void {\n  switch (node.kind) {\n    case \"number\": break;\n    case \"identifier\": out.add(node.name); break;\n    case \"unary\": collectVars(node.operand, out); break;\n    case \"binary\": collectVars(node.left, out); collectVars(node.right, out); break;\n    case \"call\": node.args.forEach((a) => collectVars(a, out)); break;\n    case \"conditional\":\n      collectVars(node.condition, out);\n      collectVars(node.consequent, out);\n      collectVars(node.alternate, out);\n      break;\n  }\n}\n"],"mappings":";AAYO,IAAM,eAAN,cAA2B,MAAM;AAAA,EACtC,YACE,SACgB,UAChB;AACA,UAAM,OAAO;AAFG;AAGhB,SAAK,OAAO;AAAA,EACd;AACF;;;ACcO,SAAS,SAAS,KAAsB;AAC7C,QAAM,SAAkB,CAAC;AACzB,MAAI,IAAI;AAER,SAAO,IAAI,IAAI,QAAQ;AAErB,QAAI,KAAK,KAAK,IAAI,CAAC,CAAC,GAAG;AAAE;AAAK;AAAA,IAAU;AAExC,UAAM,MAAM;AACZ,UAAM,KAAK,IAAI,CAAC;AAGhB,QAAI,QAAQ,KAAK,EAAE,KAAM,OAAO,OAAO,QAAQ,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,GAAI;AACtE,UAAI,MAAM;AACV,aAAO,IAAI,IAAI,UAAU,SAAS,KAAK,IAAI,CAAC,CAAC,EAAG,QAAO,IAAI,GAAG;AAC9D,UAAI,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,MAAM,KAAK;AACpC,eAAO,IAAI,GAAG;AACd,YAAI,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,MAAM,IAAK,QAAO,IAAI,GAAG;AACpD,eAAO,IAAI,IAAI,UAAU,QAAQ,KAAK,IAAI,CAAC,CAAC,EAAG,QAAO,IAAI,GAAG;AAAA,MAC/D;AACA,aAAO,KAAK,EAAE,MAAM,uBAAW,KAAK,IAAI,CAAC;AACzC;AAAA,IACF;AAGA,QAAI,YAAY,KAAK,EAAE,GAAG;AACxB,UAAI,MAAM;AACV,aAAO,IAAI,IAAI,UAAU,eAAe,KAAK,IAAI,CAAC,CAAC,EAAG,QAAO,IAAI,GAAG;AACpE,aAAO,KAAK,EAAE,MAAM,qBAAU,KAAK,IAAI,CAAC;AACxC;AAAA,IACF;AAGA,UAAM,MAAM,IAAI,MAAM,GAAG,IAAI,CAAC;AAC9B,QAAI,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,QAAQ,MAAM;AAChG,aAAO,KAAK,EAAE,MAAM,KAAW,KAAK,KAAK,IAAI,CAAC;AAC9C,WAAK;AACL;AAAA,IACF;AAGA,UAAM,UAA8B;AAAA,MAClC,KAAK;AAAA,MAAS,KAAK;AAAA,MAAU,KAAK;AAAA,MAAS,KAAK;AAAA,MAChD,KAAK;AAAA,MAAY,KAAK;AAAA,MACtB,KAAK;AAAA,MAAW,KAAK;AAAA,MAAW,KAAK;AAAA,MACrC,KAAK;AAAA,MAAa,KAAK;AAAA,MACvB,KAAK;AAAA,MAAO,KAAK;AAAA,MAAO,KAAK;AAAA,IAC/B;AACA,QAAI,MAAM,SAAS;AACjB,aAAO,KAAK,EAAE,MAAM,QAAQ,EAAE,GAAG,KAAK,IAAI,IAAI,CAAC;AAC/C;AACA;AAAA,IACF;AAEA,UAAM,IAAI,aAAa,yBAAyB,EAAE,KAAK,GAAG;AAAA,EAC5D;AAEA,SAAO,KAAK,EAAE,MAAM,iBAAQ,KAAK,IAAI,KAAK,EAAE,CAAC;AAC7C,SAAO;AACT;;;ACrFA,IAAM,KAAkC;AAAA,EACtC,cAAM,GAAQ;AAAA,EACd,eAAO,GAAO;AAAA,EACd,cAAM,GAAQ;AAAA,EAAI,eAAO,GAAG;AAAA,EAC5B,aAAM,GAAQ;AAAA,EAAI,eAAO,GAAG;AAAA,EAAI,aAAM,GAAG;AAAA,EAAI,eAAO,GAAG;AAAA,EACvD,eAAQ,GAAM;AAAA,EAAI,gBAAS,GAAG;AAAA,EAC9B,eAAQ,GAAM;AAAA,EAAI,gBAAS,GAAG;AAAA,EAAI,kBAAW,GAAG;AAAA,EAChD,gBAAS,GAAK;AAAA;AAChB;AAEA,IAAM,SAAN,MAAa;AAAA,EAIX,YAAY,KAAa;AAFzB,SAAQ,MAAc;AAGpB,SAAK,SAAS,SAAS,GAAG;AAAA,EAC5B;AAAA,EAEQ,OAAc;AAAE,WAAO,KAAK,OAAO,KAAK,GAAG;AAAA,EAAG;AAAA,EAC9C,UAAiB;AAAE,WAAO,KAAK,OAAO,KAAK,KAAK;AAAA,EAAG;AAAA,EACnD,OAAO,MAAiB;AAC9B,UAAM,IAAI,KAAK,QAAQ;AACvB,QAAI,EAAE,SAAS,KAAM,OAAM,IAAI,aAAa,aAAa,IAAI,cAAc,EAAE,GAAG,KAAK,EAAE,GAAG;AAC1F,WAAO;AAAA,EACT;AAAA,EAEA,QAAiB;AACf,UAAM,OAAO,KAAK,KAAK,CAAC;AACxB,QAAI,KAAK,KAAK,EAAE,0BAAiB;AAC/B,YAAM,IAAI,KAAK,KAAK;AACpB,YAAM,IAAI,aAAa,qBAAqB,EAAE,GAAG,KAAK,EAAE,GAAG;AAAA,IAC7D;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,KAAK,OAAwB;AACnC,QAAI,OAAO,KAAK,OAAO;AAEvB,WAAO,MAAM;AACX,YAAM,IAAI,KAAK,KAAK;AAGpB,UAAI,EAAE,+BAAwB,QAAQ,GAAG;AACvC,aAAK,QAAQ;AACb,cAAM,aAAa,KAAK,KAAK,CAAC;AAC9B,aAAK,sBAAe;AACpB,cAAM,YAAY,KAAK,KAAK,CAAC;AAC7B,eAAO,EAAE,MAAM,eAAe,WAAW,MAAM,YAAY,UAAU;AACrE;AAAA,MACF;AAEA,YAAM,KAAK,GAAG,EAAE,IAAU;AAC1B,UAAI,OAAO,UAAa,MAAM,MAAO;AAErC,WAAK,QAAQ;AACb,YAAM,UAAU,EAAE,2BAAoB,KAAK,IAAI;AAC/C,YAAM,QAAQ,KAAK,KAAK,OAAO;AAC/B,aAAO,EAAE,MAAM,UAAU,IAAI,EAAE,MAAM,MAAM,MAAM;AAAA,IACnD;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,SAAkB;AACxB,UAAM,IAAI,KAAK,KAAK;AAEpB,QAAI,EAAE,gCAAoB;AACxB,WAAK,QAAQ;AACb,aAAO,EAAE,MAAM,UAAU,OAAO,WAAW,EAAE,GAAG,EAAE;AAAA,IACpD;AAEA,QAAI,EAAE,8BAAmB;AACvB,WAAK,QAAQ;AAEb,UAAI,KAAK,KAAK,EAAE,2BAAoB;AAClC,aAAK,QAAQ;AACb,cAAM,OAAkB,CAAC;AACzB,YAAI,KAAK,KAAK,EAAE,2BAAoB;AAClC,eAAK,KAAK,KAAK,KAAK,CAAC,CAAC;AACtB,iBAAO,KAAK,KAAK,EAAE,0BAAmB;AACpC,iBAAK,QAAQ;AACb,iBAAK,KAAK,KAAK,KAAK,CAAC,CAAC;AAAA,UACxB;AAAA,QACF;AACA,aAAK,uBAAgB;AACrB,eAAO,EAAE,MAAM,QAAQ,MAAM,EAAE,KAAK,KAAK;AAAA,MAC3C;AACA,aAAO,EAAE,MAAM,cAAc,MAAM,EAAE,IAAI;AAAA,IAC3C;AAEA,QAAI,EAAE,0BAAmB;AACvB,WAAK,QAAQ;AACb,aAAO,EAAE,MAAM,SAAS,IAAI,KAAK,SAAS,KAAK,KAAK,EAAE,EAAE;AAAA,IAC1D;AAEA,QAAI,EAAE,wBAAiB;AACrB,WAAK,QAAQ;AACb,aAAO,EAAE,MAAM,SAAS,IAAI,KAAK,SAAS,KAAK,KAAK,EAAE,EAAE;AAAA,IAC1D;AAEA,QAAI,EAAE,yBAAkB;AACtB,WAAK,QAAQ;AACb,aAAO,KAAK,KAAK,EAAE;AAAA,IACrB;AAEA,QAAI,EAAE,2BAAoB;AACxB,WAAK,QAAQ;AACb,YAAM,QAAQ,KAAK,KAAK,CAAC;AACzB,WAAK,uBAAgB;AACrB,aAAO;AAAA,IACT;AAEA,UAAM,IAAI,aAAa,qBAAqB,EAAE,GAAG,KAAK,EAAE,GAAG;AAAA,EAC7D;AACF;AAEO,SAAS,MAAM,KAAsB;AAC1C,SAAO,IAAI,OAAO,GAAG,EAAE,MAAM;AAC/B;;;AC5HO,IAAM,eAA0B;AAAA,EACrC,IAAK,KAAK;AAAA,EACV,GAAK,KAAK;AAAA,EACV,KAAK,KAAK;AAAA,EACV,MAAM,KAAK;AAAA,EACX,OAAO,KAAK;AAAA,EACZ,QAAQ,KAAK;AAAA,EACb,OAAO,KAAK;AAAA,EACZ,UAAU;AAAA,EACV,KAAK;AACP;AAEO,IAAM,oBAAiC;AAAA,EAC5C,KAAO,CAAC,MAAM,KAAK,IAAI,CAAC;AAAA,EACxB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC;AAAA,EAC1B,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC;AAAA,EAC1B,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC;AAAA,EAC1B,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EAEzB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,KAAO,CAAC,GAAG,MAAM,KAAK,IAAI,GAAG,CAAC;AAAA,EAC9B,KAAO,CAAC,MAAM,KAAK,IAAI,CAAC;AAAA,EACxB,KAAO,CAAC,MAAM,KAAK,IAAI,CAAC;AAAA,EACxB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC;AAAA,EAE1B,KAAO,CAAC,MAAM,KAAK,IAAI,CAAC;AAAA,EACxB,KAAO,CAAC,MAAM,KAAK,IAAI,CAAC;AAAA,EACxB,KAAO,CAAC,MAAM,KAAK,IAAI,CAAC;AAAA,EACxB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,OAAO,CAAC,GAAG,MAAM,KAAK,MAAM,GAAG,CAAC;AAAA,EAChC,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EACzB,MAAO,CAAC,MAAM,KAAK,KAAK,CAAC;AAAA,EAEzB,KAAO,IAAI,SAAS,KAAK,IAAI,GAAG,IAAI;AAAA,EACpC,KAAO,IAAI,SAAS,KAAK,IAAI,GAAG,IAAI;AAAA,EACpC,OAAO,CAAC,GAAG,IAAI,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,GAAG,EAAE;AAAA,EAElD,OAAO,IAAI,SAAS,KAAK,MAAM,GAAG,IAAI;AAAA,EAEtC,QAAQ,MAAM,KAAK,OAAO;AAAA,EAE1B,OAAU,CAAC,MAAO,MAAM,CAAC,IAAI,IAAI;AAAA,EACjC,UAAU,CAAC,MAAO,SAAS,CAAC,IAAI,IAAI;AACtC;;;AChDA,SAAS,SAAS,MAAe,MAA6B,OAAsB;AAClF,MAAI,QAAQ,KAAK,SAAU,OAAM,IAAI,aAAa,kCAAkC;AAEpF,QAAM,IAAI,QAAQ;AAElB,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AACH,aAAO,KAAK;AAAA,IAEd,KAAK,cAAc;AACjB,YAAM,OAAO,KAAK;AAClB,UAAI,QAAQ,KAAK,KAAM,QAAO,KAAK,KAAK,IAAI;AAC5C,UAAI,QAAQ,aAAc,QAAO,aAAa,IAAI;AAClD,YAAM,IAAI,aAAa,qBAAqB,IAAI,GAAG;AAAA,IACrD;AAAA,IAEA,KAAK,SAAS;AACZ,YAAM,IAAI,SAAS,KAAK,SAAS,MAAM,CAAC;AACxC,UAAI,KAAK,OAAO,IAAK,QAAO,CAAC;AAC7B,UAAI,KAAK,OAAO,IAAK,QAAO,MAAM,IAAI,IAAI;AAC1C,YAAM,IAAI,aAAa,2BAA2B,KAAK,EAAE,GAAG;AAAA,IAC9D;AAAA,IAEA,KAAK,UAAU;AACb,YAAM,IAAI,SAAS,KAAK,MAAM,MAAM,CAAC;AAErC,UAAI,KAAK,OAAO,KAAM,QAAQ,MAAM,IAAI,SAAS,KAAK,OAAO,MAAM,CAAC,IAAI;AACxE,UAAI,KAAK,OAAO,KAAM,QAAQ,MAAM,IAAI,IAAI,SAAS,KAAK,OAAO,MAAM,CAAC;AAExE,YAAM,IAAI,SAAS,KAAK,OAAO,MAAM,CAAC;AACtC,cAAQ,KAAK,IAAI;AAAA,QACf,KAAK;AAAK,iBAAO,IAAI;AAAA,QACrB,KAAK;AAAK,iBAAO,IAAI;AAAA,QACrB,KAAK;AAAK,iBAAO,IAAI;AAAA,QACrB,KAAK;AACH,cAAI,MAAM,EAAG,OAAM,IAAI,aAAa,kBAAkB;AACtD,iBAAO,IAAI;AAAA,QACb,KAAK;AACH,cAAI,MAAM,EAAG,OAAM,IAAI,aAAa,gBAAgB;AACpD,iBAAO,IAAI;AAAA,QACb,KAAK;AAAK,iBAAO,KAAK,IAAI,GAAG,CAAC;AAAA,QAC9B,KAAK;AAAM,iBAAO,MAAM,IAAI,IAAI;AAAA,QAChC,KAAK;AAAM,iBAAO,MAAM,IAAI,IAAI;AAAA,QAChC,KAAK;AAAM,iBAAO,IAAI,IAAI,IAAI;AAAA,QAC9B,KAAK;AAAM,iBAAO,KAAK,IAAI,IAAI;AAAA,QAC/B,KAAK;AAAM,iBAAO,IAAI,IAAI,IAAI;AAAA,QAC9B,KAAK;AAAM,iBAAO,KAAK,IAAI,IAAI;AAAA,QAC/B;AACE,gBAAM,IAAI,aAAa,qBAAqB,KAAK,EAAE,GAAG;AAAA,MAC1D;AAAA,IACF;AAAA,IAEA,KAAK,QAAQ;AACX,YAAM,KAAK,KAAK,UAAU,KAAK,IAAI,KAAK,kBAAkB,KAAK,IAAI;AACnE,UAAI,CAAC,GAAI,OAAM,IAAI,aAAa,qBAAqB,KAAK,IAAI,GAAG;AACjE,YAAM,OAAO,KAAK,KAAK,IAAI,CAAC,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC;AACtD,aAAO,GAAG,GAAG,IAAI;AAAA,IACnB;AAAA,IAEA,KAAK,eAAe;AAClB,YAAM,OAAO,SAAS,KAAK,WAAW,MAAM,CAAC;AAC7C,aAAO,SAAS,IACZ,SAAS,KAAK,YAAY,MAAM,CAAC,IACjC,SAAS,KAAK,WAAW,MAAM,CAAC;AAAA,IACtC;AAAA,EACF;AACF;AAEO,SAAS,QAAQ,MAAe,OAAoB,CAAC,GAAU;AACpE,QAAM,WAAkC;AAAA,IACtC,MAAM,KAAK,QAAQ,CAAC;AAAA,IACpB,WAAW,KAAK,aAAa,CAAC;AAAA,IAC9B,UAAU,KAAK,YAAY;AAAA,EAC7B;AACA,SAAO,SAAS,MAAM,UAAU,CAAC;AACnC;;;ACvEO,SAAS,QAAQ,MAA+B;AACrD,QAAM,MAAM,MAAM,IAAI;AACtB,SAAO,IAAI,gBAAgB,KAAK,IAAI;AACtC;AAKO,SAAS,SAAS,MAAc,MAA8B,MAAyC;AAC5G,QAAM,MAAM,MAAM,IAAI;AACtB,SAAO,QAAQ,KAAK,EAAE,GAAG,MAAM,KAAK,CAAC;AACvC;AAKO,SAAS,YAAY,MAAc,MAA8B,MAAgD;AACtH,MAAI;AAAE,WAAO,SAAS,MAAM,MAAM,IAAI;AAAA,EAAG,QACnC;AAAE,WAAO;AAAA,EAAM;AACvB;AAEO,IAAM,kBAAN,MAAsB;AAAA,EAI3B,YAAY,KAAc,QAAgB;AACxC,SAAK,OAAO;AACZ,SAAK,SAAS;AAAA,EAChB;AAAA,EAEA,SAAS,MAA8B,MAAyC;AAC9E,WAAO,QAAQ,KAAK,MAAM,EAAE,GAAG,MAAM,KAAK,CAAC;AAAA,EAC7C;AAAA;AAAA,EAGA,YAAsB;AACpB,UAAM,QAAQ,oBAAI,IAAY;AAC9B,gBAAY,KAAK,MAAM,KAAK;AAC5B,WAAO,CAAC,GAAG,KAAK,EAAE,KAAK;AAAA,EACzB;AACF;AAEA,SAAS,YAAY,MAAe,KAAwB;AAC1D,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AAAU;AAAA,IACf,KAAK;AAAc,UAAI,IAAI,KAAK,IAAI;AAAG;AAAA,IACvC,KAAK;AAAS,kBAAY,KAAK,SAAS,GAAG;AAAG;AAAA,IAC9C,KAAK;AAAU,kBAAY,KAAK,MAAM,GAAG;AAAG,kBAAY,KAAK,OAAO,GAAG;AAAG;AAAA,IAC1E,KAAK;AAAQ,WAAK,KAAK,QAAQ,CAAC,MAAM,YAAY,GAAG,GAAG,CAAC;AAAG;AAAA,IAC5D,KAAK;AACH,kBAAY,KAAK,WAAW,GAAG;AAC/B,kBAAY,KAAK,YAAY,GAAG;AAChC,kBAAY,KAAK,WAAW,GAAG;AAC/B;AAAA,EACJ;AACF;","names":[]}

package/package.json

@@ -0,0 +1,53 @@
+{
+  "name": "formulakit",
+  "version": "0.1.0",
+  "description": "Zero-dependency safe arithmetic expression evaluator: parse/evaluate math formulas with variables and functions, no eval(). TypeScript-first, ESM+CJS. Port of Python simpleeval / Go expr / C# DynamicExpresso.",
+  "type": "module",
+  "main": "./dist/index.cjs",
+  "module": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js",
+      "require": "./dist/index.cjs"
+    }
+  },
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE"
+  ],
+  "scripts": {
+    "build": "tsup",
+    "typecheck": "tsc --noEmit",
+    "test": "node --experimental-vm-modules node_modules/.bin/jest --forceExit",
+    "prepublishOnly": "npm run typecheck && npm test && npm run build"
+  },
+  "keywords": [
+    "expression",
+    "evaluator",
+    "formula",
+    "math",
+    "parser",
+    "arithmetic",
+    "safe-eval",
+    "calculator",
+    "variables",
+    "typescript",
+    "zero-dependencies"
+  ],
+  "author": "trananhtung",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/trananhtung/formulakit.git"
+  },
+  "devDependencies": {
+    "@types/jest": "^30.0.0",
+    "jest": "^30.4.2",
+    "ts-jest": "^29.4.11",
+    "tsup": "^8.5.1",
+    "typescript": "^6.0.3"
+  }
+}