solve-engine 1.2.0 → 2.1.0

package/dist/chunk-TCZSPH4A.js

@@ -0,0 +1,2 @@
+import {QueryClient}from'@tanstack/query-core';var t=null;function i(e){t=e;}function l(){return t}function u(){return new QueryClient({defaultOptions:{queries:{staleTime:300*1e3,gcTime:600*1e3,retry:3,retryDelay:e=>Math.min(500*2**e,5e3),refetchOnWindowFocus:false,refetchOnReconnect:false}}})}export{i as a,l as b,u as c};//# sourceMappingURL=chunk-TCZSPH4A.js.map
+//# sourceMappingURL=chunk-TCZSPH4A.js.map

package/dist/chunk-TCZSPH4A.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/services/DataQueryService.ts"],"names":["_activeQueryClient","setActiveQueryClient","qc","getActiveQueryClient","createQueryClient","QueryClient","attempt"],"mappings":"+CA2BA,IAAIA,CAAAA,CAAyC,KAGtC,SAASC,CAAAA,CAAqBC,CAAAA,CAA8B,CACjEF,CAAAA,CAAqBE,EACvB,CAGO,SAASC,CAAAA,EAA2C,CACzD,OAAOH,CACT,CAMO,SAASI,CAAAA,EAAiC,CAC/C,OAAO,IAAIC,WAAAA,CAAY,CACrB,cAAA,CAAgB,CACd,OAAA,CAAS,CACP,SAAA,CAAW,GAAA,CAAS,GAAA,CACpB,MAAA,CAAQ,IAAU,GAAA,CAClB,KAAA,CAAO,CAAA,CACP,UAAA,CAAaC,CAAAA,EAAY,IAAA,CAAK,IAAI,GAAA,CAAM,CAAA,EAAKA,CAAAA,CAAS,GAAI,CAAA,CAC1D,oBAAA,CAAsB,KAAA,CACtB,kBAAA,CAAoB,KACtB,CACF,CACF,CAAC,CACH","file":"chunk-TCZSPH4A.js","sourcesContent":["/**\n * QueryClient factory for the solve-js engine.\n *\n * Creates a TanStack Query QueryClient with sensible defaults for\n * stale-while-revalidate, garbage collection, and retry behavior.\n * The QueryClient is injected into resolvers via the engine, so\n * no global singleton is needed.\n *\n * Removed in this refactor:\n * - DataQueryWorker (worker thread), doesn't solve anything in Obsidian's single-threaded env\n * - localCache (raw Map), replaced by TanStack Query's built-in cache\n * - pendingQueries (manual promise plumbing), TanStack Query handles dedup\n * - DataSourceHandle, registerDataSource, unregisterDataSource, no longer needed\n * - cleanupCache timer, TanStack Query's gc does this automatically\n * - cacheUpdateListeners / errorListeners, TanStack Query has its own observer API\n */\n\nimport { QueryClient } from \"@tanstack/query-core\";\n\n// ── Active query client (execution context) ───────────────────────────────\n// Synchronous VM plugin functions (dispatched via CALL_PLUGIN) can't receive\n// the engine's QueryClient through their (args) => Value ABI, so the engine\n// publishes the client here before each execution and package handlers read\n// it back. This module is the package-agnostic home for that hand-off\n// the engine must not import from a specific package (e.g. packages/osrs)\n// to wire it.\n\nlet _activeQueryClient: QueryClient | null = null;\n\n/** Publish the QueryClient for the execution about to run. Set by the engine. */\nexport function setActiveQueryClient(qc: QueryClient | null): void {\n  _activeQueryClient = qc;\n}\n\n/** Read the QueryClient of the currently executing engine, if any. */\nexport function getActiveQueryClient(): QueryClient | null {\n  return _activeQueryClient;\n}\n\n/**\n * Create a new TanStack Query QueryClient with project defaults.\n * Each engine instance gets its own client for isolation.\n */\nexport function createQueryClient(): QueryClient {\n  return new QueryClient({\n    defaultOptions: {\n      queries: {\n        staleTime: 5 * 60 * 1000,       // 5 minutes\n        gcTime: 10 * 60 * 1000,          // 10 minutes\n        retry: 3,\n        retryDelay: (attempt) => Math.min(500 * 2 ** attempt, 5000),\n        refetchOnWindowFocus: false,\n        refetchOnReconnect: false,       // Not relevant in Obsidian plugin context\n      },\n    },\n  });\n}\n"]}

package/dist/chunk-TLG7VZRX.cjs

@@ -0,0 +1,2 @@
+'use strict';function u(t,n,i){let e=new AbortController;if(t?.aborted)return e.abort(t.reason),{signal:e.signal,cleanup:()=>{}};let r=setTimeout(()=>e.abort(new DOMException(`${i} timed out after ${n}ms`,"TimeoutError")),n),o;return t&&(o=()=>{clearTimeout(r);try{e.abort(t.reason);}catch{}},t.addEventListener("abort",o,{once:true})),{signal:e.signal,cleanup:()=>{clearTimeout(r),t&&o&&t.removeEventListener("abort",o);}}}exports.a=u;//# sourceMappingURL=chunk-TLG7VZRX.cjs.map
+//# sourceMappingURL=chunk-TLG7VZRX.cjs.map

package/dist/chunk-TLG7VZRX.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/utilities/TimeoutSignal.ts"],"names":["createTimeoutSignal","callerSignal","timeoutMs","label","controller","timeoutId","onCallerAbort"],"mappings":"aAYO,SAASA,CAAAA,CACfC,EACAC,CAAAA,CACAC,CAAAA,CAC+C,CAC/C,IAAMC,CAAAA,CAAa,IAAI,eAAA,CAEvB,GAAIH,GAAc,OAAA,CACjB,OAAAG,EAAW,KAAA,CAAMH,CAAAA,CAAa,MAAM,CAAA,CAC7B,CAAE,OAAQG,CAAAA,CAAW,MAAA,CAAQ,QAAS,IAAM,CAAsB,CAAE,CAAA,CAG5E,IAAMC,EAAY,UAAA,CACjB,IAAMD,EAAW,KAAA,CAAM,IAAI,aAAa,CAAA,EAAGD,CAAK,oBAAoBD,CAAS,CAAA,EAAA,CAAA,CAAM,cAAc,CAAC,CAAA,CAClGA,CACD,CAAA,CAEII,CAAAA,CACJ,OAAIL,CAAAA,GACHK,CAAAA,CAAgB,IAAM,CACrB,YAAA,CAAaD,CAAS,CAAA,CACtB,GAAI,CAAED,CAAAA,CAAW,KAAA,CAAMH,EAAa,MAAM,EAAG,MAAQ,CAAwB,CAC9E,EACAA,CAAAA,CAAa,gBAAA,CAAiB,QAASK,CAAAA,CAAe,CAAE,KAAM,IAAK,CAAC,GAG9D,CACN,MAAA,CAAQF,EAAW,MAAA,CACnB,OAAA,CAAS,IAAM,CACd,YAAA,CAAaC,CAAS,CAAA,CAClBJ,CAAAA,EAAgBK,GACnBL,CAAAA,CAAa,mBAAA,CAAoB,QAASK,CAAa,EAEzD,CACD,CACD","file":"chunk-TLG7VZRX.cjs","sourcesContent":["/**\n * Multiplex an optional caller AbortSignal with a hard timeout into a single\n * AbortSignal suitable for fetch().\n *\n * Implemented manually rather than with AbortSignal.any()/AbortSignal.timeout()\n * (Chrome 116+) to stay compatible with the TypeScript lib targets used by\n * this project.\n *\n * Handles the already-aborted caller: addEventListener(\"abort\", …) on a signal\n * that has already fired never invokes the listener, so without the upfront\n * `aborted` check the fetch would proceed even though the caller cancelled.\n */\nexport function createTimeoutSignal(\n\tcallerSignal: AbortSignal | undefined,\n\ttimeoutMs: number,\n\tlabel: string,\n): { signal: AbortSignal; cleanup: () => void } {\n\tconst controller = new AbortController();\n\n\tif (callerSignal?.aborted) {\n\t\tcontroller.abort(callerSignal.reason);\n\t\treturn { signal: controller.signal, cleanup: () => { /* nothing armed */ } };\n\t}\n\n\tconst timeoutId = setTimeout(\n\t\t() => controller.abort(new DOMException(`${label} timed out after ${timeoutMs}ms`, \"TimeoutError\")),\n\t\ttimeoutMs,\n\t);\n\n\tlet onCallerAbort: (() => void) | undefined;\n\tif (callerSignal) {\n\t\tonCallerAbort = () => {\n\t\t\tclearTimeout(timeoutId);\n\t\t\ttry { controller.abort(callerSignal.reason); } catch { /* already aborted */ }\n\t\t};\n\t\tcallerSignal.addEventListener(\"abort\", onCallerAbort, { once: true });\n\t}\n\n\treturn {\n\t\tsignal: controller.signal,\n\t\tcleanup: () => {\n\t\t\tclearTimeout(timeoutId);\n\t\t\tif (callerSignal && onCallerAbort) {\n\t\t\t\tcallerSignal.removeEventListener(\"abort\", onCallerAbort);\n\t\t\t}\n\t\t},\n\t};\n}\n"]}

package/dist/chunk-TN5E6JU6.js

@@ -0,0 +1,2 @@
+import {a as a$1,d}from'./chunk-YVKHEAFT.js';import {a as a$2}from'./chunk-G7TBEQRQ.js';import {c as c$1}from'./chunk-IJMNVBIS.js';import {c}from'./chunk-MPB7KUN5.js';var I=class{constructor(){this.category="Symbolic";}parse(o,t,e){o.consume("LPAREN"),o.parseExpression(a$1.Lowest,e),o.consume("RPAREN"),e.emitOpcode(51),e.emitIndex(67),e.emitIndex(1);}};var x=class{constructor(){this.category="Symbolic";}parse(o,t,e){o.consume("LPAREN"),o.parseExpression(a$1.Lowest,e),o.consume("RPAREN"),e.emitOpcode(51),e.emitIndex(68),e.emitIndex(1);}};function l(r,o){let t=r.peek();if(!t||t.type!=="IDENT"&&t.type!=="UNIT")throw c.parsing("SYMBOLIC_REQUIRES_VARIABLE_NAME",`${o} needs the name of an unknown here, as in ${o}(x^2, x).`,{found:t?.type??"end of input"});return r.consume(),t.value}function s(r,o){r.emitOpcode(13),r.emitString(o);}function a(r,o,t){let e=new d(o.pluginIndexMap);r.parseExpression(a$1.Lowest,e),r.setBuilder(o);let i=e.build();if(i.hasAsync)throw c.parsing("SYMBOLIC_ARGUMENT_MUST_BE_SYNCHRONOUS",`${t}'s expression must be synchronous (no weather/stocks/currency calls).`);return i}function p(r,o,t){let e=r.emitAnonymousBody([t],o);r.emitOpcode(159),r.emitIndex(e);}var B=class{constructor(){this.category="Symbolic";}parse(o,t,e){o.consume("LPAREN");let i=a(o,e,"solve"),n=o.match("EQUALS")?a(o,e,"solve"):null;o.consume("COMMA");let c$1=o.peek();if(!c$1||c$1.type!=="IDENT"&&c$1.type!=="UNIT")throw c.parsing("SOLVE_REQUIRES_VARIABLE_NAME","solve's second argument must be the name of the unknown to solve for, as in solve(x^2-4=0, x).",{found:c$1?.type??"end of input"});o.consume(),p(e,i,c$1.value),n?p(e,n,c$1.value):(e.emitOpcode(10),e.emitNumber(0)),s(e,c$1.value),o.consume("RPAREN"),e.emitOpcode(51),e.emitIndex(69),e.emitIndex(3);}};var y=class{constructor(){this.category="Symbolic";}parse(o,t,e){o.consume("LPAREN");let i=a(o,e,"der");o.consume("COMMA");let n=l(o,"der");p(e,i,n),s(e,n),o.match("COMMA")?o.parseExpression(a$1.Lowest,e):(e.emitOpcode(10),e.emitNumber(1)),o.consume("RPAREN"),e.emitOpcode(51),e.emitIndex(70),e.emitIndex(3);}};var P=class{constructor(){this.category="Symbolic";}parse(o,t,e){o.consume("LPAREN");let i=a(o,e,"integral");o.consume("COMMA");let n=l(o,"integral");p(e,i,n),s(e,n),o.consume("RPAREN"),e.emitOpcode(51),e.emitIndex(71),e.emitIndex(2);}};var L=class{constructor(){this.category="Symbolic";}parse(o,t,e){o.consume("LPAREN");let i=a(o,e,"taylor");o.consume("COMMA");let n=l(o,"taylor");p(e,i,n),s(e,n),o.consume("EQUALS"),o.parseExpression(a$1.Lowest,e),o.consume("COMMA"),o.parseExpression(a$1.Lowest,e),o.consume("RPAREN"),e.emitOpcode(51),e.emitIndex(72),e.emitIndex(4);}};var _=class{constructor(){this.category="Symbolic";}parse(o,t,e){o.consume("LPAREN");let i=0;do o.parseExpression(a$1.Lowest,e),i++;while(o.match("COMMA"));o.consume("RPAREN"),e.emitOpcode(51),e.emitIndex(73),e.emitIndex(i);}};var T=class{constructor(){this.category="Symbolic";}parse(o,t,e){e.emitOpcode(10),e.emitNumber(Number(t.value)),e.emitOpcode(51),e.emitIndex(74),e.emitIndex(1);}};var u=class{constructor(){this.category="Symbolic";}parse(o,t,e){o.consume("LPAREN"),o.parseExpression(a$1.Lowest,e),o.consume("RPAREN"),e.emitOpcode(51),e.emitIndex(75),e.emitIndex(1);}};var A=class{constructor(){this.category="Symbolic";}parse(o,t,e){o.consume("LPAREN"),o.parseExpression(a$1.Lowest,e),o.consume("RPAREN"),e.emitOpcode(51),e.emitIndex(76),e.emitIndex(1);}};var E=class{constructor(){this.category="Symbolic";}parse(o,t,e){o.consume("LPAREN"),o.parseExpression(a$1.Lowest,e),o.consume("RPAREN"),e.emitOpcode(51),e.emitIndex(77),e.emitIndex(1);}};var O=class{constructor(){this.category="Symbolic";}parse(o,t,e){o.consume("LPAREN"),o.parseExpression(a$1.Lowest,e),o.consume("RPAREN"),e.emitOpcode(51),e.emitIndex(78),e.emitIndex(1);}};var R=class{constructor(){this.category="Symbolic";}parse(o,t,e){o.consume("LPAREN"),o.parseExpression(a$1.Lowest,e),o.consume("RPAREN"),e.emitOpcode(51),e.emitIndex(79),e.emitIndex(1);}};function g(r=75){return {name:"symbolic:imaginary-literal",priority:r,match(o,t){let e=o[t];if(!e||e.type!=="NUMBER")return null;let i=o[t+1];return !i||i.type!=="IDENT"||i.value!=="i"||i.offset!==e.offset+e.value.length||o[t+2]?.type==="LPAREN"?null:{consumed:2,replacement:[new a$2("IMAGINARY",c$1("IMAGINARY"),e.value,e.value,e.offset,0,e.line,e.col)],ruleName:"symbolic:imaginary-literal"}}}}var b={expand:"EXPAND_FN",factor:"FACTOR_FN",solve:"SOLVE_FN",der:"DER_FN",derivative:"DER_FN",integral:"INTEGRAL_FN",taylor:"TAYLOR_FN",jacobian:"JACOBIAN_FN",conj:"CONJ_FN",re:"RE_FN",im:"IM_FN",cancel:"CANCEL_FN",apart:"APART_FN"};function k(r=80){return {name:"symbolic:call",priority:r,match(o,t){let e=o[t];if(!e||e.type!=="IDENT")return null;let i=b[e.value.toLowerCase()];return !i||o[t+1]?.type!=="LPAREN"?null:{consumed:1,replacement:[new a$2(i,c$1(i),e.value,e.value,e.offset,0,e.line,e.col)],ruleName:"symbolic:call"}}}}var S=[{word:"expand",tokenType:"EXPAND_FN",builtinIndex:67,example:"expand((x+1)*(x+2))",expected:"x^2+3x+2",docPage:"algebra.md"},{word:"factor",tokenType:"FACTOR_FN",builtinIndex:68,example:"factor(x^2-4)",expected:"(x-2)*(x+2)",docPage:"algebra.md"},{word:"solve",tokenType:"SOLVE_FN",builtinIndex:69,example:"solve(x^2-4=0, x)",expected:"= [-2, 2]",docPage:"algebra.md"},{word:"der",tokenType:"DER_FN",builtinIndex:70,example:"der(x^3, x)",expected:"3x^2",docPage:"calculus.md"},{word:"integral",tokenType:"INTEGRAL_FN",builtinIndex:71,example:"integral(x^2, x)",expected:"1/3x^3",docPage:"calculus.md"},{word:"taylor",tokenType:"TAYLOR_FN",builtinIndex:72,example:"taylor(exp(x), x=0, 3)",expected:"1/6x^3+0.5x^2+x+1",docPage:"calculus.md"},{word:"jacobian",tokenType:"JACOBIAN_FN",builtinIndex:73,example:"jacobian(x*y, x+y)",expected:"= [y, x; 1, 1]",docPage:"calculus.md"},{word:"conj",tokenType:"CONJ_FN",builtinIndex:75,example:"conj(2+3i)",expected:"2-3i",docPage:"complex.md"},{word:"re",tokenType:"RE_FN",builtinIndex:76,example:"re(2+3i)",expected:"= 2",docPage:"complex.md"},{word:"im",tokenType:"IM_FN",builtinIndex:77,example:"im(2+3i)",expected:"= 3",docPage:"complex.md"},{word:"cancel",tokenType:"CANCEL_FN",builtinIndex:78,example:"cancel((x^2-1)/(x-1))",expected:"x+1",docPage:"algebra.md"},{word:"apart",tokenType:"APART_FN",builtinIndex:79,example:"apart((3x+5)/(x^2-1))",expected:"4/(x-1)-1/(x+1)",docPage:"algebra.md"}],j={name:"solve-symbolic",normalizerRules:[k(),g()],prefixParselets:{EXPAND_FN:new I,FACTOR_FN:new x,SOLVE_FN:new B,DER_FN:new y,INTEGRAL_FN:new P,TAYLOR_FN:new L,JACOBIAN_FN:new _,IMAGINARY:new T,CONJ_FN:new u,RE_FN:new A,IM_FN:new E,CANCEL_FN:new O,APART_FN:new R},tokenCategories:{EXPAND_FN:"keyword",FACTOR_FN:"keyword",SOLVE_FN:"keyword",DER_FN:"keyword",INTEGRAL_FN:"keyword",TAYLOR_FN:"keyword",JACOBIAN_FN:"keyword",IMAGINARY:"number",CONJ_FN:"keyword",RE_FN:"keyword",IM_FN:"keyword",CANCEL_FN:"keyword",APART_FN:"keyword"}},X=new Set(S.map(r=>r.tokenType));function H(r){return r.some(o=>X.has(o.type))}export{j as a,H as b};//# sourceMappingURL=chunk-TN5E6JU6.js.map
+//# sourceMappingURL=chunk-TN5E6JU6.js.map

package/dist/chunk-TN5E6JU6.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/packages/symbolic/parselets/ExpandParselet.ts","../src/packages/symbolic/parselets/FactorParselet.ts","../src/packages/symbolic/parselets/VariableArgument.ts","../src/packages/symbolic/parselets/SolveParselet.ts","../src/packages/symbolic/parselets/DerParselet.ts","../src/packages/symbolic/parselets/IntegralParselet.ts","../src/packages/symbolic/parselets/TaylorParselet.ts","../src/packages/symbolic/parselets/JacobianParselet.ts","../src/packages/symbolic/parselets/ImaginaryParselet.ts","../src/packages/symbolic/parselets/ConjParselet.ts","../src/packages/symbolic/parselets/ReParselet.ts","../src/packages/symbolic/parselets/ImParselet.ts","../src/packages/symbolic/parselets/CancelParselet.ts","../src/packages/symbolic/parselets/ApartParselet.ts","../src/packages/symbolic/normalizer/ImaginaryLiteralNormalizerRule.ts","../src/packages/symbolic/normalizer/SymbolicCallNormalizerRule.ts","../src/packages/symbolic/SymbolicPackage.ts"],"names":["ExpandParselet","parser","_token","builder","BindingPower","FactorParselet","readVariableName","verb","token","ErrorFactory","emitVariableName","name","parseBoundExpression","inner","BytecodeBuilder","program","emitBoundExpression","index","SolveParselet","left","right","variable","DerParselet","expression","IntegralParselet","TaylorParselet","JacobianParselet","count","ImaginaryParselet","_parser","ConjParselet","ReParselet","ImParselet","CancelParselet","ApartParselet","imaginaryLiteralNormalizerRule","priority","tokens","pos","number","suffix","LexerToken","tokenTypeId","SYMBOLIC_WORD_TO_TOKEN_TYPE","symbolicCallNormalizerRule","tokenType","SYMBOLIC_FUNCTIONS","SYMBOLIC_PACKAGE","SYMBOLIC_TOKEN_TYPES","fn","containsSymbolicCall"],"mappings":"uKAoBO,IAAMA,EAAN,KAA+C,CAA/C,WAAA,EAAA,CACN,IAAA,CAAS,SAAW,WAAA,CAEpB,KAAA,CAAMC,CAAAA,CAAgBC,CAAAA,CAAeC,EAAgC,CACpEF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,EACvBA,CAAAA,CAAO,eAAA,CAAgBG,GAAAA,CAAa,MAAA,CAAQD,CAAO,CAAA,CACnDF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,EAEvBE,CAAAA,CAAQ,UAAA,CAAA,EAA8B,CAAA,CACtCA,CAAAA,CAAQ,UAAU,EAAuB,CAAA,CACzCA,CAAAA,CAAQ,SAAA,CAAU,CAAC,EACpB,CACD,CAAA,CCZO,IAAME,EAAN,KAA+C,CAA/C,WAAA,EAAA,CACN,IAAA,CAAS,SAAW,WAAA,CAEpB,KAAA,CAAMJ,CAAAA,CAAgBC,CAAAA,CAAeC,EAAgC,CACpEF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,EACvBA,CAAAA,CAAO,eAAA,CAAgBG,GAAAA,CAAa,MAAA,CAAQD,CAAO,CAAA,CACnDF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,EAEvBE,CAAAA,CAAQ,UAAA,CAAA,EAA8B,CAAA,CACtCA,CAAAA,CAAQ,UAAU,EAAuB,CAAA,CACzCA,CAAAA,CAAQ,SAAA,CAAU,CAAC,EACpB,CACD,CAAA,CCRO,SAASG,EAAiBL,CAAAA,CAAgBM,CAAAA,CAAsB,CACtE,IAAMC,EAAQP,CAAAA,CAAO,IAAA,EAAK,CAC1B,GAAI,CAACO,CAAAA,EAAUA,CAAAA,CAAM,IAAA,GAAS,OAAA,EAAWA,EAAM,IAAA,GAAS,MAAA,CACvD,MAAMC,CAAAA,CAAa,QAClB,iCAAA,CACA,CAAA,EAAGF,CAAI,CAAA,0CAAA,EAA6CA,CAAI,CAAA,SAAA,CAAA,CACxD,CAAE,KAAA,CAAOC,CAAAA,EAAO,MAAQ,cAAe,CACxC,CAAA,CAED,OAAAP,EAAO,OAAA,EAAQ,CACRO,CAAAA,CAAM,KACd,CAiBO,SAASE,CAAAA,CAAiBP,CAAAA,CAA0BQ,CAAAA,CAAoB,CAC9ER,CAAAA,CAAQ,UAAA,CAAA,EAA6B,CAAA,CACrCA,CAAAA,CAAQ,WAAWQ,CAAI,EACxB,CAoBO,SAASC,EAAqBX,CAAAA,CAAgBE,CAAAA,CAA0BI,CAAAA,CAA+B,CAC7G,IAAMM,CAAAA,CAAQ,IAAIC,CAAAA,CAAgBX,CAAAA,CAAQ,cAAc,CAAA,CACxDF,CAAAA,CAAO,eAAA,CAAgBG,GAAAA,CAAa,OAAQS,CAAK,CAAA,CACjDZ,CAAAA,CAAO,UAAA,CAAWE,CAAO,CAAA,CACzB,IAAMY,CAAAA,CAAUF,CAAAA,CAAM,OAAM,CAC5B,GAAIE,CAAAA,CAAQ,QAAA,CAIX,MAAMN,CAAAA,CAAa,OAAA,CAClB,uCAAA,CACA,CAAA,EAAGF,CAAI,CAAA,qEAAA,CACR,CAAA,CAED,OAAOQ,CACR,CAkBO,SAASC,CAAAA,CAAoBb,CAAAA,CAA0BY,CAAAA,CAA0BJ,EAAoB,CAC3G,IAAMM,CAAAA,CAAQd,CAAAA,CAAQ,kBAAkB,CAACQ,CAAI,CAAA,CAAGI,CAAO,EACvDZ,CAAAA,CAAQ,UAAA,CAAA,GAA8B,CAAA,CACtCA,CAAAA,CAAQ,UAAUc,CAAK,EACxB,CChFO,IAAMC,EAAN,KAA8C,CAA9C,WAAA,EAAA,CACN,IAAA,CAAS,SAAW,WAAA,CAEpB,KAAA,CAAMjB,CAAAA,CAAgBC,CAAAA,CAAeC,EAAgC,CACpEF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,EACvB,IAAMkB,CAAAA,CAAOP,CAAAA,CAAqBX,CAAAA,CAAQE,EAAS,OAAO,CAAA,CACpDiB,CAAAA,CAAQnB,CAAAA,CAAO,MAAM,QAAQ,CAAA,CAAIW,CAAAA,CAAqBX,CAAAA,CAAQE,EAAS,OAAO,CAAA,CAAI,IAAA,CAExFF,CAAAA,CAAO,QAAQ,OAAO,CAAA,CAItB,IAAMoB,GAAAA,CAAWpB,EAAO,IAAA,EAAK,CAC7B,GAAI,CAACoB,KAAaA,GAAAA,CAAS,IAAA,GAAS,OAAA,EAAWA,GAAAA,CAAS,OAAS,MAAA,CAChE,MAAMZ,CAAAA,CAAa,OAAA,CAClB,+BACA,gGAAA,CACA,CAAE,KAAA,CAAOY,GAAAA,EAAU,MAAQ,cAAe,CAC3C,CAAA,CAEDpB,CAAAA,CAAO,SAAQ,CAEfe,CAAAA,CAAoBb,CAAAA,CAASgB,CAAAA,CAAME,IAAS,KAAK,CAAA,CAC7CD,CAAAA,CACHJ,CAAAA,CAAoBb,EAASiB,CAAAA,CAAOC,GAAAA,CAAS,KAAK,CAAA,EAGlDlB,EAAQ,UAAA,CAAA,EAA6B,CAAA,CACrCA,CAAAA,CAAQ,UAAA,CAAW,CAAC,CAAA,CAAA,CAErBO,CAAAA,CAAiBP,CAAAA,CAASkB,GAAAA,CAAS,KAAK,CAAA,CAExCpB,CAAAA,CAAO,OAAA,CAAQ,QAAQ,EAEvBE,CAAAA,CAAQ,UAAA,CAAA,EAA8B,CAAA,CACtCA,CAAAA,CAAQ,UAAU,EAAsB,CAAA,CACxCA,CAAAA,CAAQ,SAAA,CAAU,CAAC,EACpB,CACD,CAAA,CCpDO,IAAMmB,EAAN,KAA4C,CAA5C,cACN,IAAA,CAAS,QAAA,CAAW,YAEpB,KAAA,CAAMrB,CAAAA,CAAgBC,CAAAA,CAAeC,CAAAA,CAAgC,CACpEF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,CACvB,IAAMsB,CAAAA,CAAaX,CAAAA,CAAqBX,CAAAA,CAAQE,CAAAA,CAAS,KAAK,CAAA,CAC9DF,CAAAA,CAAO,OAAA,CAAQ,OAAO,EACtB,IAAMoB,CAAAA,CAAWf,CAAAA,CAAiBL,CAAAA,CAAQ,KAAK,CAAA,CAC/Ce,CAAAA,CAAoBb,CAAAA,CAASoB,CAAAA,CAAYF,CAAQ,CAAA,CACjDX,CAAAA,CAAiBP,CAAAA,CAASkB,CAAQ,EAG9BpB,CAAAA,CAAO,KAAA,CAAM,OAAO,CAAA,CACvBA,EAAO,eAAA,CAAgBG,GAAAA,CAAa,MAAA,CAAQD,CAAO,GAEnDA,CAAAA,CAAQ,UAAA,CAAA,EAA6B,CAAA,CACrCA,CAAAA,CAAQ,WAAW,CAAC,CAAA,CAAA,CAErBF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,CAEvBE,CAAAA,CAAQ,UAAA,CAAA,EAA8B,CAAA,CACtCA,EAAQ,SAAA,CAAU,EAAoB,CAAA,CACtCA,CAAAA,CAAQ,UAAU,CAAC,EACpB,CACD,CAAA,CC5BO,IAAMqB,CAAAA,CAAN,KAAiD,CAAjD,WAAA,EAAA,CACN,KAAS,QAAA,CAAW,WAAA,CAEpB,KAAA,CAAMvB,CAAAA,CAAgBC,EAAeC,CAAAA,CAAgC,CACpEF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,CACvB,IAAMsB,CAAAA,CAAaX,CAAAA,CAAqBX,EAAQE,CAAAA,CAAS,UAAU,CAAA,CACnEF,CAAAA,CAAO,QAAQ,OAAO,CAAA,CACtB,IAAMoB,CAAAA,CAAWf,EAAiBL,CAAAA,CAAQ,UAAU,CAAA,CACpDe,CAAAA,CAAoBb,EAASoB,CAAAA,CAAYF,CAAQ,CAAA,CACjDX,CAAAA,CAAiBP,EAASkB,CAAQ,CAAA,CAClCpB,CAAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,CAEvBE,CAAAA,CAAQ,UAAA,CAAA,EAA8B,CAAA,CACtCA,EAAQ,SAAA,CAAU,EAAyB,CAAA,CAC3CA,CAAAA,CAAQ,UAAU,CAAC,EACpB,CACD,CAAA,CCVO,IAAMsB,CAAAA,CAAN,KAA+C,CAA/C,WAAA,EAAA,CACN,KAAS,QAAA,CAAW,WAAA,CAEpB,KAAA,CAAMxB,CAAAA,CAAgBC,EAAeC,CAAAA,CAAgC,CACpEF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,CACvB,IAAMsB,CAAAA,CAAaX,CAAAA,CAAqBX,EAAQE,CAAAA,CAAS,QAAQ,CAAA,CACjEF,CAAAA,CAAO,QAAQ,OAAO,CAAA,CACtB,IAAMoB,CAAAA,CAAWf,CAAAA,CAAiBL,EAAQ,QAAQ,CAAA,CAClDe,CAAAA,CAAoBb,CAAAA,CAASoB,EAAYF,CAAQ,CAAA,CACjDX,CAAAA,CAAiBP,CAAAA,CAASkB,CAAQ,CAAA,CAClCpB,CAAAA,CAAO,OAAA,CAAQ,QAAQ,EACvBA,CAAAA,CAAO,eAAA,CAAgBG,GAAAA,CAAa,MAAA,CAAQD,CAAO,CAAA,CACnDF,CAAAA,CAAO,OAAA,CAAQ,OAAO,EACtBA,CAAAA,CAAO,eAAA,CAAgBG,GAAAA,CAAa,MAAA,CAAQD,CAAO,CAAA,CACnDF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,EAEvBE,CAAAA,CAAQ,UAAA,CAAA,EAA8B,CAAA,CACtCA,CAAAA,CAAQ,UAAU,EAAuB,CAAA,CACzCA,CAAAA,CAAQ,SAAA,CAAU,CAAC,EACpB,CACD,CAAA,CCzBO,IAAMuB,EAAN,KAAiD,CAAjD,WAAA,EAAA,CACN,IAAA,CAAS,SAAW,WAAA,CAEpB,KAAA,CAAMzB,CAAAA,CAAgBC,CAAAA,CAAeC,EAAgC,CACpEF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,EACvB,IAAI0B,CAAAA,CAAQ,CAAA,CACZ,GACC1B,EAAO,eAAA,CAAgBG,GAAAA,CAAa,MAAA,CAAQD,CAAO,EACnDwB,CAAAA,EAAAA,CAAAA,MACQ1B,CAAAA,CAAO,KAAA,CAAM,OAAO,GAC7BA,CAAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,CAEvBE,EAAQ,UAAA,CAAA,EAA8B,CAAA,CACtCA,CAAAA,CAAQ,SAAA,CAAU,EAAyB,CAAA,CAC3CA,CAAAA,CAAQ,SAAA,CAAUwB,CAAK,EACxB,CACD,CAAA,CCfO,IAAMC,CAAAA,CAAN,KAAkD,CAAlD,WAAA,EAAA,CACN,IAAA,CAAS,QAAA,CAAW,YAEpB,KAAA,CAAMC,CAAAA,CAAiBrB,CAAAA,CAAcL,CAAAA,CAAgC,CACpEA,CAAAA,CAAQ,UAAA,CAAA,EAA6B,CAAA,CACrCA,CAAAA,CAAQ,WAAW,MAAA,CAAOK,CAAAA,CAAM,KAAK,CAAC,EACtCL,CAAAA,CAAQ,UAAA,CAAA,EAA8B,CAAA,CACtCA,CAAAA,CAAQ,UAAU,EAA0B,CAAA,CAC5CA,CAAAA,CAAQ,SAAA,CAAU,CAAC,EACpB,CACD,CAAA,CCXO,IAAM2B,EAAN,KAA6C,CAA7C,WAAA,EAAA,CACN,IAAA,CAAS,SAAW,WAAA,CAEpB,KAAA,CAAM7B,CAAAA,CAAgBC,CAAAA,CAAeC,EAAgC,CACpEF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,EACvBA,CAAAA,CAAO,eAAA,CAAgBG,GAAAA,CAAa,MAAA,CAAQD,CAAO,CAAA,CACnDF,CAAAA,CAAO,QAAQ,QAAQ,CAAA,CAEvBE,EAAQ,UAAA,CAAA,EAA8B,CAAA,CACtCA,CAAAA,CAAQ,SAAA,CAAU,EAAqB,CAAA,CACvCA,CAAAA,CAAQ,SAAA,CAAU,CAAC,EACpB,CACD,CAAA,CCZO,IAAM4B,CAAAA,CAAN,KAA2C,CAA3C,WAAA,EAAA,CACN,IAAA,CAAS,QAAA,CAAW,YAEpB,KAAA,CAAM9B,CAAAA,CAAgBC,CAAAA,CAAeC,CAAAA,CAAgC,CACpEF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,CACvBA,EAAO,eAAA,CAAgBG,GAAAA,CAAa,MAAA,CAAQD,CAAO,EACnDF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,CAEvBE,EAAQ,UAAA,CAAA,EAA8B,CAAA,CACtCA,CAAAA,CAAQ,SAAA,CAAU,EAAmB,CAAA,CACrCA,CAAAA,CAAQ,SAAA,CAAU,CAAC,EACpB,CACD,CAAA,CCZO,IAAM6B,CAAAA,CAAN,KAA2C,CAA3C,WAAA,EAAA,CACN,IAAA,CAAS,QAAA,CAAW,YAEpB,KAAA,CAAM/B,CAAAA,CAAgBC,CAAAA,CAAeC,CAAAA,CAAgC,CACpEF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,CACvBA,EAAO,eAAA,CAAgBG,GAAAA,CAAa,MAAA,CAAQD,CAAO,EACnDF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,CAEvBE,EAAQ,UAAA,CAAA,EAA8B,CAAA,CACtCA,CAAAA,CAAQ,SAAA,CAAU,EAAmB,CAAA,CACrCA,CAAAA,CAAQ,SAAA,CAAU,CAAC,EACpB,CACD,CAAA,CCZO,IAAM8B,CAAAA,CAAN,KAA+C,CAA/C,WAAA,EAAA,CACN,IAAA,CAAS,QAAA,CAAW,YAEpB,KAAA,CAAMhC,CAAAA,CAAgBC,CAAAA,CAAeC,CAAAA,CAAgC,CACpEF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,CACvBA,EAAO,eAAA,CAAgBG,GAAAA,CAAa,MAAA,CAAQD,CAAO,EACnDF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,CAEvBE,EAAQ,UAAA,CAAA,EAA8B,CAAA,CACtCA,CAAAA,CAAQ,SAAA,CAAU,EAAuB,CAAA,CACzCA,CAAAA,CAAQ,SAAA,CAAU,CAAC,EACpB,CACD,CAAA,CCbO,IAAM+B,CAAAA,CAAN,KAA8C,CAA9C,WAAA,EAAA,CACN,IAAA,CAAS,QAAA,CAAW,YAEpB,KAAA,CAAMjC,CAAAA,CAAgBC,CAAAA,CAAeC,CAAAA,CAAgC,CACpEF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,CACvBA,EAAO,eAAA,CAAgBG,GAAAA,CAAa,MAAA,CAAQD,CAAO,EACnDF,CAAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,CAEvBE,EAAQ,UAAA,CAAA,EAA8B,CAAA,CACtCA,CAAAA,CAAQ,SAAA,CAAU,EAAsB,CAAA,CACxCA,CAAAA,CAAQ,SAAA,CAAU,CAAC,EACpB,CACD,CAAA,CCJO,SAASgC,CAAAA,CAA+BC,EAAW,EAAA,CAAoB,CAC7E,OAAO,CACN,KAAM,4BAAA,CACN,QAAA,CAAAA,CAAAA,CACA,KAAA,CAAMC,EAAiBC,CAAAA,CAAqC,CAC3D,IAAMC,CAAAA,CAASF,EAAOC,CAAG,CAAA,CACzB,GAAI,CAACC,GAAUA,CAAAA,CAAO,IAAA,GAAS,QAAA,CAAU,OAAO,KAEhD,IAAMC,CAAAA,CAASH,CAAAA,CAAOC,CAAAA,CAAM,CAAC,CAAA,CAQ7B,OAPI,CAACE,CAAAA,EAAUA,EAAO,IAAA,GAAS,OAAA,EAAWA,CAAAA,CAAO,KAAA,GAAU,KAGvDA,CAAAA,CAAO,MAAA,GAAWD,CAAAA,CAAO,MAAA,CAASA,EAAO,KAAA,CAAM,MAAA,EAI/CF,CAAAA,CAAOC,CAAAA,CAAM,CAAC,CAAA,EAAG,IAAA,GAAS,QAAA,CAAiB,IAAA,CAExC,CACN,QAAA,CAAU,CAAA,CACV,WAAA,CAAa,CACZ,IAAIG,GAAAA,CACH,WAAA,CACAC,GAAAA,CAAY,WAAW,EACvBH,CAAAA,CAAO,KAAA,CACPA,CAAAA,CAAO,KAAA,CACPA,EAAO,MAAA,CACP,CAAA,CACAA,CAAAA,CAAO,IAAA,CACPA,EAAO,GACR,CACD,CAAA,CACA,QAAA,CAAU,4BACX,CACD,CACD,CACD,CC9CO,IAAMI,CAAAA,CAAgE,CAC5E,MAAA,CAAQ,WAAA,CACR,OAAQ,WAAA,CACR,KAAA,CAAO,UAAA,CACP,GAAA,CAAK,SACL,UAAA,CAAY,QAAA,CACZ,QAAA,CAAU,aAAA,CACV,OAAQ,WAAA,CACR,QAAA,CAAU,aAAA,CACV,IAAA,CAAM,UACN,EAAA,CAAI,OAAA,CACJ,EAAA,CAAI,OAAA,CACJ,OAAQ,WAAA,CACR,KAAA,CAAO,UACR,CAAA,CAoBO,SAASC,CAAAA,CAA2BR,CAAAA,CAAW,EAAA,CAAoB,CACzE,OAAO,CACN,IAAA,CAAM,eAAA,CACN,QAAA,CAAAA,EACA,KAAA,CAAMC,CAAAA,CAAiBC,CAAAA,CAAqC,CAC3D,IAAM9B,CAAAA,CAAQ6B,CAAAA,CAAOC,CAAG,CAAA,CACxB,GAAI,CAAC9B,CAAAA,EAASA,CAAAA,CAAM,IAAA,GAAS,QAAS,OAAO,IAAA,CAC7C,IAAMqC,CAAAA,CAAYF,CAAAA,CAA4BnC,EAAM,KAAA,CAAM,WAAA,EAAa,CAAA,CAEvE,OADI,CAACqC,CAAAA,EACDR,CAAAA,CAAOC,CAAAA,CAAM,CAAC,CAAA,EAAG,IAAA,GAAS,QAAA,CAAiB,IAAA,CAExC,CACN,QAAA,CAAU,CAAA,CACV,WAAA,CAAa,CACZ,IAAIG,GAAAA,CAAWI,CAAAA,CAAWH,GAAAA,CAAYG,CAAS,EAAGrC,CAAAA,CAAM,KAAA,CAAOA,CAAAA,CAAM,KAAA,CAAOA,EAAM,MAAA,CAAQ,CAAA,CAAGA,CAAAA,CAAM,IAAA,CAAMA,EAAM,GAAG,CACnH,CAAA,CACA,QAAA,CAAU,eACX,CACD,CACD,CACD,KCTasC,CAAAA,CAAyD,CACrE,CACC,IAAA,CAAM,SACN,SAAA,CAAW,WAAA,CACX,YAAA,CAAc,EAAA,CACd,QAAS,qBAAA,CACT,QAAA,CAAU,UAAA,CACV,OAAA,CAAS,YACV,CAAA,CACA,CACC,IAAA,CAAM,QAAA,CACN,UAAW,WAAA,CACX,YAAA,CAAc,EAAA,CACd,OAAA,CAAS,gBACT,QAAA,CAAU,aAAA,CACV,OAAA,CAAS,YACV,EACA,CACC,IAAA,CAAM,OAAA,CACN,SAAA,CAAW,WACX,YAAA,CAAc,EAAA,CACd,OAAA,CAAS,mBAAA,CACT,SAAU,WAAA,CACV,OAAA,CAAS,YACV,CAAA,CACA,CACC,IAAA,CAAM,KAAA,CACN,SAAA,CAAW,QAAA,CACX,aAAc,EAAA,CACd,OAAA,CAAS,aAAA,CACT,QAAA,CAAU,OACV,OAAA,CAAS,aACV,CAAA,CACA,CACC,KAAM,UAAA,CACN,SAAA,CAAW,aAAA,CACX,YAAA,CAAc,GACd,OAAA,CAAS,kBAAA,CACT,QAAA,CAAU,QAAA,CACV,QAAS,aACV,CAAA,CACA,CACC,IAAA,CAAM,SACN,SAAA,CAAW,WAAA,CACX,YAAA,CAAc,EAAA,CACd,QAAS,wBAAA,CACT,QAAA,CAAU,mBAAA,CACV,OAAA,CAAS,aACV,CAAA,CACA,CACC,IAAA,CAAM,UAAA,CACN,UAAW,aAAA,CACX,YAAA,CAAc,EAAA,CACd,OAAA,CAAS,qBACT,QAAA,CAAU,gBAAA,CACV,OAAA,CAAS,aACV,EACA,CACC,IAAA,CAAM,MAAA,CACN,SAAA,CAAW,UACX,YAAA,CAAc,EAAA,CACd,OAAA,CAAS,YAAA,CACT,SAAU,MAAA,CACV,OAAA,CAAS,YACV,CAAA,CACA,CACC,KAAM,IAAA,CACN,SAAA,CAAW,OAAA,CACX,YAAA,CAAc,GACd,OAAA,CAAS,UAAA,CACT,QAAA,CAAU,KAAA,CACV,QAAS,YACV,CAAA,CACA,CACC,IAAA,CAAM,KACN,SAAA,CAAW,OAAA,CACX,YAAA,CAAc,EAAA,CACd,QAAS,UAAA,CACT,QAAA,CAAU,KAAA,CACV,OAAA,CAAS,YACV,CAAA,CACA,CACC,IAAA,CAAM,QAAA,CACN,UAAW,WAAA,CACX,YAAA,CAAc,EAAA,CACd,OAAA,CAAS,wBACT,QAAA,CAAU,KAAA,CACV,OAAA,CAAS,YACV,EACA,CACC,IAAA,CAAM,OAAA,CACN,SAAA,CAAW,WACX,YAAA,CAAc,EAAA,CACd,OAAA,CAAS,uBAAA,CACT,SAAU,iBAAA,CACV,OAAA,CAAS,YACV,CACD,EAaaC,CAAAA,CAAmC,CAC/C,IAAA,CAAM,gBAAA,CACN,gBAAiB,CAACH,CAAAA,EAA2B,CAAGT,CAAAA,EAAgC,CAAA,CAChF,eAAA,CAAiB,CAChB,SAAA,CAAW,IAAInC,CAAAA,CACf,SAAA,CAAW,IAAIK,CAAAA,CACf,SAAU,IAAIa,CAAAA,CACd,MAAA,CAAQ,IAAII,EACZ,WAAA,CAAa,IAAIE,CAAAA,CACjB,SAAA,CAAW,IAAIC,CAAAA,CACf,WAAA,CAAa,IAAIC,CAAAA,CACjB,UAAW,IAAIE,CAAAA,CACf,OAAA,CAAS,IAAIE,EACb,KAAA,CAAO,IAAIC,CAAAA,CACX,KAAA,CAAO,IAAIC,CAAAA,CACX,SAAA,CAAW,IAAIC,CAAAA,CACf,SAAU,IAAIC,CACf,CAAA,CACA,eAAA,CAAiB,CAChB,SAAA,CAAW,SAAA,CACX,SAAA,CAAW,SAAA,CACX,SAAU,SAAA,CACV,MAAA,CAAQ,SAAA,CACR,WAAA,CAAa,UACb,SAAA,CAAW,SAAA,CACX,WAAA,CAAa,SAAA,CACb,UAAW,QAAA,CACX,OAAA,CAAS,SAAA,CACT,KAAA,CAAO,UACP,KAAA,CAAO,SAAA,CACP,SAAA,CAAW,SAAA,CACX,SAAU,SACX,CACD,CAAA,CAGMc,CAAAA,CAA4C,IAAI,GAAA,CAAIF,CAAAA,CAAmB,GAAA,CAAIG,CAAAA,EAAMA,EAAG,SAAS,CAAC,EAa7F,SAASC,EAAqBb,CAAAA,CAA8C,CAClF,OAAOA,CAAAA,CAAO,KAAK7B,CAAAA,EAASwC,CAAAA,CAAqB,IAAIxC,CAAAA,CAAM,IAAI,CAAC,CACjE","file":"chunk-TN5E6JU6.js","sourcesContent":["import { PrefixParselet } from \"@solve-js/parser/Parselet\";\nimport { Parser } from \"@solve-js/parser/Parser\";\nimport { Token } from \"@solve-js/lexer/Token\";\nimport { BytecodeBuilder } from \"@solve-js/parser/BytecodeBuilder\";\nimport { OpCode } from \"@solve-js/parser/OpCode\";\nimport { BindingPower } from \"@solve-js/parser/BindingPower\";\nimport { SYMBOLIC_BUILTIN_EXPAND } from \"@solve-js/packages/symbolic/SymbolicBuiltinIndex\";\n\n/**\n * `expand(expr)`, multiplying out every product and power.\n *\n * A dedicated parselet rather than a `builtinNameToIndex` entry reached through\n * the ordinary `FunctionCallParselet`, because that route needs the lexer to\n * emit `FUNC` for the word, which means a `keywordMap` entry, which would stop\n * `expand` working as an ordinary variable name. See\n * `normalizer/SymbolicCallNormalizerRule.ts`.\n *\n * The emitted bytecode is an ordinary `CALL_BUILTIN`, so no new opcode and no\n * new VM dispatch arm is involved.\n */\nexport class ExpandParselet implements PrefixParselet {\n\treadonly category = \"Symbolic\";\n\n\tparse(parser: Parser, _token: Token, builder: BytecodeBuilder): void {\n\t\tparser.consume(\"LPAREN\");\n\t\tparser.parseExpression(BindingPower.Lowest, builder);\n\t\tparser.consume(\"RPAREN\");\n\n\t\tbuilder.emitOpcode(OpCode.CALL_BUILTIN);\n\t\tbuilder.emitIndex(SYMBOLIC_BUILTIN_EXPAND);\n\t\tbuilder.emitIndex(1);\n\t}\n}\n","import { PrefixParselet } from \"@solve-js/parser/Parselet\";\nimport { Parser } from \"@solve-js/parser/Parser\";\nimport { Token } from \"@solve-js/lexer/Token\";\nimport { BytecodeBuilder } from \"@solve-js/parser/BytecodeBuilder\";\nimport { OpCode } from \"@solve-js/parser/OpCode\";\nimport { BindingPower } from \"@solve-js/parser/BindingPower\";\nimport { SYMBOLIC_BUILTIN_FACTOR } from \"@solve-js/packages/symbolic/SymbolicBuiltinIndex\";\n\n/**\n * `factor(expr)`, writing a polynomial as a product of irreducible factors over the rationals.\n *\n * A dedicated parselet rather than a `builtinNameToIndex` entry reached through\n * the ordinary `FunctionCallParselet`, because that route needs the lexer to\n * emit `FUNC` for the word, which means a `keywordMap` entry, which would stop\n * `expand` working as an ordinary variable name. See\n * `normalizer/SymbolicCallNormalizerRule.ts`.\n *\n * The emitted bytecode is an ordinary `CALL_BUILTIN`, so no new opcode and no\n * new VM dispatch arm is involved.\n */\nexport class FactorParselet implements PrefixParselet {\n\treadonly category = \"Symbolic\";\n\n\tparse(parser: Parser, _token: Token, builder: BytecodeBuilder): void {\n\t\tparser.consume(\"LPAREN\");\n\t\tparser.parseExpression(BindingPower.Lowest, builder);\n\t\tparser.consume(\"RPAREN\");\n\n\t\tbuilder.emitOpcode(OpCode.CALL_BUILTIN);\n\t\tbuilder.emitIndex(SYMBOLIC_BUILTIN_FACTOR);\n\t\tbuilder.emitIndex(1);\n\t}\n}\n","import { Parser } from \"@solve-js/parser/Parser\";\nimport { BytecodeBuilder, type BytecodeProgram } from \"@solve-js/parser/BytecodeBuilder\";\nimport { OpCode } from \"@solve-js/parser/OpCode\";\nimport { BindingPower } from \"@solve-js/parser/BindingPower\";\nimport { ErrorFactory } from \"@solve-js/errors/UnifiedErrorFramework\";\n\n/**\n * Reads a bare variable name argument and returns it, consuming the token.\n *\n * Shared by every algebra verb that takes \"which unknown\" as an argument.\n * Compiling the name as an ordinary variable read would require it to already\n * have a value, which is precisely what differentiating or solving with respect\n * to it says it does not.\n *\n * Requiring `IDENT` or `UNIT` here gives the same reserved-word protection\n * `VariableParselet` relies on: a keyword always lexes as its own token type,\n * so it can never reach this position and be taken for a variable name.\n *\n * @param parser - The parser, positioned at the name.\n * @param verb - The calling verb's name, for the error message.\n * @returns The name as written.\n * @throws {EngineError} `SYMBOLIC_REQUIRES_VARIABLE_NAME` when the next token is\n * not a bare name.\n */\nexport function readVariableName(parser: Parser, verb: string): string {\n\tconst token = parser.peek();\n\tif (!token || (token.type !== \"IDENT\" && token.type !== \"UNIT\")) {\n\t\tthrow ErrorFactory.parsing(\n\t\t\t\"SYMBOLIC_REQUIRES_VARIABLE_NAME\",\n\t\t\t`${verb} needs the name of an unknown here, as in ${verb}(x^2, x).`,\n\t\t\t{ found: token?.type ?? \"end of input\" },\n\t\t);\n\t}\n\tparser.consume();\n\treturn token.value;\n}\n\n/**\n * Reads a bare variable name argument and emits it as a string constant.\n *\n * Pushing the name as a String means the builtin receives it directly and the\n * VM needs no special case.\n *\n * @param parser - The parser, positioned at the name.\n * @param builder - The bytecode builder to emit into.\n * @param verb - The calling verb's name, for the error message.\n */\nexport function consumeVariableName(parser: Parser, builder: BytecodeBuilder, verb: string): void {\n\temitVariableName(builder, readVariableName(parser, verb));\n}\n\n/** Emits an already-read unknown's name as the String argument the algebra builtins read it as. */\nexport function emitVariableName(builder: BytecodeBuilder, name: string): void {\n\tbuilder.emitOpcode(OpCode.PUSH_STRING);\n\tbuilder.emitString(name);\n}\n\n/**\n * Parses an algebra verb's expression argument into its own independent\n * program, rather than emitting it inline.\n *\n * The verb names its unknown AFTER the expression (`der(x^2, x)`), so the\n * expression has to be held rather than emitted: only once the name is known\n * can it be paired with {@link emitBoundExpression}, which is what makes the\n * name shadow any document value it happens to share. Compiled into an\n * isolated builder exactly like a user-defined function body or a map/reduce\n * transform, and `parseExpression` leaves `parser.builder` pointing at the\n * isolated one with no automatic restore, so the caller's builder is put back\n * before returning.\n *\n * @param parser - The parser, positioned at the start of the expression.\n * @param builder - The builder to restore afterwards.\n * @param verb - The calling verb's name, for the error message.\n * @returns The compiled expression, to be handed to {@link emitBoundExpression}.\n */\nexport function parseBoundExpression(parser: Parser, builder: BytecodeBuilder, verb: string): BytecodeProgram {\n\tconst inner = new BytecodeBuilder(builder.pluginIndexMap);\n\tparser.parseExpression(BindingPower.Lowest, inner);\n\tparser.setBuilder(builder);\n\tconst program = inner.build();\n\tif (program.hasAsync) {\n\t\t// Same v1 restriction every other deferred body carries (user-defined\n\t\t// functions, map/reduce transforms): a reentrant execution cannot\n\t\t// suspend and resume the outer expression around an async result.\n\t\tthrow ErrorFactory.parsing(\n\t\t\t\"SYMBOLIC_ARGUMENT_MUST_BE_SYNCHRONOUS\",\n\t\t\t`${verb}'s expression must be synchronous (no weather/stocks/currency calls).`,\n\t\t);\n\t}\n\treturn program;\n}\n\n/**\n * Emits a held expression so that it evaluates with `name` bound to itself.\n *\n * This is what makes `der(x^2, x)` mean the derivative of a square rather than\n * the derivative of a constant on a page that also says `:x = 5`. Naming `x` as\n * the verb's argument declares it bound, so within the expression it is an\n * unknown and nothing else, exactly the way a function's parameter shadows a\n * document variable of the same name inside its body. Before this, the\n * expression was compiled inline and its `x` was an ordinary variable read, so\n * the verb received 25 and answered 0 with no indication that it had not been\n * asked the question the user wrote.\n *\n * @param builder - The builder to emit into.\n * @param program - The expression, from {@link parseBoundExpression}.\n * @param name - The unknown the verb named, bound for the expression's evaluation.\n */\nexport function emitBoundExpression(builder: BytecodeBuilder, program: BytecodeProgram, name: string): void {\n\tconst index = builder.emitAnonymousBody([name], program);\n\tbuilder.emitOpcode(OpCode.BIND_UNKNOWN);\n\tbuilder.emitIndex(index);\n}\n","import { PrefixParselet } from \"@solve-js/parser/Parselet\";\nimport { Parser } from \"@solve-js/parser/Parser\";\nimport { Token } from \"@solve-js/lexer/Token\";\nimport { BytecodeBuilder } from \"@solve-js/parser/BytecodeBuilder\";\nimport { OpCode } from \"@solve-js/parser/OpCode\";\nimport { ErrorFactory } from \"@solve-js/errors/UnifiedErrorFramework\";\nimport { SYMBOLIC_BUILTIN_SOLVE } from \"@solve-js/packages/symbolic/SymbolicBuiltinIndex\";\nimport { emitVariableName, parseBoundExpression, emitBoundExpression } from \"@solve-js/packages/symbolic/parselets/VariableArgument\";\n\n/**\n * `solve(equation, variable)`, for example `solve(x^2-4=0, x)`.\n *\n * Two things here cannot go through the ordinary function-call grammar, which\n * is why this is a hand-written parselet.\n *\n * The first argument contains a bare `=`, which no infix parselet consumes, so\n * an ordinary argument list would fail to parse it. This reads the two sides\n * separately and lets a missing right-hand side default to zero, so\n * `solve(x^2-4, x)` means the same as `solve(x^2-4=0, x)`.\n *\n * The second argument is a *name*, not a value. Compiling it as a `LOAD_VAR`\n * would demand that the variable already exist, which is exactly what solving\n * for it says it does not. Emitting it as a `PUSH_STRING` instead means the\n * builtin receives a plain String value and the VM needs no change at all.\n *\n * Both sides of the equation are held until that name has been read, so each\n * evaluates with the unknown bound to itself rather than to whatever value the\n * document may already have given it. See {@link emitBoundExpression}: with\n * `:x = 5` above it, `solve(x^2-4=0, x)` was solving `21 = 0` and reporting,\n * accurately for the question it was asked and uselessly for the one written,\n * that there is no solution.\n */\nexport class SolveParselet implements PrefixParselet {\n\treadonly category = \"Symbolic\";\n\n\tparse(parser: Parser, _token: Token, builder: BytecodeBuilder): void {\n\t\tparser.consume(\"LPAREN\");\n\t\tconst left = parseBoundExpression(parser, builder, \"solve\");\n\t\tconst right = parser.match(\"EQUALS\") ? parseBoundExpression(parser, builder, \"solve\") : null;\n\n\t\tparser.consume(\"COMMA\");\n\t\t// Requiring IDENT or UNIT here is the same protection VariableParselet\n\t\t// relies on: a reserved word always lexes as its own token type, so it\n\t\t// can never reach this position and be mistaken for a variable name.\n\t\tconst variable = parser.peek();\n\t\tif (!variable || (variable.type !== \"IDENT\" && variable.type !== \"UNIT\")) {\n\t\t\tthrow ErrorFactory.parsing(\n\t\t\t\t\"SOLVE_REQUIRES_VARIABLE_NAME\",\n\t\t\t\t`solve's second argument must be the name of the unknown to solve for, as in solve(x^2-4=0, x).`,\n\t\t\t\t{ found: variable?.type ?? \"end of input\" },\n\t\t\t);\n\t\t}\n\t\tparser.consume();\n\n\t\temitBoundExpression(builder, left, variable.value);\n\t\tif (right) {\n\t\t\temitBoundExpression(builder, right, variable.value);\n\t\t} else {\n\t\t\t// No `=` written, so the equation is \"this expression equals zero\".\n\t\t\tbuilder.emitOpcode(OpCode.PUSH_NUMBER);\n\t\t\tbuilder.emitNumber(0);\n\t\t}\n\t\temitVariableName(builder, variable.value);\n\n\t\tparser.consume(\"RPAREN\");\n\n\t\tbuilder.emitOpcode(OpCode.CALL_BUILTIN);\n\t\tbuilder.emitIndex(SYMBOLIC_BUILTIN_SOLVE);\n\t\tbuilder.emitIndex(3);\n\t}\n}\n","import { PrefixParselet } from \"@solve-js/parser/Parselet\";\nimport { Parser } from \"@solve-js/parser/Parser\";\nimport { Token } from \"@solve-js/lexer/Token\";\nimport { BytecodeBuilder } from \"@solve-js/parser/BytecodeBuilder\";\nimport { OpCode } from \"@solve-js/parser/OpCode\";\nimport { BindingPower } from \"@solve-js/parser/BindingPower\";\nimport { SYMBOLIC_BUILTIN_DER } from \"@solve-js/packages/symbolic/SymbolicBuiltinIndex\";\nimport { readVariableName, emitVariableName, parseBoundExpression, emitBoundExpression } from \"@solve-js/packages/symbolic/parselets/VariableArgument\";\n\n/**\n * `der(expr, variable)` and `der(expr, variable, order)`, the symbolic\n * derivative. `derivative` is accepted as the same thing.\n *\n * The variable is emitted as a string rather than compiled as a variable read,\n * for the reason given in {@link readVariableName}, and `expr` is held until\n * that name is known so it can be evaluated with the name bound. See\n * {@link emitBoundExpression}.\n */\nexport class DerParselet implements PrefixParselet {\n\treadonly category = \"Symbolic\";\n\n\tparse(parser: Parser, _token: Token, builder: BytecodeBuilder): void {\n\t\tparser.consume(\"LPAREN\");\n\t\tconst expression = parseBoundExpression(parser, builder, \"der\");\n\t\tparser.consume(\"COMMA\");\n\t\tconst variable = readVariableName(parser, \"der\");\n\t\temitBoundExpression(builder, expression, variable);\n\t\temitVariableName(builder, variable);\n\n\t\t// The order is optional and defaults to a first derivative.\n\t\tif (parser.match(\"COMMA\")) {\n\t\t\tparser.parseExpression(BindingPower.Lowest, builder);\n\t\t} else {\n\t\t\tbuilder.emitOpcode(OpCode.PUSH_NUMBER);\n\t\t\tbuilder.emitNumber(1);\n\t\t}\n\t\tparser.consume(\"RPAREN\");\n\n\t\tbuilder.emitOpcode(OpCode.CALL_BUILTIN);\n\t\tbuilder.emitIndex(SYMBOLIC_BUILTIN_DER);\n\t\tbuilder.emitIndex(3);\n\t}\n}\n","import { PrefixParselet } from \"@solve-js/parser/Parselet\";\nimport { Parser } from \"@solve-js/parser/Parser\";\nimport { Token } from \"@solve-js/lexer/Token\";\nimport { BytecodeBuilder } from \"@solve-js/parser/BytecodeBuilder\";\nimport { OpCode } from \"@solve-js/parser/OpCode\";\nimport { SYMBOLIC_BUILTIN_INTEGRAL } from \"@solve-js/packages/symbolic/SymbolicBuiltinIndex\";\nimport { readVariableName, emitVariableName, parseBoundExpression, emitBoundExpression } from \"@solve-js/packages/symbolic/parselets/VariableArgument\";\n\n/**\n * `integral(expr, variable)`, the indefinite integral, without a constant of\n * integration. `expr` is held until the variable is read so that the named\n * unknown shadows any document value of the same name, see\n * {@link emitBoundExpression}.\n */\nexport class IntegralParselet implements PrefixParselet {\n\treadonly category = \"Symbolic\";\n\n\tparse(parser: Parser, _token: Token, builder: BytecodeBuilder): void {\n\t\tparser.consume(\"LPAREN\");\n\t\tconst expression = parseBoundExpression(parser, builder, \"integral\");\n\t\tparser.consume(\"COMMA\");\n\t\tconst variable = readVariableName(parser, \"integral\");\n\t\temitBoundExpression(builder, expression, variable);\n\t\temitVariableName(builder, variable);\n\t\tparser.consume(\"RPAREN\");\n\n\t\tbuilder.emitOpcode(OpCode.CALL_BUILTIN);\n\t\tbuilder.emitIndex(SYMBOLIC_BUILTIN_INTEGRAL);\n\t\tbuilder.emitIndex(2);\n\t}\n}\n","import { PrefixParselet } from \"@solve-js/parser/Parselet\";\nimport { Parser } from \"@solve-js/parser/Parser\";\nimport { Token } from \"@solve-js/lexer/Token\";\nimport { BytecodeBuilder } from \"@solve-js/parser/BytecodeBuilder\";\nimport { OpCode } from \"@solve-js/parser/OpCode\";\nimport { BindingPower } from \"@solve-js/parser/BindingPower\";\nimport { SYMBOLIC_BUILTIN_TAYLOR } from \"@solve-js/packages/symbolic/SymbolicBuiltinIndex\";\nimport { readVariableName, emitVariableName, parseBoundExpression, emitBoundExpression } from \"@solve-js/packages/symbolic/parselets/VariableArgument\";\n\n/**\n * `taylor(expr, variable = point, degree)`, matching Calca's own spelling.\n *\n * The `variable = point` argument is why this needs a hand-written parselet:\n * `EQUALS` has no infix parselet, so an ordinary argument list cannot parse it.\n * Reading the name and the point separately also means the name never has to\n * exist as a variable, and `expr` is held until the name is known so that the\n * name shadows any document value it shares (see {@link emitBoundExpression}).\n * The expansion point is an ordinary value expression and is not shadowed: it\n * is a number, not the unknown.\n */\nexport class TaylorParselet implements PrefixParselet {\n\treadonly category = \"Symbolic\";\n\n\tparse(parser: Parser, _token: Token, builder: BytecodeBuilder): void {\n\t\tparser.consume(\"LPAREN\");\n\t\tconst expression = parseBoundExpression(parser, builder, \"taylor\");\n\t\tparser.consume(\"COMMA\");\n\t\tconst variable = readVariableName(parser, \"taylor\");\n\t\temitBoundExpression(builder, expression, variable);\n\t\temitVariableName(builder, variable);\n\t\tparser.consume(\"EQUALS\");\n\t\tparser.parseExpression(BindingPower.Lowest, builder);\n\t\tparser.consume(\"COMMA\");\n\t\tparser.parseExpression(BindingPower.Lowest, builder);\n\t\tparser.consume(\"RPAREN\");\n\n\t\tbuilder.emitOpcode(OpCode.CALL_BUILTIN);\n\t\tbuilder.emitIndex(SYMBOLIC_BUILTIN_TAYLOR);\n\t\tbuilder.emitIndex(4);\n\t}\n}\n","import { PrefixParselet } from \"@solve-js/parser/Parselet\";\nimport { Parser } from \"@solve-js/parser/Parser\";\nimport { Token } from \"@solve-js/lexer/Token\";\nimport { BytecodeBuilder } from \"@solve-js/parser/BytecodeBuilder\";\nimport { OpCode } from \"@solve-js/parser/OpCode\";\nimport { BindingPower } from \"@solve-js/parser/BindingPower\";\nimport { SYMBOLIC_BUILTIN_JACOBIAN } from \"@solve-js/packages/symbolic/SymbolicBuiltinIndex\";\n\n/**\n * `jacobian(f1, f2, ...)`, the matrix of partial derivatives.\n *\n * Variadic, and the variables are not named: they are taken from the union of\n * the functions' own unknowns, sorted, which is what Calca does. Row `i` is the\n * gradient of the `i`-th function.\n */\nexport class JacobianParselet implements PrefixParselet {\n\treadonly category = \"Symbolic\";\n\n\tparse(parser: Parser, _token: Token, builder: BytecodeBuilder): void {\n\t\tparser.consume(\"LPAREN\");\n\t\tlet count = 0;\n\t\tdo {\n\t\t\tparser.parseExpression(BindingPower.Lowest, builder);\n\t\t\tcount++;\n\t\t} while (parser.match(\"COMMA\"));\n\t\tparser.consume(\"RPAREN\");\n\n\t\tbuilder.emitOpcode(OpCode.CALL_BUILTIN);\n\t\tbuilder.emitIndex(SYMBOLIC_BUILTIN_JACOBIAN);\n\t\tbuilder.emitIndex(count);\n\t}\n}\n","import { PrefixParselet } from \"@solve-js/parser/Parselet\";\nimport { Parser } from \"@solve-js/parser/Parser\";\nimport { Token } from \"@solve-js/lexer/Token\";\nimport { BytecodeBuilder } from \"@solve-js/parser/BytecodeBuilder\";\nimport { OpCode } from \"@solve-js/parser/OpCode\";\nimport { SYMBOLIC_BUILTIN_IMAGINARY } from \"@solve-js/packages/symbolic/SymbolicBuiltinIndex\";\n\n/**\n * An imaginary literal, `3i`, fused by\n * `normalizer/ImaginaryLiteralNormalizerRule.ts`.\n *\n * The token carries the numeric part as its value; this pushes that number and\n * lets the builtin turn it into an exact imaginary value. Going through a\n * builtin rather than a dedicated opcode keeps the VM dispatch table untouched,\n * the same choice every other algebra verb made.\n */\nexport class ImaginaryParselet implements PrefixParselet {\n\treadonly category = \"Symbolic\";\n\n\tparse(_parser: Parser, token: Token, builder: BytecodeBuilder): void {\n\t\tbuilder.emitOpcode(OpCode.PUSH_NUMBER);\n\t\tbuilder.emitNumber(Number(token.value));\n\t\tbuilder.emitOpcode(OpCode.CALL_BUILTIN);\n\t\tbuilder.emitIndex(SYMBOLIC_BUILTIN_IMAGINARY);\n\t\tbuilder.emitIndex(1);\n\t}\n}\n","import { PrefixParselet } from \"@solve-js/parser/Parselet\";\nimport { Parser } from \"@solve-js/parser/Parser\";\nimport { Token } from \"@solve-js/lexer/Token\";\nimport { BytecodeBuilder } from \"@solve-js/parser/BytecodeBuilder\";\nimport { OpCode } from \"@solve-js/parser/OpCode\";\nimport { BindingPower } from \"@solve-js/parser/BindingPower\";\nimport { SYMBOLIC_BUILTIN_CONJ } from \"@solve-js/packages/symbolic/SymbolicBuiltinIndex\";\n\n/**\n * `conj(z)`, the complex conjugate.\n *\n * A dedicated parselet rather than a keywordMap entry, for the reason given in\n * `normalizer/SymbolicCallNormalizerRule.ts`: `re` and `im` are short words a\n * person may well use as variable names.\n */\nexport class ConjParselet implements PrefixParselet {\n\treadonly category = \"Symbolic\";\n\n\tparse(parser: Parser, _token: Token, builder: BytecodeBuilder): void {\n\t\tparser.consume(\"LPAREN\");\n\t\tparser.parseExpression(BindingPower.Lowest, builder);\n\t\tparser.consume(\"RPAREN\");\n\n\t\tbuilder.emitOpcode(OpCode.CALL_BUILTIN);\n\t\tbuilder.emitIndex(SYMBOLIC_BUILTIN_CONJ);\n\t\tbuilder.emitIndex(1);\n\t}\n}\n","import { PrefixParselet } from \"@solve-js/parser/Parselet\";\nimport { Parser } from \"@solve-js/parser/Parser\";\nimport { Token } from \"@solve-js/lexer/Token\";\nimport { BytecodeBuilder } from \"@solve-js/parser/BytecodeBuilder\";\nimport { OpCode } from \"@solve-js/parser/OpCode\";\nimport { BindingPower } from \"@solve-js/parser/BindingPower\";\nimport { SYMBOLIC_BUILTIN_RE } from \"@solve-js/packages/symbolic/SymbolicBuiltinIndex\";\n\n/**\n * `re(z)`, the real part of a complex value.\n *\n * A dedicated parselet rather than a keywordMap entry, for the reason given in\n * `normalizer/SymbolicCallNormalizerRule.ts`: `re` and `im` are short words a\n * person may well use as variable names.\n */\nexport class ReParselet implements PrefixParselet {\n\treadonly category = \"Symbolic\";\n\n\tparse(parser: Parser, _token: Token, builder: BytecodeBuilder): void {\n\t\tparser.consume(\"LPAREN\");\n\t\tparser.parseExpression(BindingPower.Lowest, builder);\n\t\tparser.consume(\"RPAREN\");\n\n\t\tbuilder.emitOpcode(OpCode.CALL_BUILTIN);\n\t\tbuilder.emitIndex(SYMBOLIC_BUILTIN_RE);\n\t\tbuilder.emitIndex(1);\n\t}\n}\n","import { PrefixParselet } from \"@solve-js/parser/Parselet\";\nimport { Parser } from \"@solve-js/parser/Parser\";\nimport { Token } from \"@solve-js/lexer/Token\";\nimport { BytecodeBuilder } from \"@solve-js/parser/BytecodeBuilder\";\nimport { OpCode } from \"@solve-js/parser/OpCode\";\nimport { BindingPower } from \"@solve-js/parser/BindingPower\";\nimport { SYMBOLIC_BUILTIN_IM } from \"@solve-js/packages/symbolic/SymbolicBuiltinIndex\";\n\n/**\n * `im(z)`, the imaginary part of a complex value.\n *\n * A dedicated parselet rather than a keywordMap entry, for the reason given in\n * `normalizer/SymbolicCallNormalizerRule.ts`: `re` and `im` are short words a\n * person may well use as variable names.\n */\nexport class ImParselet implements PrefixParselet {\n\treadonly category = \"Symbolic\";\n\n\tparse(parser: Parser, _token: Token, builder: BytecodeBuilder): void {\n\t\tparser.consume(\"LPAREN\");\n\t\tparser.parseExpression(BindingPower.Lowest, builder);\n\t\tparser.consume(\"RPAREN\");\n\n\t\tbuilder.emitOpcode(OpCode.CALL_BUILTIN);\n\t\tbuilder.emitIndex(SYMBOLIC_BUILTIN_IM);\n\t\tbuilder.emitIndex(1);\n\t}\n}\n","import { PrefixParselet } from \"@solve-js/parser/Parselet\";\nimport { Parser } from \"@solve-js/parser/Parser\";\nimport { Token } from \"@solve-js/lexer/Token\";\nimport { BytecodeBuilder } from \"@solve-js/parser/BytecodeBuilder\";\nimport { OpCode } from \"@solve-js/parser/OpCode\";\nimport { BindingPower } from \"@solve-js/parser/BindingPower\";\nimport { SYMBOLIC_BUILTIN_CANCEL } from \"@solve-js/packages/symbolic/SymbolicBuiltinIndex\";\n\n/**\n * `cancel(expr)`, reducing a quotient of polynomials to lowest terms.\n *\n * The simplifier already cancels a common factor automatically; this is the\n * explicit form, for when the intent is to reduce a fraction rather than to\n * evaluate something that happens to contain one.\n */\nexport class CancelParselet implements PrefixParselet {\n\treadonly category = \"Symbolic\";\n\n\tparse(parser: Parser, _token: Token, builder: BytecodeBuilder): void {\n\t\tparser.consume(\"LPAREN\");\n\t\tparser.parseExpression(BindingPower.Lowest, builder);\n\t\tparser.consume(\"RPAREN\");\n\n\t\tbuilder.emitOpcode(OpCode.CALL_BUILTIN);\n\t\tbuilder.emitIndex(SYMBOLIC_BUILTIN_CANCEL);\n\t\tbuilder.emitIndex(1);\n\t}\n}\n","import { PrefixParselet } from \"@solve-js/parser/Parselet\";\nimport { Parser } from \"@solve-js/parser/Parser\";\nimport { Token } from \"@solve-js/lexer/Token\";\nimport { BytecodeBuilder } from \"@solve-js/parser/BytecodeBuilder\";\nimport { OpCode } from \"@solve-js/parser/OpCode\";\nimport { BindingPower } from \"@solve-js/parser/BindingPower\";\nimport { SYMBOLIC_BUILTIN_APART } from \"@solve-js/packages/symbolic/SymbolicBuiltinIndex\";\n\n/**\n * `apart(expr)`, splitting a rational function into partial fractions.\n *\n * The inverse of putting a sum of fractions over a common denominator, and the\n * step that makes a rational function integrable.\n */\nexport class ApartParselet implements PrefixParselet {\n\treadonly category = \"Symbolic\";\n\n\tparse(parser: Parser, _token: Token, builder: BytecodeBuilder): void {\n\t\tparser.consume(\"LPAREN\");\n\t\tparser.parseExpression(BindingPower.Lowest, builder);\n\t\tparser.consume(\"RPAREN\");\n\n\t\tbuilder.emitOpcode(OpCode.CALL_BUILTIN);\n\t\tbuilder.emitIndex(SYMBOLIC_BUILTIN_APART);\n\t\tbuilder.emitIndex(1);\n\t}\n}\n","import type { Token } from \"@solve-js/lexer/Token\";\nimport { tokenTypeId } from \"@solve-js/lexer/Token\";\nimport { LexerToken } from \"@solve-js/lexer/ExpressionLexer\";\nimport type { NormalizerRule, NormalizerMatch } from \"@solve-js/normalizer/NormalizerRule\";\n\n/**\n * Fuses `3i` into a single imaginary literal, but only when the `i` is written\n * flush against the number.\n *\n * `i` is not claimed as a keyword, and deliberately so. It is one of the most\n * common variable names there is, and this engine's whole trigger-word policy\n * exists to avoid taking words a person would reasonably assign to. `:i = 5`\n * has to keep working, and after this rule it does: the rule only fires on a\n * number immediately followed by the letter, which is the same shape the\n * magnitude suffixes use, and `2.5k` set that precedent.\n *\n * Adjacency is checked by source offset rather than by token order, so `3i` is\n * an imaginary literal while `3 i` and `3 * i` are a number multiplied by a\n * variable named `i`. That is the distinction that keeps both readings\n * available, and it is the reason a bare `i` on its own is still a variable.\n * Write `1i` for the imaginary unit alone.\n */\nexport function imaginaryLiteralNormalizerRule(priority = 75): NormalizerRule {\n\treturn {\n\t\tname: \"symbolic:imaginary-literal\",\n\t\tpriority,\n\t\tmatch(tokens: Token[], pos: number): NormalizerMatch | null {\n\t\t\tconst number = tokens[pos];\n\t\t\tif (!number || number.type !== \"NUMBER\") return null;\n\n\t\t\tconst suffix = tokens[pos + 1];\n\t\t\tif (!suffix || suffix.type !== \"IDENT\" || suffix.value !== \"i\") return null;\n\n\t\t\t// Flush against the number, with no space between them.\n\t\t\tif (suffix.offset !== number.offset + number.value.length) return null;\n\n\t\t\t// A following `(` would make this a call, as in `3i(x)`, which is not a\n\t\t\t// shape this claims.\n\t\t\tif (tokens[pos + 2]?.type === \"LPAREN\") return null;\n\n\t\t\treturn {\n\t\t\t\tconsumed: 2,\n\t\t\t\treplacement: [\n\t\t\t\t\tnew LexerToken(\n\t\t\t\t\t\t\"IMAGINARY\",\n\t\t\t\t\t\ttokenTypeId(\"IMAGINARY\"),\n\t\t\t\t\t\tnumber.value,\n\t\t\t\t\t\tnumber.value,\n\t\t\t\t\t\tnumber.offset,\n\t\t\t\t\t\t0,\n\t\t\t\t\t\tnumber.line,\n\t\t\t\t\t\tnumber.col,\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t\truleName: \"symbolic:imaginary-literal\",\n\t\t\t};\n\t\t},\n\t};\n}\n","import type { Token } from \"@solve-js/lexer/Token\";\nimport { tokenTypeId } from \"@solve-js/lexer/Token\";\nimport { LexerToken } from \"@solve-js/lexer/ExpressionLexer\";\nimport type { NormalizerRule, NormalizerMatch } from \"@solve-js/normalizer/NormalizerRule\";\n\n/**\n * The algebra verbs, mapped to the token type each becomes when it is being\n * called.\n *\n * Kept in one place so {@link SYMBOLIC_FUNCTIONS} in `SymbolicPackage.ts` and\n * this rule cannot disagree about which words the package claims.\n */\nexport const SYMBOLIC_WORD_TO_TOKEN_TYPE: Readonly<Record<string, string>> = {\n\texpand: \"EXPAND_FN\",\n\tfactor: \"FACTOR_FN\",\n\tsolve: \"SOLVE_FN\",\n\tder: \"DER_FN\",\n\tderivative: \"DER_FN\",\n\tintegral: \"INTEGRAL_FN\",\n\ttaylor: \"TAYLOR_FN\",\n\tjacobian: \"JACOBIAN_FN\",\n\tconj: \"CONJ_FN\",\n\tre: \"RE_FN\",\n\tim: \"IM_FN\",\n\tcancel: \"CANCEL_FN\",\n\tapart: \"APART_FN\",\n};\n\n/**\n * Fuses an algebra verb into its own token type, but only when the bare word is\n * immediately followed by `(`.\n *\n * None of these words may be a plain `keywordMap` entry, and the reason is\n * concrete rather than stylistic. A `keywordMap` entry makes the lexer emit a\n * reserved token type everywhere the word appears, which would break\n * `:factor = 1.5` and `:solve = 2` as ordinary variable names. `solve` is also\n * the product's own name and `factor` is an everyday English noun, so both are\n * words a user will reasonably assign to.\n *\n * Mirrors `packages/mapreduce/normalizer/MapReduceCallNormalizerRule.ts`, which\n * exists for exactly this reason for `map`/`reduce`/`sum`/`prod`.\n *\n * @param priority - Rule ordering within the normalizer, defaulting to the same\n * band the map/reduce call rule uses.\n * @returns The normalizer rule.\n */\nexport function symbolicCallNormalizerRule(priority = 80): NormalizerRule {\n\treturn {\n\t\tname: \"symbolic:call\",\n\t\tpriority,\n\t\tmatch(tokens: Token[], pos: number): NormalizerMatch | null {\n\t\t\tconst token = tokens[pos];\n\t\t\tif (!token || token.type !== \"IDENT\") return null;\n\t\t\tconst tokenType = SYMBOLIC_WORD_TO_TOKEN_TYPE[token.value.toLowerCase()];\n\t\t\tif (!tokenType) return null;\n\t\t\tif (tokens[pos + 1]?.type !== \"LPAREN\") return null;\n\n\t\t\treturn {\n\t\t\t\tconsumed: 1,\n\t\t\t\treplacement: [\n\t\t\t\t\tnew LexerToken(tokenType, tokenTypeId(tokenType), token.value, token.value, token.offset, 0, token.line, token.col),\n\t\t\t\t],\n\t\t\t\truleName: \"symbolic:call\",\n\t\t\t};\n\t\t},\n\t};\n}\n","import type { IEnginePackage } from \"@solve-js/api/PackageRegistry\";\nimport { ExpandParselet } from \"./parselets/ExpandParselet\";\nimport { FactorParselet } from \"./parselets/FactorParselet\";\nimport { SolveParselet } from \"./parselets/SolveParselet\";\nimport { DerParselet } from \"./parselets/DerParselet\";\nimport { IntegralParselet } from \"./parselets/IntegralParselet\";\nimport { TaylorParselet } from \"./parselets/TaylorParselet\";\nimport { JacobianParselet } from \"./parselets/JacobianParselet\";\nimport { ImaginaryParselet } from \"./parselets/ImaginaryParselet\";\nimport { ConjParselet } from \"./parselets/ConjParselet\";\nimport { ReParselet } from \"./parselets/ReParselet\";\nimport { ImParselet } from \"./parselets/ImParselet\";\nimport { CancelParselet } from \"./parselets/CancelParselet\";\nimport { ApartParselet } from \"./parselets/ApartParselet\";\nimport { imaginaryLiteralNormalizerRule } from \"./normalizer/ImaginaryLiteralNormalizerRule\";\nimport { symbolicCallNormalizerRule } from \"./normalizer/SymbolicCallNormalizerRule\";\nimport {\n\tSYMBOLIC_BUILTIN_EXPAND,\n\tSYMBOLIC_BUILTIN_FACTOR,\n\tSYMBOLIC_BUILTIN_SOLVE,\n\tSYMBOLIC_BUILTIN_DER,\n\tSYMBOLIC_BUILTIN_INTEGRAL,\n\tSYMBOLIC_BUILTIN_TAYLOR,\n\tSYMBOLIC_BUILTIN_JACOBIAN,\n\tSYMBOLIC_BUILTIN_CONJ,\n\tSYMBOLIC_BUILTIN_RE,\n\tSYMBOLIC_BUILTIN_IM,\n\tSYMBOLIC_BUILTIN_CANCEL,\n\tSYMBOLIC_BUILTIN_APART,\n} from \"./SymbolicBuiltinIndex\";\n\n/**\n * One algebra verb's whole surface, in a single row.\n *\n * Everything a verb needs in order to work is listed here rather than being\n * spread across the normalizer, the parselet registry, the builtin table and\n * the docs, so `__tests__/engine/SymbolicSurfaceParity.spec.ts` can check the\n * pieces actually agree. Shipping a verb whose index has no implementation, or\n * whose parselet is registered under a token type the normalizer never mints,\n * then becomes a failing test rather than a silent dead feature.\n */\nexport interface SymbolicFunctionSurface {\n\t/** The bare word a user types. */\n\treadonly word: string;\n\t/** The token type the normalizer fuses it into when it is followed by `(`. */\n\treadonly tokenType: string;\n\t/** The `CALL_BUILTIN` index its parselet emits. */\n\treadonly builtinIndex: number;\n\t/** A working example, executed by the parity spec through every public entry point. */\n\treadonly example: string;\n\t/** That example's expected formatted result. */\n\treadonly expected: string;\n\t/** The documentation page under `docs/src/content/docs/syntax/` that must show it. */\n\treadonly docPage: string;\n}\n\n/** Every algebra verb this package registers. */\nexport const SYMBOLIC_FUNCTIONS: readonly SymbolicFunctionSurface[] = [\n\t{\n\t\tword: \"expand\",\n\t\ttokenType: \"EXPAND_FN\",\n\t\tbuiltinIndex: SYMBOLIC_BUILTIN_EXPAND,\n\t\texample: \"expand((x+1)*(x+2))\",\n\t\texpected: \"x^2+3x+2\",\n\t\tdocPage: \"algebra.md\",\n\t},\n\t{\n\t\tword: \"factor\",\n\t\ttokenType: \"FACTOR_FN\",\n\t\tbuiltinIndex: SYMBOLIC_BUILTIN_FACTOR,\n\t\texample: \"factor(x^2-4)\",\n\t\texpected: \"(x-2)*(x+2)\",\n\t\tdocPage: \"algebra.md\",\n\t},\n\t{\n\t\tword: \"solve\",\n\t\ttokenType: \"SOLVE_FN\",\n\t\tbuiltinIndex: SYMBOLIC_BUILTIN_SOLVE,\n\t\texample: \"solve(x^2-4=0, x)\",\n\t\texpected: \"= [-2, 2]\",\n\t\tdocPage: \"algebra.md\",\n\t},\n\t{\n\t\tword: \"der\",\n\t\ttokenType: \"DER_FN\",\n\t\tbuiltinIndex: SYMBOLIC_BUILTIN_DER,\n\t\texample: \"der(x^3, x)\",\n\t\texpected: \"3x^2\",\n\t\tdocPage: \"calculus.md\",\n\t},\n\t{\n\t\tword: \"integral\",\n\t\ttokenType: \"INTEGRAL_FN\",\n\t\tbuiltinIndex: SYMBOLIC_BUILTIN_INTEGRAL,\n\t\texample: \"integral(x^2, x)\",\n\t\texpected: \"1/3x^3\",\n\t\tdocPage: \"calculus.md\",\n\t},\n\t{\n\t\tword: \"taylor\",\n\t\ttokenType: \"TAYLOR_FN\",\n\t\tbuiltinIndex: SYMBOLIC_BUILTIN_TAYLOR,\n\t\texample: \"taylor(exp(x), x=0, 3)\",\n\t\texpected: \"1/6x^3+0.5x^2+x+1\",\n\t\tdocPage: \"calculus.md\",\n\t},\n\t{\n\t\tword: \"jacobian\",\n\t\ttokenType: \"JACOBIAN_FN\",\n\t\tbuiltinIndex: SYMBOLIC_BUILTIN_JACOBIAN,\n\t\texample: \"jacobian(x*y, x+y)\",\n\t\texpected: \"= [y, x; 1, 1]\",\n\t\tdocPage: \"calculus.md\",\n\t},\n\t{\n\t\tword: \"conj\",\n\t\ttokenType: \"CONJ_FN\",\n\t\tbuiltinIndex: SYMBOLIC_BUILTIN_CONJ,\n\t\texample: \"conj(2+3i)\",\n\t\texpected: \"2-3i\",\n\t\tdocPage: \"complex.md\",\n\t},\n\t{\n\t\tword: \"re\",\n\t\ttokenType: \"RE_FN\",\n\t\tbuiltinIndex: SYMBOLIC_BUILTIN_RE,\n\t\texample: \"re(2+3i)\",\n\t\texpected: \"= 2\",\n\t\tdocPage: \"complex.md\",\n\t},\n\t{\n\t\tword: \"im\",\n\t\ttokenType: \"IM_FN\",\n\t\tbuiltinIndex: SYMBOLIC_BUILTIN_IM,\n\t\texample: \"im(2+3i)\",\n\t\texpected: \"= 3\",\n\t\tdocPage: \"complex.md\",\n\t},\n\t{\n\t\tword: \"cancel\",\n\t\ttokenType: \"CANCEL_FN\",\n\t\tbuiltinIndex: SYMBOLIC_BUILTIN_CANCEL,\n\t\texample: \"cancel((x^2-1)/(x-1))\",\n\t\texpected: \"x+1\",\n\t\tdocPage: \"algebra.md\",\n\t},\n\t{\n\t\tword: \"apart\",\n\t\ttokenType: \"APART_FN\",\n\t\tbuiltinIndex: SYMBOLIC_BUILTIN_APART,\n\t\texample: \"apart((3x+5)/(x^2-1))\",\n\t\texpected: \"4/(x-1)-1/(x+1)\",\n\t\tdocPage: \"algebra.md\",\n\t},\n];\n\n/**\n * Symbolic algebra verbs: multiplying out, and (in later phases) factoring,\n * solving and calculus.\n *\n * The algebra itself lives in `symbolic/`, which is pure mathematics over the\n * expression tree. This package is only the grammar surface: which words become\n * which tokens, and which parselet emits which builtin call.\n *\n * None of these words is a bare `keywordMap` entry. See\n * `normalizer/SymbolicCallNormalizerRule.ts` for why that matters.\n */\nexport const SYMBOLIC_PACKAGE: IEnginePackage = {\n\tname: \"solve-symbolic\",\n\tnormalizerRules: [symbolicCallNormalizerRule(), imaginaryLiteralNormalizerRule()],\n\tprefixParselets: {\n\t\tEXPAND_FN: new ExpandParselet(),\n\t\tFACTOR_FN: new FactorParselet(),\n\t\tSOLVE_FN: new SolveParselet(),\n\t\tDER_FN: new DerParselet(),\n\t\tINTEGRAL_FN: new IntegralParselet(),\n\t\tTAYLOR_FN: new TaylorParselet(),\n\t\tJACOBIAN_FN: new JacobianParselet(),\n\t\tIMAGINARY: new ImaginaryParselet(),\n\t\tCONJ_FN: new ConjParselet(),\n\t\tRE_FN: new ReParselet(),\n\t\tIM_FN: new ImParselet(),\n\t\tCANCEL_FN: new CancelParselet(),\n\t\tAPART_FN: new ApartParselet(),\n\t},\n\ttokenCategories: {\n\t\tEXPAND_FN: \"keyword\",\n\t\tFACTOR_FN: \"keyword\",\n\t\tSOLVE_FN: \"keyword\",\n\t\tDER_FN: \"keyword\",\n\t\tINTEGRAL_FN: \"keyword\",\n\t\tTAYLOR_FN: \"keyword\",\n\t\tJACOBIAN_FN: \"keyword\",\n\t\tIMAGINARY: \"number\",\n\t\tCONJ_FN: \"keyword\",\n\t\tRE_FN: \"keyword\",\n\t\tIM_FN: \"keyword\",\n\t\tCANCEL_FN: \"keyword\",\n\t\tAPART_FN: \"keyword\",\n\t},\n};\n\n/** The token types the algebra verbs fuse into, for the engine's own \"is this line symbolic\" check. */\nconst SYMBOLIC_TOKEN_TYPES: ReadonlySet<string> = new Set(SYMBOLIC_FUNCTIONS.map(fn => fn.tokenType));\n\n/**\n * Whether a normalized token list calls an algebra verb.\n *\n * `engine/ExpressionEngine.ts` uses this to evaluate such a line in\n * symbolic-tolerant mode without requiring a trailing `=>`, since asking to\n * expand or factor something is already a statement that its unknowns are meant\n * to stay unknown.\n *\n * @param tokens - The normalized tokens for one line.\n * @returns True when any token is an algebra verb.\n */\nexport function containsSymbolicCall(tokens: readonly { type: string }[]): boolean {\n\treturn tokens.some(token => SYMBOLIC_TOKEN_TYPES.has(token.type));\n}\n"]}

package/dist/chunk-TRBXW6HW.js

@@ -0,0 +1,2 @@
+import {a,f}from'./chunk-2JMFUQZH.js';var r=new Map([["in","the IN keyword owns this word (the conversion operator). ConvertParselet and friends special-case the IN token type directly and trust its text as a unit name, so inches still convert"],["dec","already a converter name, as in `255 as dec`"],["M","the millions magnitude suffix, as in `2.5M`. Nautical miles are still spelled `nmi` and `NM`"],["pm","the meridiem marker, as in `4pm`. Picometres lose, and `picometre` still works"],["are","the English verb, against a 100-square-metre unit almost nobody writes"],["ares","the English verb in plural, same reasoning as `are` above"],["turn","ordinary English, against a full-rotation angle unit also spelled in gradians"],["turns","ordinary English in plural, same reasoning as `turn` above"],["grade","ordinary English. The angle unit is also spelled `gon` and `grad`"],["grades","ordinary English in plural, same reasoning as `grade` above"],["point","ordinary English. The typographic point is also reachable as `pica`"],["points","ordinary English in plural, same reasoning as `point` above"],["moment","ordinary English, against an obscure medieval time unit of 90 seconds"],["moments","ordinary English in plural, same reasoning as `moment` above"],["shake","ordinary English, against an obscure physics unit of ten nanoseconds"],["shakes","ordinary English in plural, same reasoning as `shake` above"]]);function s(n){return /^[A-Za-z0-9_]+$/.test(n)}var i=new Set(["m","g","t","s","h","d","l","b","B","C","F","K","W"]);function o(n){return !s(n)||r.has(n)?false:n.length===1?i.has(n):true}var t=["USD","EUR","GBP","JPY","AUD","CAD","CHF","CNY","SEK","NOK","DKK","NZD","KRW","SGD","HKD","TWD","INR","BRL","ZAR","MXN","RUB","TRY","SAR","AED","ILS","PLN","CZK","HUF","THB","IDR","MYR","PHP","CLP","COP","ARS","NGN","EGP","PKR","BDT","VND","KES","XOF","XAF","MAD","QAR","KWD","OMR","BHD","JOD","LKR","MMK","UZS","KZT","RON","BGN","HRK","ISK","UAH","GEL","AZN","BTN","BND","BOB","BWP","BYN","BZD","CDF","CRC","CUP","DOP","DZD","ERN","ETB","FJD","FKP","GMD","GNF","GYD","HNL","HTG","JMD","KGZ","KHR","KMF","KYD","LAK","LBP","LRD","LSL","LYD","MDL","MGA","MKD","MNT","MOP","MRU","MUR","MVR","MWK","MZN","NAD","NIO","NPR","PGK","PYG","RSD","RWF","SBD","SCR","SDG","SHP","SLE","SOS","SRD","SSP","STN","SVC","SYP","SZL","TJS","TMT","TND","TOP","TTD","TZS","UGX","UYU","VEB","VUV","WST","XCD","XDR","XPF","YER","ZMW","ZWL","BTC","ETH","SOL","XRP","ADA","DOGE","DOT"],l=["dollar","dollars","euro","euros","yen","ruble","rubles","rouble","roubles","won","rupee","rupees","yuan","renminbi","franc","francs","rand","krona","kronor","krone","kroner","real","reais","peso","pesos","shekel","shekels","lira","hryvnia","hryvnias","zloty","zlotys","forint","koruna","dirham","dirhams","riyal","riyals","rial","rials","ringgit","rupiah","baht","dong","naira"],D=["workday","workdays"],d=new Set([...Object.keys(a).filter(o),...Object.keys(f),...D,...t,...l]);function g(n){return d.has(n)}export{d as a,g as b};//# sourceMappingURL=chunk-TRBXW6HW.js.map
+//# sourceMappingURL=chunk-TRBXW6HW.js.map

package/dist/{chunk-AQNHHJMJ.cjs.map → chunk-TRBXW6HW.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/lexer/units.ts"],"names":["UNIT_TABLE","EXTENDED_UNITS"],"mappings":";;;;;AAmCA,IAAM,uBAAA,uBAA2D,GAAA,CAAI;AAAA,EACnE,CAAC,MAAM,yLAAyL,CAAA;AAAA,EAChM,CAAC,OAAO,8CAA8C,CAAA;AAAA,EACtD,CAAC,KAAK,8FAA8F,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOpG,CAAC,MAAM,gFAAgF,CAAA;AAAA,EACvF,CAAC,OAAO,wEAAwE,CAAA;AAAA,EAChF,CAAC,QAAQ,2DAA2D,CAAA;AAAA,EACpE,CAAC,QAAQ,+EAA+E,CAAA;AAAA,EACxF,CAAC,SAAS,4DAA4D,CAAA;AAAA,EACtE,CAAC,SAAS,mEAAmE,CAAA;AAAA,EAC7E,CAAC,UAAU,6DAA6D,CAAA;AAAA,EACxE,CAAC,SAAS,qEAAqE,CAAA;AAAA,EAC/E,CAAC,UAAU,6DAA6D,CAAA;AAAA,EACxE,CAAC,UAAU,uEAAuE,CAAA;AAAA,EAClF,CAAC,WAAW,8DAA8D,CAAA;AAAA,EAC1E,CAAC,SAAS,sEAAsE,CAAA;AAAA,EAChF,CAAC,UAAU,6DAA6D;AAC1E,CAAC,CAAA;AAYD,SAAS,sBAAsB,QAAA,EAA2B;AACxD,EAAA,OAAO,iBAAA,CAAkB,KAAK,QAAQ,CAAA;AACxC;AAaA,IAAM,oCAAA,uBAA2C,GAAA,CAAI;AAAA,EACnD,GAAA;AAAA,EAAK,GAAA;AAAA,EAAK,GAAA;AAAA,EAAK,GAAA;AAAA,EAAK,GAAA;AAAA,EAAK,GAAA;AAAA,EAAK,GAAA;AAAA,EAAK,GAAA;AAAA,EAAK,GAAA;AAAA,EAAK,GAAA;AAAA,EAAK,GAAA;AAAA,EAAK,GAAA;AAAA,EAAK;AAC9D,CAAC,CAAA;AAGD,SAAS,aAAa,QAAA,EAA2B;AAC/C,EAAA,IAAI,CAAC,qBAAA,CAAsB,QAAQ,CAAA,EAAG,OAAO,KAAA;AAC7C,EAAA,IAAI,uBAAA,CAAwB,GAAA,CAAI,QAAQ,CAAA,EAAG,OAAO,KAAA;AAClD,EAAA,IAAI,SAAS,MAAA,KAAW,CAAA,EAAG,OAAO,oCAAA,CAAqC,IAAI,QAAQ,CAAA;AACnF,EAAA,OAAO,IAAA;AACT;AAaA,IAAM,cAAA,GAAiB;AAAA,EACrB,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACrB,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACjD,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EACrB,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,KAAA;AAAA,EAAO,MAAA;AAAA,EAAQ;AAC7C,CAAA;AAWA,IAAM,mBAAA,GAAsB;AAAA,EAC1B,QAAA;AAAA,EAAU,SAAA;AAAA,EAAW,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,KAAA;AAAA,EACtC,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,SAAA;AAAA,EAAW,KAAA;AAAA,EACxC,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,UAAA;AAAA,EAAY,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,MAAA;AAAA,EAC1D,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,OAAA;AAAA,EAAS,MAAA;AAAA,EAAQ,OAAA;AAAA,EAC/D,QAAA;AAAA,EAAU,SAAA;AAAA,EAAW,MAAA;AAAA,EAAQ,SAAA;AAAA,EAAW,UAAA;AAAA,EAAY,OAAA;AAAA,EAAS,QAAA;AAAA,EAC7D,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,SAAA;AAAA,EAAW,OAAA;AAAA,EAAS,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,OAAA;AAAA,EACpE,SAAA;AAAA,EAAW,QAAA;AAAA,EAAU,MAAA;AAAA,EAAQ,MAAA;AAAA,EAAQ;AACvC,CAAA;AAeA,IAAM,aAAA,GAAgB,CAAC,SAAA,EAAW,UAAU,CAAA;AAerC,IAAM,UAAA,uBAAsC,GAAA,CAAI;AAAA,EACrD,GAAG,MAAA,CAAO,IAAA,CAAKA,4BAAU,CAAA,CAAE,OAAO,YAAY,CAAA;AAAA,EAC9C,GAAG,MAAA,CAAO,IAAA,CAAKC,gCAAc,CAAA;AAAA,EAC7B,GAAG,aAAA;AAAA,EACH,GAAG,cAAA;AAAA,EACH,GAAG;AACL,CAAC;AAMM,SAAS,YAAY,IAAA,EAAuB;AACjD,EAAA,OAAO,UAAA,CAAW,IAAI,IAAI,CAAA;AAC5B","file":"chunk-AQNHHJMJ.cjs","sourcesContent":["/**\n * The set of unit identifiers the lexer will turn into a UNIT token.\n *\n * DERIVED, not hand-listed. This used to be a hand-maintained list of about a\n * hundred spellings, which existed only because the conversion tables lived\n * inside a third-party package and could not be enumerated. Every spelling had\n * to be transcribed by hand and kept in sync, and this file's own history\n * records the consequences: the IEC binary prefixes (`GiB`, `TiB`) were absent\n * for a long time, and the note explaining the fix said it was \"purely a lexer\n * allowlist gap, not a conversion-logic one\".\n *\n * The tables are now in-repo (see `uom/generated/UnitTable.generated.ts`), so\n * the allowlist is computed from them. Roughly 975 base spellings are\n * recognized instead of about 101, which is why `1 kilojoule to Wh`,\n * `5 arcminutes to deg` and `2 fortnights in days` work at all.\n *\n * Units are case-sensitive to eliminate ambiguity (`C` is Celsius and `c` is a\n * cup, `B` is bytes and `b` is bits). Nothing here normalizes or aliases.\n */\n\nimport { UNIT_TABLE } from \"@solve-js/uom/generated/UnitTable.generated\";\nimport { EXTENDED_UNITS } from \"@solve-js/uom/ExtendedUnits\";\n\n/**\n * Spellings the conversion tables accept but the lexer must not claim, each\n * with its reason. `UnitVocabulary.spec.ts` asserts every one of these still\n * fails to lex, so nobody can quietly delete an entry.\n *\n * Only three spellings in the whole table collide with an existing language\n * keyword (`in`, `min`, `dec`), and `min` is left alone because it has always\n * been a time unit here and works. The rest of this list is about ordinary\n * English: a unit spelling that is also a common word turns prose into\n * arithmetic. `shouldEvaluateLine`'s prose gate is a backstop, not a licence\n * to claim every word in the dictionary.\n */\nconst EXCLUDED_UNIT_SPELLINGS: ReadonlyMap<string, string> = new Map([\n  [\"in\", \"the IN keyword owns this word (the conversion operator). ConvertParselet and friends special-case the IN token type directly and trust its text as a unit name, so inches still convert\"],\n  [\"dec\", \"already a converter name, as in `255 as dec`\"],\n  [\"M\", \"the millions magnitude suffix, as in `2.5M`. Nautical miles are still spelled `nmi` and `NM`\"],\n  // Claimed by a normalizer rule rather than by the keyword table, which is why\n  // scanning the locale keywords alone does not find it. Admitting `pm`\n  // (picometre) broke every clock time in the suite: `4pm` lexed as 4\n  // picometres. There is deliberately no entry for `am`: the table's SI\n  // prefixes stop at femto, so attometres do not exist and an exclusion would\n  // be dead weight. `UnitVocabularyCollisions.spec.ts` asserts that.\n  [\"pm\", \"the meridiem marker, as in `4pm`. Picometres lose, and `picometre` still works\"],\n  [\"are\", \"the English verb, against a 100-square-metre unit almost nobody writes\"],\n  [\"ares\", \"the English verb in plural, same reasoning as `are` above\"],\n  [\"turn\", \"ordinary English, against a full-rotation angle unit also spelled in gradians\"],\n  [\"turns\", \"ordinary English in plural, same reasoning as `turn` above\"],\n  [\"grade\", \"ordinary English. The angle unit is also spelled `gon` and `grad`\"],\n  [\"grades\", \"ordinary English in plural, same reasoning as `grade` above\"],\n  [\"point\", \"ordinary English. The typographic point is also reachable as `pica`\"],\n  [\"points\", \"ordinary English in plural, same reasoning as `point` above\"],\n  [\"moment\", \"ordinary English, against an obscure medieval time unit of 90 seconds\"],\n  [\"moments\", \"ordinary English in plural, same reasoning as `moment` above\"],\n  [\"shake\", \"ordinary English, against an obscure physics unit of ten nanoseconds\"],\n  [\"shakes\", \"ordinary English in plural, same reasoning as `shake` above\"],\n]);\n\n/**\n * Whether a spelling can be a single UNIT token at all.\n *\n * The lexer reads a unit as one run of `[A-Za-z0-9_]`, so the 465 spellings\n * containing a space, a slash, a prime or a non-ASCII character cannot be\n * tokenized however well the converter understands them. `square metres`,\n * `cd/m2` and `µm²` all remain reachable through the conversion API (notably\n * the cooking package's free-text target unit), just not by typing them in an\n * expression.\n */\nfunction isTokenizableSpelling(spelling: string): boolean {\n  return /^[A-Za-z0-9_]+$/.test(spelling);\n}\n\n/**\n * The single-character units that were already claimed before the vocabulary\n * was derived from the tables, and are therefore grandfathered in.\n *\n * No OTHER single character is admitted. A one-letter unit is indistinguishable\n * from the placeholder names people actually write (`x`, `y`, `n`), and the\n * table has ten more of them: `r a y c p S L N J R`. Admitting those turned\n * `x.y` into a unit expression and broke comparison-operator tests that had\n * deliberately picked letters which were not units. The upside was a handful of\n * spellings that all have an unambiguous longer form (`rad`, `year`, `cup`).\n */\nconst GRANDFATHERED_SINGLE_CHARACTER_UNITS = new Set([\n  \"m\", \"g\", \"t\", \"s\", \"h\", \"d\", \"l\", \"b\", \"B\", \"C\", \"F\", \"K\", \"W\",\n]);\n\n/** Whether a base-table spelling should become a lexer token. */\nfunction isAdmissible(spelling: string): boolean {\n  if (!isTokenizableSpelling(spelling)) return false;\n  if (EXCLUDED_UNIT_SPELLINGS.has(spelling)) return false;\n  if (spelling.length === 1) return GRANDFATHERED_SINGLE_CHARACTER_UNITS.has(spelling);\n  return true;\n}\n\n/**\n * ISO 4217 codes and the crypto tickers handled alongside them.\n *\n * Hand-maintained on purpose: these are NOT units. They route through\n * CurrencyExchangeService, and `getMeasure()` deliberately returns undefined\n * for every one of them, which is how `VM.ts` tells a currency from a unit.\n * Must stay in sync with CurrencyExchangeService's `isCurrency()`: without a\n * lexer entry a code never becomes a UNIT token, so `1 BTC to USD` used to\n * fail at tokenization with \"Undefined variable: BTC\" before ever reaching\n * the currency service that could have handled it.\n */\nconst CURRENCY_CODES = [\n  \"USD\", \"EUR\", \"GBP\", \"JPY\",\n  \"AUD\", \"CAD\", \"CHF\", \"CNY\", \"SEK\", \"NOK\", \"DKK\", \"NZD\",\n  \"KRW\", \"SGD\", \"HKD\", \"TWD\", \"INR\", \"BRL\", \"ZAR\", \"MXN\",\n  \"RUB\", \"TRY\", \"SAR\", \"AED\", \"ILS\", \"PLN\", \"CZK\", \"HUF\",\n  \"THB\", \"IDR\", \"MYR\", \"PHP\", \"CLP\", \"COP\", \"ARS\", \"NGN\",\n  \"EGP\", \"PKR\", \"BDT\", \"VND\", \"KES\", \"XOF\", \"XAF\", \"MAD\",\n  \"QAR\", \"KWD\", \"OMR\", \"BHD\", \"JOD\", \"LKR\", \"MMK\", \"UZS\",\n  \"KZT\", \"RON\", \"BGN\", \"HRK\", \"ISK\", \"UAH\", \"GEL\", \"AZN\",\n  \"BTN\", \"BND\", \"BOB\", \"BWP\", \"BYN\", \"BZD\", \"CDF\", \"CRC\",\n  \"CUP\", \"DOP\", \"DZD\", \"ERN\", \"ETB\", \"FJD\", \"FKP\", \"GMD\",\n  \"GNF\", \"GYD\", \"HNL\", \"HTG\", \"JMD\", \"KGZ\", \"KHR\", \"KMF\",\n  \"KYD\", \"LAK\", \"LBP\", \"LRD\", \"LSL\", \"LYD\", \"MDL\", \"MGA\",\n  \"MKD\", \"MNT\", \"MOP\", \"MRU\", \"MUR\", \"MVR\", \"MWK\", \"MZN\",\n  \"NAD\", \"NIO\", \"NPR\", \"PGK\", \"PYG\", \"RSD\", \"RWF\", \"SBD\",\n  \"SCR\", \"SDG\", \"SHP\", \"SLE\", \"SOS\", \"SRD\", \"SSP\", \"STN\",\n  \"SVC\", \"SYP\", \"SZL\", \"TJS\", \"TMT\", \"TND\", \"TOP\", \"TTD\",\n  \"TZS\", \"UGX\", \"UYU\", \"VEB\", \"VUV\", \"WST\", \"XCD\", \"XDR\",\n  \"XPF\", \"YER\", \"ZMW\", \"ZWL\",\n  \"BTC\", \"ETH\", \"SOL\", \"XRP\", \"ADA\", \"DOGE\", \"DOT\",\n];\n\n/**\n * Currency WORD forms, resolved to their canonical ISO code by\n * `UomLiteralParselet.ts` via `uom/CurrencyAliases.ts`.\n *\n * That table doc-comments every ambiguous choice (peso to MXN, franc to CHF,\n * krona to SEK) and explains why \"pound\"/\"pounds\" is deliberately absent: the\n * mass unit already claims it, and remapping would be exactly the kind of\n * guessing the case-sensitive, no-alias policy exists to prevent.\n */\nconst CURRENCY_WORD_FORMS = [\n  \"dollar\", \"dollars\", \"euro\", \"euros\", \"yen\",\n  \"ruble\", \"rubles\", \"rouble\", \"roubles\", \"won\",\n  \"rupee\", \"rupees\", \"yuan\", \"renminbi\", \"franc\", \"francs\", \"rand\",\n  \"krona\", \"kronor\", \"krone\", \"kroner\", \"real\", \"reais\", \"peso\", \"pesos\",\n  \"shekel\", \"shekels\", \"lira\", \"hryvnia\", \"hryvnias\", \"zloty\", \"zlotys\",\n  \"forint\", \"koruna\", \"dirham\", \"dirhams\", \"riyal\", \"riyals\", \"rial\", \"rials\",\n  \"ringgit\", \"rupiah\", \"baht\", \"dong\", \"naira\",\n];\n\n/**\n * \"workday\" and \"workdays\", a business day (Mon-Fri).\n *\n * Backs the datetime package's `<date> + N workdays` arithmetic and\n * `$X/workday` Rate literals. Not a real unit (a business day has no fixed\n * physical duration, it depends on which dates are weekends), so it has no\n * entry in the conversion tables and is shimmed at a fixed 7/5 ratio for rate\n * math only. See `uom/UomConverter.ts`.\n *\n * Safe with respect to variable names: VariableParselet accepts UNIT-typed\n * tokens as names, so `:workday = 5` keeps working, exactly as `:b = 5`\n * already did for the bits unit.\n */\nconst WORKDAY_UNITS = [\"workday\", \"workdays\"];\n\n/**\n * Set of all known unit identifiers (case-sensitive).\n *\n * Base units come from the conversion table; the extended units (speed,\n * voltage, parts-per and the other categories the base table has no measure\n * for) come from ExtendedUnits.ts; currencies and workdays are listed above.\n *\n * Note ExtendedUnits deliberately omits bare `V` (collides with the stocks\n * package's Visa ticker), bare `var` (reads as a variable name) and `fps`\n * (the Time package needs it for frames per second, so speed uses `ft_s`).\n * Those exclusions live there rather than here because they are properties of\n * that table.\n */\nexport const knownUnits: ReadonlySet<string> = new Set([\n  ...Object.keys(UNIT_TABLE).filter(isAdmissible),\n  ...Object.keys(EXTENDED_UNITS),\n  ...WORKDAY_UNITS,\n  ...CURRENCY_CODES,\n  ...CURRENCY_WORD_FORMS,\n]);\n\n/** The exclusion list, exported so the vocabulary spec can assert each entry. */\nexport const excludedUnitSpellings: ReadonlyMap<string, string> = EXCLUDED_UNIT_SPELLINGS;\n\n/** Units are case-sensitive to eliminate ambiguity (e.g. C=Celsius, c=cup). */\nexport function isKnownUnit(text: string): boolean {\n  return knownUnits.has(text);\n}\n"]}
+{"version":3,"sources":["../src/lexer/units.ts"],"names":["EXCLUDED_UNIT_SPELLINGS","isTokenizableSpelling","spelling","GRANDFATHERED_SINGLE_CHARACTER_UNITS","isAdmissible","CURRENCY_CODES","CURRENCY_WORD_FORMS","WORKDAY_UNITS","knownUnits","UNIT_TABLE","EXTENDED_UNITS","isKnownUnit","text"],"mappings":"sCAmCA,IAAMA,EAAuD,IAAI,GAAA,CAAI,CACnE,CAAC,IAAA,CAAM,yLAAyL,CAAA,CAChM,CAAC,KAAA,CAAO,8CAA8C,EACtD,CAAC,GAAA,CAAK,8FAA8F,CAAA,CAOpG,CAAC,KAAM,gFAAgF,CAAA,CACvF,CAAC,KAAA,CAAO,wEAAwE,CAAA,CAChF,CAAC,OAAQ,2DAA2D,CAAA,CACpE,CAAC,MAAA,CAAQ,+EAA+E,EACxF,CAAC,OAAA,CAAS,4DAA4D,CAAA,CACtE,CAAC,QAAS,mEAAmE,CAAA,CAC7E,CAAC,QAAA,CAAU,6DAA6D,CAAA,CACxE,CAAC,QAAS,qEAAqE,CAAA,CAC/E,CAAC,QAAA,CAAU,6DAA6D,EACxE,CAAC,QAAA,CAAU,uEAAuE,CAAA,CAClF,CAAC,SAAA,CAAW,8DAA8D,EAC1E,CAAC,OAAA,CAAS,sEAAsE,CAAA,CAChF,CAAC,QAAA,CAAU,6DAA6D,CAC1E,CAAC,CAAA,CAYD,SAASC,CAAAA,CAAsBC,CAAAA,CAA2B,CACxD,OAAO,iBAAA,CAAkB,KAAKA,CAAQ,CACxC,CAaA,IAAMC,CAAAA,CAAuC,IAAI,GAAA,CAAI,CACnD,IAAK,GAAA,CAAK,GAAA,CAAK,GAAA,CAAK,GAAA,CAAK,IAAK,GAAA,CAAK,GAAA,CAAK,IAAK,GAAA,CAAK,GAAA,CAAK,IAAK,GAC9D,CAAC,CAAA,CAGD,SAASC,EAAaF,CAAAA,CAA2B,CAE/C,OADI,CAACD,CAAAA,CAAsBC,CAAQ,CAAA,EAC/BF,CAAAA,CAAwB,GAAA,CAAIE,CAAQ,EAAU,KAAA,CAC9CA,CAAAA,CAAS,SAAW,CAAA,CAAUC,CAAAA,CAAqC,IAAID,CAAQ,CAAA,CAC5E,IACT,CAaA,IAAMG,EAAiB,CACrB,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CACrB,MAAO,KAAA,CAAO,KAAA,CAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CACjD,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CAAO,KAAA,CAAO,KAAA,CACjD,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CACjD,KAAA,CAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CACjD,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CAAO,MACjD,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CACjD,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CACjD,MAAO,KAAA,CAAO,KAAA,CAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CACjD,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CAAO,KAAA,CAAO,KAAA,CACjD,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CACjD,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CAAO,MACjD,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CAAO,KAAA,CAAO,KAAA,CAAO,MACjD,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CACjD,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CACjD,MAAO,KAAA,CAAO,KAAA,CAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CACjD,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CACjD,KAAA,CAAO,MAAO,KAAA,CAAO,KAAA,CACrB,MAAO,KAAA,CAAO,KAAA,CAAO,MAAO,KAAA,CAAO,MAAA,CAAQ,KAC7C,CAAA,CAWMC,EAAsB,CAC1B,QAAA,CAAU,UAAW,MAAA,CAAQ,OAAA,CAAS,MACtC,OAAA,CAAS,QAAA,CAAU,QAAA,CAAU,SAAA,CAAW,MACxC,OAAA,CAAS,QAAA,CAAU,OAAQ,UAAA,CAAY,OAAA,CAAS,SAAU,MAAA,CAC1D,OAAA,CAAS,QAAA,CAAU,OAAA,CAAS,SAAU,MAAA,CAAQ,OAAA,CAAS,OAAQ,OAAA,CAC/D,QAAA,CAAU,UAAW,MAAA,CAAQ,SAAA,CAAW,WAAY,OAAA,CAAS,QAAA,CAC7D,SAAU,QAAA,CAAU,QAAA,CAAU,UAAW,OAAA,CAAS,QAAA,CAAU,OAAQ,OAAA,CACpE,SAAA,CAAW,QAAA,CAAU,MAAA,CAAQ,OAAQ,OACvC,CAAA,CAeMC,EAAgB,CAAC,SAAA,CAAW,UAAU,CAAA,CAe/BC,CAAAA,CAAkC,IAAI,GAAA,CAAI,CACrD,GAAG,MAAA,CAAO,KAAKC,CAAU,CAAA,CAAE,OAAOL,CAAY,CAAA,CAC9C,GAAG,MAAA,CAAO,KAAKM,CAAc,CAAA,CAC7B,GAAGH,CAAAA,CACH,GAAGF,EACH,GAAGC,CACL,CAAC,EAMM,SAASK,EAAYC,CAAAA,CAAuB,CACjD,OAAOJ,CAAAA,CAAW,GAAA,CAAII,CAAI,CAC5B","file":"chunk-TRBXW6HW.js","sourcesContent":["/**\n * The set of unit identifiers the lexer will turn into a UNIT token.\n *\n * DERIVED, not hand-listed. This used to be a hand-maintained list of about a\n * hundred spellings, which existed only because the conversion tables lived\n * inside a third-party package and could not be enumerated. Every spelling had\n * to be transcribed by hand and kept in sync, and this file's own history\n * records the consequences: the IEC binary prefixes (`GiB`, `TiB`) were absent\n * for a long time, and the note explaining the fix said it was \"purely a lexer\n * allowlist gap, not a conversion-logic one\".\n *\n * The tables are now in-repo (see `uom/generated/UnitTable.generated.ts`), so\n * the allowlist is computed from them. Roughly 975 base spellings are\n * recognized instead of about 101, which is why `1 kilojoule to Wh`,\n * `5 arcminutes to deg` and `2 fortnights in days` work at all.\n *\n * Units are case-sensitive to eliminate ambiguity (`C` is Celsius and `c` is a\n * cup, `B` is bytes and `b` is bits). Nothing here normalizes or aliases.\n */\n\nimport { UNIT_TABLE } from \"@solve-js/uom/generated/UnitTable.generated\";\nimport { EXTENDED_UNITS } from \"@solve-js/uom/ExtendedUnits\";\n\n/**\n * Spellings the conversion tables accept but the lexer must not claim, each\n * with its reason. `UnitVocabulary.spec.ts` asserts every one of these still\n * fails to lex, so nobody can quietly delete an entry.\n *\n * Only three spellings in the whole table collide with an existing language\n * keyword (`in`, `min`, `dec`), and `min` is left alone because it has always\n * been a time unit here and works. The rest of this list is about ordinary\n * English: a unit spelling that is also a common word turns prose into\n * arithmetic. `shouldEvaluateLine`'s prose gate is a backstop, not a licence\n * to claim every word in the dictionary.\n */\nconst EXCLUDED_UNIT_SPELLINGS: ReadonlyMap<string, string> = new Map([\n  [\"in\", \"the IN keyword owns this word (the conversion operator). ConvertParselet and friends special-case the IN token type directly and trust its text as a unit name, so inches still convert\"],\n  [\"dec\", \"already a converter name, as in `255 as dec`\"],\n  [\"M\", \"the millions magnitude suffix, as in `2.5M`. Nautical miles are still spelled `nmi` and `NM`\"],\n  // Claimed by a normalizer rule rather than by the keyword table, which is why\n  // scanning the locale keywords alone does not find it. Admitting `pm`\n  // (picometre) broke every clock time in the suite: `4pm` lexed as 4\n  // picometres. There is deliberately no entry for `am`: the table's SI\n  // prefixes stop at femto, so attometres do not exist and an exclusion would\n  // be dead weight. `UnitVocabularyCollisions.spec.ts` asserts that.\n  [\"pm\", \"the meridiem marker, as in `4pm`. Picometres lose, and `picometre` still works\"],\n  [\"are\", \"the English verb, against a 100-square-metre unit almost nobody writes\"],\n  [\"ares\", \"the English verb in plural, same reasoning as `are` above\"],\n  [\"turn\", \"ordinary English, against a full-rotation angle unit also spelled in gradians\"],\n  [\"turns\", \"ordinary English in plural, same reasoning as `turn` above\"],\n  [\"grade\", \"ordinary English. The angle unit is also spelled `gon` and `grad`\"],\n  [\"grades\", \"ordinary English in plural, same reasoning as `grade` above\"],\n  [\"point\", \"ordinary English. The typographic point is also reachable as `pica`\"],\n  [\"points\", \"ordinary English in plural, same reasoning as `point` above\"],\n  [\"moment\", \"ordinary English, against an obscure medieval time unit of 90 seconds\"],\n  [\"moments\", \"ordinary English in plural, same reasoning as `moment` above\"],\n  [\"shake\", \"ordinary English, against an obscure physics unit of ten nanoseconds\"],\n  [\"shakes\", \"ordinary English in plural, same reasoning as `shake` above\"],\n]);\n\n/**\n * Whether a spelling can be a single UNIT token at all.\n *\n * The lexer reads a unit as one run of `[A-Za-z0-9_]`, so the 465 spellings\n * containing a space, a slash, a prime or a non-ASCII character cannot be\n * tokenized however well the converter understands them. `square metres`,\n * `cd/m2` and `µm²` all remain reachable through the conversion API (notably\n * the cooking package's free-text target unit), just not by typing them in an\n * expression.\n */\nfunction isTokenizableSpelling(spelling: string): boolean {\n  return /^[A-Za-z0-9_]+$/.test(spelling);\n}\n\n/**\n * The single-character units that were already claimed before the vocabulary\n * was derived from the tables, and are therefore grandfathered in.\n *\n * No OTHER single character is admitted. A one-letter unit is indistinguishable\n * from the placeholder names people actually write (`x`, `y`, `n`), and the\n * table has ten more of them: `r a y c p S L N J R`. Admitting those turned\n * `x.y` into a unit expression and broke comparison-operator tests that had\n * deliberately picked letters which were not units. The upside was a handful of\n * spellings that all have an unambiguous longer form (`rad`, `year`, `cup`).\n */\nconst GRANDFATHERED_SINGLE_CHARACTER_UNITS = new Set([\n  \"m\", \"g\", \"t\", \"s\", \"h\", \"d\", \"l\", \"b\", \"B\", \"C\", \"F\", \"K\", \"W\",\n]);\n\n/** Whether a base-table spelling should become a lexer token. */\nfunction isAdmissible(spelling: string): boolean {\n  if (!isTokenizableSpelling(spelling)) return false;\n  if (EXCLUDED_UNIT_SPELLINGS.has(spelling)) return false;\n  if (spelling.length === 1) return GRANDFATHERED_SINGLE_CHARACTER_UNITS.has(spelling);\n  return true;\n}\n\n/**\n * ISO 4217 codes and the crypto tickers handled alongside them.\n *\n * Hand-maintained on purpose: these are NOT units. They route through\n * CurrencyExchangeService, and `getMeasure()` deliberately returns undefined\n * for every one of them, which is how `VM.ts` tells a currency from a unit.\n * Must stay in sync with CurrencyExchangeService's `isCurrency()`: without a\n * lexer entry a code never becomes a UNIT token, so `1 BTC to USD` used to\n * fail at tokenization with \"Undefined variable: BTC\" before ever reaching\n * the currency service that could have handled it.\n */\nconst CURRENCY_CODES = [\n  \"USD\", \"EUR\", \"GBP\", \"JPY\",\n  \"AUD\", \"CAD\", \"CHF\", \"CNY\", \"SEK\", \"NOK\", \"DKK\", \"NZD\",\n  \"KRW\", \"SGD\", \"HKD\", \"TWD\", \"INR\", \"BRL\", \"ZAR\", \"MXN\",\n  \"RUB\", \"TRY\", \"SAR\", \"AED\", \"ILS\", \"PLN\", \"CZK\", \"HUF\",\n  \"THB\", \"IDR\", \"MYR\", \"PHP\", \"CLP\", \"COP\", \"ARS\", \"NGN\",\n  \"EGP\", \"PKR\", \"BDT\", \"VND\", \"KES\", \"XOF\", \"XAF\", \"MAD\",\n  \"QAR\", \"KWD\", \"OMR\", \"BHD\", \"JOD\", \"LKR\", \"MMK\", \"UZS\",\n  \"KZT\", \"RON\", \"BGN\", \"HRK\", \"ISK\", \"UAH\", \"GEL\", \"AZN\",\n  \"BTN\", \"BND\", \"BOB\", \"BWP\", \"BYN\", \"BZD\", \"CDF\", \"CRC\",\n  \"CUP\", \"DOP\", \"DZD\", \"ERN\", \"ETB\", \"FJD\", \"FKP\", \"GMD\",\n  \"GNF\", \"GYD\", \"HNL\", \"HTG\", \"JMD\", \"KGZ\", \"KHR\", \"KMF\",\n  \"KYD\", \"LAK\", \"LBP\", \"LRD\", \"LSL\", \"LYD\", \"MDL\", \"MGA\",\n  \"MKD\", \"MNT\", \"MOP\", \"MRU\", \"MUR\", \"MVR\", \"MWK\", \"MZN\",\n  \"NAD\", \"NIO\", \"NPR\", \"PGK\", \"PYG\", \"RSD\", \"RWF\", \"SBD\",\n  \"SCR\", \"SDG\", \"SHP\", \"SLE\", \"SOS\", \"SRD\", \"SSP\", \"STN\",\n  \"SVC\", \"SYP\", \"SZL\", \"TJS\", \"TMT\", \"TND\", \"TOP\", \"TTD\",\n  \"TZS\", \"UGX\", \"UYU\", \"VEB\", \"VUV\", \"WST\", \"XCD\", \"XDR\",\n  \"XPF\", \"YER\", \"ZMW\", \"ZWL\",\n  \"BTC\", \"ETH\", \"SOL\", \"XRP\", \"ADA\", \"DOGE\", \"DOT\",\n];\n\n/**\n * Currency WORD forms, resolved to their canonical ISO code by\n * `UomLiteralParselet.ts` via `uom/CurrencyAliases.ts`.\n *\n * That table doc-comments every ambiguous choice (peso to MXN, franc to CHF,\n * krona to SEK) and explains why \"pound\"/\"pounds\" is deliberately absent: the\n * mass unit already claims it, and remapping would be exactly the kind of\n * guessing the case-sensitive, no-alias policy exists to prevent.\n */\nconst CURRENCY_WORD_FORMS = [\n  \"dollar\", \"dollars\", \"euro\", \"euros\", \"yen\",\n  \"ruble\", \"rubles\", \"rouble\", \"roubles\", \"won\",\n  \"rupee\", \"rupees\", \"yuan\", \"renminbi\", \"franc\", \"francs\", \"rand\",\n  \"krona\", \"kronor\", \"krone\", \"kroner\", \"real\", \"reais\", \"peso\", \"pesos\",\n  \"shekel\", \"shekels\", \"lira\", \"hryvnia\", \"hryvnias\", \"zloty\", \"zlotys\",\n  \"forint\", \"koruna\", \"dirham\", \"dirhams\", \"riyal\", \"riyals\", \"rial\", \"rials\",\n  \"ringgit\", \"rupiah\", \"baht\", \"dong\", \"naira\",\n];\n\n/**\n * \"workday\" and \"workdays\", a business day (Mon-Fri).\n *\n * Backs the datetime package's `<date> + N workdays` arithmetic and\n * `$X/workday` Rate literals. Not a real unit (a business day has no fixed\n * physical duration, it depends on which dates are weekends), so it has no\n * entry in the conversion tables and is shimmed at a fixed 7/5 ratio for rate\n * math only. See `uom/UomConverter.ts`.\n *\n * Safe with respect to variable names: VariableParselet accepts UNIT-typed\n * tokens as names, so `:workday = 5` keeps working, exactly as `:b = 5`\n * already did for the bits unit.\n */\nconst WORKDAY_UNITS = [\"workday\", \"workdays\"];\n\n/**\n * Set of all known unit identifiers (case-sensitive).\n *\n * Base units come from the conversion table; the extended units (speed,\n * voltage, parts-per and the other categories the base table has no measure\n * for) come from ExtendedUnits.ts; currencies and workdays are listed above.\n *\n * Note ExtendedUnits deliberately omits bare `V` (collides with the stocks\n * package's Visa ticker), bare `var` (reads as a variable name) and `fps`\n * (the Time package needs it for frames per second, so speed uses `ft_s`).\n * Those exclusions live there rather than here because they are properties of\n * that table.\n */\nexport const knownUnits: ReadonlySet<string> = new Set([\n  ...Object.keys(UNIT_TABLE).filter(isAdmissible),\n  ...Object.keys(EXTENDED_UNITS),\n  ...WORKDAY_UNITS,\n  ...CURRENCY_CODES,\n  ...CURRENCY_WORD_FORMS,\n]);\n\n/** The exclusion list, exported so the vocabulary spec can assert each entry. */\nexport const excludedUnitSpellings: ReadonlyMap<string, string> = EXCLUDED_UNIT_SPELLINGS;\n\n/** Units are case-sensitive to eliminate ambiguity (e.g. C=Celsius, c=cup). */\nexport function isKnownUnit(text: string): boolean {\n  return knownUnits.has(text);\n}\n"]}

package/dist/chunk-TTFO4YDP.cjs

@@ -0,0 +1,2 @@
+'use strict';var r=typeof process<"u"&&process.env.DEBUG_ABORTCTRL==="true",t={get enabled(){return r},keystrokeCreated(){r&&console.debug("[AbortCtrl] KEYSTROKE CREATED");},keystrokeAborted(e){r&&console.debug(`[AbortCtrl] KEYSTROKE ABORTED: ${e}`);},localControllerCreated(e){r&&console.debug(`[AbortCtrl] LOCAL CREATED (${e})`);},signalLinked(e){r&&console.debug(`[AbortCtrl] LOCAL LINKED (${e}) \u2192 keystroke`);},signalUnlinked(e){r&&console.debug(`[AbortCtrl] LOCAL UNLINKED (${e})`);},keystrokeSignalSet(e){r&&console.debug(`[AbortCtrl] KEYSTROKE_SIGNAL \u2192 engine (aborted=${e})`);},keystrokeSignalCleared(){r&&console.debug("[AbortCtrl] KEYSTROKE_SIGNAL cleared (null)");},staleDataDiscarded(e,o){r&&console.debug(`[AbortCtrl] STALE DISCARD: ${e} (${o})`);}};exports.a=t;//# sourceMappingURL=chunk-TTFO4YDP.cjs.map
+//# sourceMappingURL=chunk-TTFO4YDP.cjs.map

package/dist/chunk-TTFO4YDP.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/utilities/AbortControllerLogger.ts"],"names":["isDebugEnabled","abortLogger","reason","source","isAborted","queryKey","context"],"mappings":"aA4BA,IAAMA,CAAAA,CAAiB,OAAO,OAAA,CAAY,GAAA,EAAe,QAAQ,GAAA,CAAI,eAAA,GAAoB,MAAA,CAQ5EC,CAAAA,CAAc,CAE1B,IAAI,SAAmB,CACtB,OAAOD,CACR,CAAA,CAQA,gBAAA,EAAyB,CACnBA,CAAAA,EACL,OAAA,CAAQ,KAAA,CAAM,+BAA+B,EAC9C,CAAA,CAOA,iBAAiBE,CAAAA,CAAsB,CACjCF,GACL,OAAA,CAAQ,KAAA,CAAM,kCAAkCE,CAAM,CAAA,CAAE,EACzD,CAAA,CAUA,sBAAA,CAAuBC,CAAAA,CAAsB,CACvCH,CAAAA,EACL,OAAA,CAAQ,MAAM,CAAA,2BAAA,EAA8BG,CAAM,GAAG,EACtD,CAAA,CAQA,YAAA,CAAaA,CAAAA,CAAsB,CAC7BH,CAAAA,EACL,QAAQ,KAAA,CAAM,CAAA,0BAAA,EAA6BG,CAAM,CAAA,kBAAA,CAAe,EACjE,EAOA,cAAA,CAAeA,CAAAA,CAAsB,CAC/BH,CAAAA,EACL,OAAA,CAAQ,KAAA,CAAM,+BAA+BG,CAAM,CAAA,CAAA,CAAG,EACvD,CAAA,CAQA,kBAAA,CAAmBC,EAA0B,CACvCJ,CAAAA,EACL,OAAA,CAAQ,KAAA,CACP,CAAA,oDAAA,EAAkDI,CAAS,GAC5D,EACD,CAAA,CAMA,wBAA+B,CACzBJ,CAAAA,EACL,QAAQ,KAAA,CAAM,6CAA6C,EAC5D,CAAA,CAUA,kBAAA,CAAmBK,CAAAA,CAAkBC,EAAuB,CACtDN,CAAAA,EACL,QAAQ,KAAA,CACP,CAAA,2BAAA,EAA8BK,CAAQ,CAAA,EAAA,EAAKC,CAAO,CAAA,CAAA,CACnD,EACD,CACD","file":"chunk-TTFO4YDP.cjs","sourcesContent":["/**\n * Debug logging for the AbortController lifecycle in the \"One AbortController\n * Per Keystroke\" pattern.\n *\n * Enabled when `process.env.DEBUG_ABORTCTRL === \"true\"`.\n *\n * This is **opt-in only**, even in development mode you must explicitly\n * set the flag to avoid log noise from large documents.\n *\n * Logs controller creation, abortion, signal linking, keystroke signal\n * propagation, and stale-data discard guards.  All messages are output via\n * `console.debug` with an `[AbortCtrl]` prefix so they can be filtered\n * in the DevTools console.\n *\n * ── Usage ─────────────────────────────────────────────────────────────\n * import { abortLogger } from \"@solve-js/utilities/AbortControllerLogger\";\n *\n * // Enable explicitly (before the plugin boots):\n * //   process.env.DEBUG_ABORTCTRL = \"true\";\n *\n * abortLogger.keystrokeCreated();\n * abortLogger.localControllerCreated(\"executeAndStore\");\n * abortLogger.signalLinked(\"executeAndStore\", \"keystroke\");\n * abortLogger.keystrokeAborted(\"New keystroke\");\n * abortLogger.staleDataDiscarded(\"USD:GBP\", \"signal aborted\");\n * abortLogger.keystrokeSignalSet(true);  // signal set, not aborted\n * abortLogger.keystrokeSignalCleared();\n */\nconst isDebugEnabled = typeof process !== \"undefined\" && process.env.DEBUG_ABORTCTRL === \"true\";\n\n/**\n * Records abort-signal lifecycle for debugging cancellation.\n *\n * Keystroke cancellation is hard to reason about after the fact, because the\n * evidence is gone by the time anything looks wrong. This keeps it.\n */\nexport const abortLogger = {\n\t/** Whether debug logging is currently active. */\n\tget enabled(): boolean {\n\t\treturn isDebugEnabled;\n\t},\n\n\t// ── Keystroke-level controller (MarkdownEditorViewPlugin) ──────\n\n\t/**\n\t * Log creation of the keystroke-level AbortController.\n\t * Called in the plugin constructor and on each new keystroke.\n\t */\n\tkeystrokeCreated(): void {\n\t\tif (!isDebugEnabled) return;\n\t\tconsole.debug(\"[AbortCtrl] KEYSTROKE CREATED\");\n\t},\n\n\t/**\n\t * Log abortion of the keystroke-level AbortController.\n\t * @param reason Why the keystroke was aborted (e.g. \"New keystroke\",\n\t *   \"Document switch\", \"Plugin destroyed\").\n\t */\n\tkeystrokeAborted(reason: string): void {\n\t\tif (!isDebugEnabled) return;\n\t\tconsole.debug(`[AbortCtrl] KEYSTROKE ABORTED: ${reason}`);\n\t},\n\n\t// ── Local per-evaluation controllers (ExpressionEngine) ─────────\n\n\t/**\n\t * Log creation of a local AbortController that is linked to the\n\t * keystroke signal.\n\t * @param source Which code path created the controller\n\t *   (e.g. \"executeAndStore\", \"executeRaw\", \"preflight\", \"vm\").\n\t */\n\tlocalControllerCreated(source: string): void {\n\t\tif (!isDebugEnabled) return;\n\t\tconsole.debug(`[AbortCtrl] LOCAL CREATED (${source})`);\n\t},\n\n\t/**\n\t * Log that a local AbortController was linked to the keystroke signal.\n\t * When the keystroke signal is aborted, this local controller will\n\t * be aborted automatically.\n\t * @param source The code path that created the controller.\n\t */\n\tsignalLinked(source: string): void {\n\t\tif (!isDebugEnabled) return;\n\t\tconsole.debug(`[AbortCtrl] LOCAL LINKED (${source}) → keystroke`);\n\t},\n\n\t/**\n\t * Log that a local AbortController's listener was removed from the\n\t * keystroke signal (cleanup).\n\t * @param source The code path.\n\t */\n\tsignalUnlinked(source: string): void {\n\t\tif (!isDebugEnabled) return;\n\t\tconsole.debug(`[AbortCtrl] LOCAL UNLINKED (${source})`);\n\t},\n\n\t// ── Keystroke signal propagation (ThreeTierEvaluator → ExpressionEngine) ──\n\n\t/**\n\t * Log that the keystroke signal was propagated INTO the engine.\n\t * @param isAborted Whether the signal was already aborted when set.\n\t */\n\tkeystrokeSignalSet(isAborted: boolean): void {\n\t\tif (!isDebugEnabled) return;\n\t\tconsole.debug(\n\t\t\t`[AbortCtrl] KEYSTROKE_SIGNAL → engine (aborted=${isAborted})`,\n\t\t);\n\t},\n\n\t/**\n\t * Log that the keystroke signal was CLEARED from the engine\n\t * (typically in the evaluator's finally block).\n\t */\n\tkeystrokeSignalCleared(): void {\n\t\tif (!isDebugEnabled) return;\n\t\tconsole.debug(\"[AbortCtrl] KEYSTROKE_SIGNAL cleared (null)\");\n\t},\n\n\t// ── Stale-data discard guards (resolveAsync) ────────────────────\n\n\t/**\n\t * Log that a stale async result was discarded because its signal\n\t * was aborted.\n\t * @param queryKey The cache key for the discarded result.\n\t * @param context Additional context (e.g. \"after await\", \"after error\").\n\t */\n\tstaleDataDiscarded(queryKey: string, context: string): void {\n\t\tif (!isDebugEnabled) return;\n\t\tconsole.debug(\n\t\t\t`[AbortCtrl] STALE DISCARD: ${queryKey} (${context})`,\n\t\t);\n\t},\n};\n"]}

package/dist/chunk-TWC7K3ZX.js

@@ -0,0 +1,2 @@
+var a=class{constructor(){this.collectors=[];}register(t){this.collectors.push(t);}unregister(t){let e=this.collectors.indexOf(t);e!==-1&&this.collectors.splice(e,1);}clear(){this.collectors=[];}get hasCollectors(){return this.collectors.length>0}get collectorCount(){return this.collectors.length}firePipelineStart(t){if(this.collectors.length!==0)for(let e of this.collectors)e.onPipelineStart?.(t);}fireTokenEmitted(t){if(this.collectors.length!==0)for(let e of this.collectors)e.onTokenEmitted?.(t);}fireNormalizerStart(t){if(this.collectors.length!==0)for(let e of this.collectors)e.onNormalizerStart?.(t);}fireTokenFused(t){if(this.collectors.length!==0)for(let e of this.collectors)e.onTokenFused?.(t);}fireNormalizerEnd(t){if(this.collectors.length!==0)for(let e of this.collectors)e.onNormalizerEnd?.(t);}fireParseletMatched(t){if(this.collectors.length!==0)for(let e of this.collectors)e.onParseletMatched?.(t);}fireBytecodeBuilt(t){if(this.collectors.length!==0)for(let e of this.collectors)e.onBytecodeBuilt?.(t);}fireVmStep(t){if(this.collectors.length!==0)for(let e of this.collectors)e.onVmStep?.(t);}fireVmHalt(t){if(this.collectors.length!==0)for(let e of this.collectors)e.onVmHalt?.(t);}fireCacheHit(t){if(this.collectors.length!==0)for(let e of this.collectors)e.onCacheHit?.(t);}fireCacheMiss(t){if(this.collectors.length!==0)for(let e of this.collectors)e.onCacheMiss?.(t);}firePipelineEnd(t){if(this.collectors.length!==0)for(let e of this.collectors)e.onPipelineEnd?.(t);}collectReports(){let t=[];for(let e of this.collectors){let n=e.getReport();n&&t.push(n);}return t}reset(){for(let t of this.collectors)t.reset();}};var s=class{onPipelineStart(t){}onTokenEmitted(t){}onNormalizerStart(t){}onTokenFused(t){}onNormalizerEnd(t){}onParseletMatched(t){}onBytecodeBuilt(t){}onVmStep(t){}onVmHalt(t){}onCacheHit(t){}onCacheMiss(t){}onPipelineEnd(t){}};var i=class extends s{constructor(){super(...arguments);this.events=[];this.startNs=0;this.parseletEntries=new Map;this.totalTokens=0;this.cacheHitSeen=false;this.vmStepSeen=false;this.hasBytecodeBuilt=false;this.firstBytecodeOpcodesLength=0;this.parseletMatches=[];this.lastExpression="";this.lastInputType="";}get parseletMatchCount(){return this.parseletMatches.length}reset(){this.events=[],this.parseletEntries.clear(),this.startNs=0,this.totalTokens=0,this.cacheHitSeen=false,this.vmStepSeen=false,this.hasBytecodeBuilt=false,this.firstBytecodeOpcodesLength=0,this.parseletMatches=[],this.lastExpression="",this.lastInputType="";}stamp(e){let n=this.startNs!==0?performance.now()*1e6-this.startNs:0;return {...e,elapsedNs:n}}onPipelineStart(e){this.startNs===0&&(this.startNs=performance.now()*1e6),this.lastExpression=e.expression,this.lastInputType=e.inputType,this.events.push(this.stamp(e));}onTokenEmitted(e){this.events.push(this.stamp(e)),this.totalTokens++;}onNormalizerStart(e){this.events.push(this.stamp(e));}onTokenFused(e){this.events.push(this.stamp(e));}onNormalizerEnd(e){this.events.push(this.stamp(e));}onParseletMatched(e){this.events.push(this.stamp(e));let n=this.parseletEntries.get(e.parseletCategory);n?n.count++:this.parseletEntries.set(e.parseletCategory,{category:e.parseletCategory,count:1}),this.parseletMatches.push({tokenType:e.tokenType,tokenValue:e.tokenValue,parseletCategory:e.parseletCategory,parseletType:e.parseletType,isPrefix:e.isPrefix,bindingPower:e.bindingPower,tokenOffset:e.tokenOffset});}onBytecodeBuilt(e){this.events.push(this.stamp(e)),this.hasBytecodeBuilt||(this.hasBytecodeBuilt=true,this.firstBytecodeOpcodesLength=e.opcodesLength);}onVmStep(e){this.events.push(this.stamp(e)),this.vmStepSeen=true;}onVmHalt(e){this.events.push(this.stamp(e));}onCacheHit(e){this.events.push(this.stamp(e)),this.cacheHitSeen=true;}onCacheMiss(e){this.events.push(this.stamp(e));}onPipelineEnd(e){this.events.push(this.stamp(e));}getReport(){if(this.events.length===0)return;let e=performance.now()*1e6-this.startNs,n=new Map;for(let[,r]of this.parseletEntries)n.set(r.category,r.count);let c=this.firstBytecodeOpcodesLength,p=this.cacheHitSeen,d=this.totalTokens,o={events:this.events,parselets:this.parseletMatches.map(r=>({...r})),summary:{totalTokens:d,totalParselets:n.size,totalOpcodes:c,cacheHit:p,elapsedNs:e,parseCategories:n},metadata:{expression:this.lastExpression,inputType:this.lastInputType,timestamp:Date.now(),vmTraceEnabled:this.vmStepSeen},toJSON(){return {events:o.events,parselets:o.parselets,summary:{totalTokens:o.summary.totalTokens,totalParselets:o.summary.totalParselets,totalOpcodes:o.summary.totalOpcodes,cacheHit:o.summary.cacheHit,elapsedNs:o.summary.elapsedNs,parseCategories:Object.fromEntries(o.summary.parseCategories)},metadata:{...o.metadata}}}};return o}};var y={TokenEmitted:"token_emitted",NormalizerStart:"normalizer_start",TokenFused:"token_fused",NormalizerEnd:"normalizer_end",ParseletMatched:"parselet_matched",BytecodeBuilt:"bytecode_built",VmStep:"vm_step",VmHalt:"vm_halt",CacheHit:"cache_hit",CacheMiss:"cache_miss",PipelineStart:"pipeline_start",PipelineEnd:"pipeline_end"};export{a,i as b,y as c};//# sourceMappingURL=chunk-TWC7K3ZX.js.map
+//# sourceMappingURL=chunk-TWC7K3ZX.js.map

package/dist/chunk-TWC7K3ZX.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/diagnostics/pipeline.ts","../src/diagnostics/collector.ts","../src/diagnostics/timeline-collector.ts","../src/diagnostics/events.ts"],"names":["DiagnosticPipeline","collector","idx","event","c","reports","report","DiagnosticCollector","_event","TimelineDiagnosticCollector","elapsedNs","entry","parseCategories","totalOpcodes","cacheHit","totalTokens","e","DiagnosticEventType"],"mappings":"AAYO,IAAMA,CAAAA,CAAN,KAAyB,CAAzB,WAAA,EAAA,CACL,KAAQ,UAAA,CAAoC,GAAC,CAE7C,QAAA,CAASC,CAAAA,CAAsC,CAC7C,KAAK,UAAA,CAAW,IAAA,CAAKA,CAAS,EAChC,CAEA,UAAA,CAAWA,EAAsC,CAC/C,IAAMC,CAAAA,CAAM,IAAA,CAAK,UAAA,CAAW,OAAA,CAAQD,CAAS,CAAA,CACzCC,CAAAA,GAAQ,IAAI,IAAA,CAAK,UAAA,CAAW,OAAOA,CAAAA,CAAK,CAAC,EAC/C,CAEA,KAAA,EAAc,CACZ,KAAK,UAAA,CAAa,GACpB,CAEA,IAAI,aAAA,EAAyB,CAC3B,OAAO,IAAA,CAAK,UAAA,CAAW,MAAA,CAAS,CAClC,CAEA,IAAI,cAAA,EAAyB,CAC3B,OAAO,IAAA,CAAK,UAAA,CAAW,MACzB,CAKA,iBAAA,CAAkBC,CAAAA,CAA2D,CAC3E,GAAI,IAAA,CAAK,WAAW,MAAA,GAAW,CAAA,CAC/B,IAAA,IAAWC,CAAAA,IAAK,IAAA,CAAK,UAAA,CAAYA,EAAE,eAAA,GAAkBD,CAAK,EAC5D,CAEA,gBAAA,CAAiBA,CAAAA,CAA0D,CACzE,GAAI,IAAA,CAAK,WAAW,MAAA,GAAW,CAAA,CAC/B,QAAWC,CAAAA,IAAK,IAAA,CAAK,UAAA,CAAYA,CAAAA,CAAE,cAAA,GAAiBD,CAAK,EAC3D,CAEA,mBAAA,CAAoBA,CAAAA,CAA6D,CAC/E,GAAI,IAAA,CAAK,WAAW,MAAA,GAAW,CAAA,CAC/B,IAAA,IAAWC,CAAAA,IAAK,IAAA,CAAK,UAAA,CAAYA,EAAE,iBAAA,GAAoBD,CAAK,EAC9D,CAEA,cAAA,CAAeA,EAAwD,CACrE,GAAI,IAAA,CAAK,UAAA,CAAW,MAAA,GAAW,CAAA,CAC/B,QAAWC,CAAAA,IAAK,IAAA,CAAK,UAAA,CAAYA,CAAAA,CAAE,YAAA,GAAeD,CAAK,EACzD,CAEA,iBAAA,CAAkBA,CAAAA,CAA2D,CAC3E,GAAI,IAAA,CAAK,WAAW,MAAA,GAAW,CAAA,CAC/B,QAAWC,CAAAA,IAAK,IAAA,CAAK,WAAYA,CAAAA,CAAE,eAAA,GAAkBD,CAAK,EAC5D,CAEA,mBAAA,CAAoBA,EAA6D,CAC/E,GAAI,IAAA,CAAK,UAAA,CAAW,MAAA,GAAW,CAAA,CAC/B,QAAWC,CAAAA,IAAK,IAAA,CAAK,UAAA,CAAYA,CAAAA,CAAE,iBAAA,GAAoBD,CAAK,EAC9D,CAEA,iBAAA,CAAkBA,EAA2D,CAC3E,GAAI,KAAK,UAAA,CAAW,MAAA,GAAW,CAAA,CAC/B,IAAA,IAAWC,CAAAA,IAAK,IAAA,CAAK,WAAYA,CAAAA,CAAE,eAAA,GAAkBD,CAAK,EAC5D,CAEA,UAAA,CAAWA,EAAoD,CAC7D,GAAI,IAAA,CAAK,UAAA,CAAW,MAAA,GAAW,CAAA,CAC/B,QAAWC,CAAAA,IAAK,IAAA,CAAK,WAAYA,CAAAA,CAAE,QAAA,GAAWD,CAAK,EACrD,CAEA,UAAA,CAAWA,CAAAA,CAAoD,CAC7D,GAAI,KAAK,UAAA,CAAW,MAAA,GAAW,CAAA,CAC/B,IAAA,IAAWC,CAAAA,IAAK,IAAA,CAAK,WAAYA,CAAAA,CAAE,QAAA,GAAWD,CAAK,EACrD,CAEA,YAAA,CAAaA,EAAsD,CACjE,GAAI,KAAK,UAAA,CAAW,MAAA,GAAW,EAC/B,IAAA,IAAWC,CAAAA,IAAK,IAAA,CAAK,UAAA,CAAYA,CAAAA,CAAE,UAAA,GAAaD,CAAK,EACvD,CAEA,aAAA,CAAcA,CAAAA,CAAuD,CACnE,GAAI,KAAK,UAAA,CAAW,MAAA,GAAW,CAAA,CAC/B,IAAA,IAAWC,CAAAA,IAAK,IAAA,CAAK,WAAYA,CAAAA,CAAE,WAAA,GAAcD,CAAK,EACxD,CAEA,gBAAgBA,CAAAA,CAAyD,CACvE,GAAI,IAAA,CAAK,UAAA,CAAW,MAAA,GAAW,EAC/B,IAAA,IAAWC,CAAAA,IAAK,IAAA,CAAK,UAAA,CAAYA,CAAAA,CAAE,aAAA,GAAgBD,CAAK,EAC1D,CAEA,cAAA,EAAqC,CACnC,IAAME,CAAAA,CAA8B,EAAC,CACrC,IAAA,IAAWD,KAAK,IAAA,CAAK,UAAA,CAAY,CAC/B,IAAME,CAAAA,CAASF,CAAAA,CAAE,SAAA,EAAU,CACvBE,CAAAA,EAAQD,EAAQ,IAAA,CAAKC,CAAM,EACjC,CACA,OAAOD,CACT,CAEA,KAAA,EAAc,CACZ,IAAA,IAAWD,CAAAA,IAAK,IAAA,CAAK,UAAA,CAAYA,EAAE,KAAA,GACrC,CACF,ECjGO,IAAeG,EAAf,KAAmC,CACxC,eAAA,CAAgBC,CAAAA,CAA4D,CAAC,CAC7E,eAAeA,CAAAA,CAA2D,CAAC,CAC3E,iBAAA,CAAkBA,CAAAA,CAA8D,CAAC,CACjF,YAAA,CAAaA,CAAAA,CAAyD,CAAC,CACvE,eAAA,CAAgBA,CAAAA,CAA4D,CAAC,CAC7E,iBAAA,CAAkBA,EAA8D,CAAC,CACjF,gBAAgBA,CAAAA,CAA4D,CAAC,CAC7E,QAAA,CAASA,CAAAA,CAAqD,CAAC,CAC/D,QAAA,CAASA,CAAAA,CAAqD,CAAC,CAC/D,UAAA,CAAWA,CAAAA,CAAuD,CAAC,CACnE,WAAA,CAAYA,CAAAA,CAAwD,CAAC,CACrE,aAAA,CAAcA,EAA0D,CAAC,CAI3E,ECjBO,IAAMC,CAAAA,CAAN,cAA0CF,CAAoB,CAA9D,WAAA,EAAA,CAAA,KAAA,CAAA,GAAA,SAAA,CAAA,CACL,IAAA,CAAQ,MAAA,CAA4B,GACpC,IAAA,CAAQ,OAAA,CAAkB,CAAA,CAC1B,IAAA,CAAQ,eAAA,CAAoE,IAAI,IAKhF,IAAA,CAAQ,WAAA,CAAc,CAAA,CACtB,IAAA,CAAQ,YAAA,CAAe,KAAA,CACvB,KAAQ,UAAA,CAAa,KAAA,CACrB,KAAQ,gBAAA,CAAmB,KAAA,CAC3B,KAAQ,0BAAA,CAA6B,CAAA,CACrC,IAAA,CAAQ,eAAA,CAAyC,EAAC,CAClD,KAAQ,cAAA,CAAiB,EAAA,CACzB,IAAA,CAAQ,aAAA,CAAgB,GAAA,CAWxB,IAAI,oBAA6B,CAC/B,OAAO,IAAA,CAAK,eAAA,CAAgB,MAC9B,CAEA,OAAc,CACZ,IAAA,CAAK,MAAA,CAAS,EAAC,CACf,IAAA,CAAK,gBAAgB,KAAA,EAAM,CAC3B,IAAA,CAAK,OAAA,CAAU,CAAA,CACf,IAAA,CAAK,YAAc,CAAA,CACnB,IAAA,CAAK,YAAA,CAAe,KAAA,CACpB,IAAA,CAAK,UAAA,CAAa,MAClB,IAAA,CAAK,gBAAA,CAAmB,KAAA,CACxB,IAAA,CAAK,0BAAA,CAA6B,CAAA,CAClC,KAAK,eAAA,CAAkB,GACvB,IAAA,CAAK,cAAA,CAAiB,GACtB,IAAA,CAAK,aAAA,CAAgB,GACvB,CAGQ,KAAA,CAAiCJ,CAAAA,CAAa,CACpD,IAAMO,CAAAA,CAAY,IAAA,CAAK,OAAA,GAAY,CAAA,CAC/B,WAAA,CAAY,KAAI,CAAI,GAAA,CAAM,IAAA,CAAK,OAAA,CAC/B,CAAA,CACJ,OAAO,CAAE,GAAGP,CAAAA,CAAO,UAAAO,CAAU,CAC/B,CAEA,eAAA,CAAgBP,CAAAA,CAA2D,CAWrE,IAAA,CAAK,OAAA,GAAY,CAAA,GACnB,KAAK,OAAA,CAAU,WAAA,CAAY,GAAA,EAAI,CAAI,GAAA,CAAA,CASrC,IAAA,CAAK,eAAiBA,CAAAA,CAAM,UAAA,CAC5B,IAAA,CAAK,aAAA,CAAgBA,CAAAA,CAAM,SAAA,CAC3B,KAAK,MAAA,CAAO,IAAA,CAAK,KAAK,KAAA,CAAMA,CAAK,CAAC,EACpC,CAEA,cAAA,CAAeA,CAAAA,CAA0D,CACvE,IAAA,CAAK,OAAO,IAAA,CAAK,IAAA,CAAK,KAAA,CAAMA,CAAK,CAAC,CAAA,CAClC,KAAK,WAAA,GACP,CAEA,iBAAA,CAAkBA,CAAAA,CAA6D,CAC7E,IAAA,CAAK,OAAO,IAAA,CAAK,IAAA,CAAK,MAAMA,CAAK,CAAC,EACpC,CAEA,YAAA,CAAaA,CAAAA,CAAwD,CACnE,IAAA,CAAK,MAAA,CAAO,KAAK,IAAA,CAAK,KAAA,CAAMA,CAAK,CAAC,EACpC,CAEA,gBAAgBA,CAAAA,CAA2D,CACzE,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,MAAMA,CAAK,CAAC,EACpC,CAEA,iBAAA,CAAkBA,EAA6D,CAC7E,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,KAAA,CAAMA,CAAK,CAAC,CAAA,CAElC,IAAMQ,CAAAA,CAAQ,IAAA,CAAK,eAAA,CAAgB,IAAIR,CAAAA,CAAM,gBAAgB,CAAA,CACzDQ,CAAAA,CACFA,CAAAA,CAAM,KAAA,EAAA,CAEN,KAAK,eAAA,CAAgB,GAAA,CAAIR,EAAM,gBAAA,CAAkB,CAC/C,SAAUA,CAAAA,CAAM,gBAAA,CAChB,KAAA,CAAO,CACT,CAAC,CAAA,CAGH,KAAK,eAAA,CAAgB,IAAA,CAAK,CACxB,SAAA,CAAWA,CAAAA,CAAM,SAAA,CACjB,WAAYA,CAAAA,CAAM,UAAA,CAClB,gBAAA,CAAkBA,CAAAA,CAAM,gBAAA,CACxB,YAAA,CAAcA,EAAM,YAAA,CACpB,QAAA,CAAUA,EAAM,QAAA,CAChB,YAAA,CAAcA,EAAM,YAAA,CACpB,WAAA,CAAaA,CAAAA,CAAM,WACrB,CAAC,EACH,CAEA,eAAA,CAAgBA,CAAAA,CAA2D,CACzE,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,KAAK,KAAA,CAAMA,CAAK,CAAC,CAAA,CAI7B,IAAA,CAAK,gBAAA,GACR,KAAK,gBAAA,CAAmB,IAAA,CACxB,IAAA,CAAK,0BAAA,CAA6BA,CAAAA,CAAM,aAAA,EAE5C,CAEA,QAAA,CAASA,CAAAA,CAAoD,CAC3D,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,KAAK,KAAA,CAAMA,CAAK,CAAC,CAAA,CAClC,IAAA,CAAK,UAAA,CAAa,KACpB,CAEA,QAAA,CAASA,CAAAA,CAAoD,CAC3D,IAAA,CAAK,MAAA,CAAO,KAAK,IAAA,CAAK,KAAA,CAAMA,CAAK,CAAC,EACpC,CAEA,UAAA,CAAWA,CAAAA,CAAsD,CAC/D,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,KAAK,KAAA,CAAMA,CAAK,CAAC,CAAA,CAClC,IAAA,CAAK,YAAA,CAAe,KACtB,CAEA,WAAA,CAAYA,CAAAA,CAAuD,CACjE,IAAA,CAAK,MAAA,CAAO,KAAK,IAAA,CAAK,KAAA,CAAMA,CAAK,CAAC,EACpC,CAEA,aAAA,CAAcA,CAAAA,CAAyD,CACrE,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,KAAK,KAAA,CAAMA,CAAK,CAAC,EACpC,CAqBF,SAAA,EAA0C,CACrC,GAAI,IAAA,CAAK,MAAA,CAAO,MAAA,GAAW,CAAA,CAAG,OAE9B,IAAMO,CAAAA,CAAY,WAAA,CAAY,KAAI,CAAI,GAAA,CAAM,KAAK,OAAA,CAE3CE,CAAAA,CAAkB,IAAI,GAAA,CAC5B,IAAA,GAAW,EAAGD,CAAK,CAAA,GAAK,IAAA,CAAK,eAAA,CAC3BC,CAAAA,CAAgB,GAAA,CAAID,EAAM,QAAA,CAAUA,CAAAA,CAAM,KAAK,CAAA,CAGjD,IAAME,CAAAA,CAAe,KAAK,0BAAA,CACpBC,CAAAA,CAAW,KAAK,YAAA,CAChBC,CAAAA,CAAc,KAAK,WAAA,CAEnBT,CAAAA,CAA2B,CAC/B,MAAA,CAAQ,IAAA,CAAK,MAAA,CACb,UAAW,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAKU,CAAAA,GAAO,CAAE,GAAGA,CAAE,CAAA,CAAE,CAAA,CACrD,OAAA,CAAS,CACP,WAAA,CAAAD,CAAAA,CACA,eAAgBH,CAAAA,CAAgB,IAAA,CAChC,aAAAC,CAAAA,CACA,QAAA,CAAAC,EACA,SAAA,CAAAJ,CAAAA,CACA,eAAA,CAAAE,CACF,CAAA,CACA,QAAA,CAAU,CACR,UAAA,CAAY,IAAA,CAAK,cAAA,CACjB,SAAA,CAAW,IAAA,CAAK,aAAA,CAChB,UAAW,IAAA,CAAK,GAAA,EAAI,CACpB,cAAA,CAAgB,IAAA,CAAK,UACvB,EACA,MAAA,EAA+B,CAC7B,OAAO,CACL,MAAA,CAAQN,EAAO,MAAA,CACf,SAAA,CAAWA,CAAAA,CAAO,SAAA,CAClB,OAAA,CAAS,CACP,YAAaA,CAAAA,CAAO,OAAA,CAAQ,WAAA,CAC5B,cAAA,CAAgBA,CAAAA,CAAO,OAAA,CAAQ,eAC/B,YAAA,CAAcA,CAAAA,CAAO,OAAA,CAAQ,YAAA,CAC7B,QAAA,CAAUA,CAAAA,CAAO,QAAQ,QAAA,CACzB,SAAA,CAAWA,EAAO,OAAA,CAAQ,SAAA,CAC1B,gBAAiB,MAAA,CAAO,WAAA,CAAYA,CAAAA,CAAO,OAAA,CAAQ,eAAe,CACpE,EACA,QAAA,CAAU,CAAE,GAAGA,CAAAA,CAAO,QAAS,CACjC,CACF,CACF,CAAA,CAEA,OAAOA,CACT,CACH,MClOaW,CAAAA,CAAsB,CACjC,YAAA,CAAc,eAAA,CACd,eAAA,CAAiB,kBAAA,CACjB,WAAY,aAAA,CACZ,aAAA,CAAe,gBAAA,CACf,eAAA,CAAiB,kBAAA,CACjB,aAAA,CAAe,iBACf,MAAA,CAAQ,SAAA,CACR,MAAA,CAAQ,SAAA,CACR,QAAA,CAAU,WAAA,CACV,UAAW,YAAA,CACX,aAAA,CAAe,gBAAA,CACf,WAAA,CAAa,cACf","file":"chunk-TWC7K3ZX.js","sourcesContent":["import { DiagnosticCollector } from \"./collector\";\nimport { DiagnosticEvent } from \"./events\";\nimport { DiagnosticReport } from \"./events\";\n\n/**\n * Dispatches diagnostic events to all registered collectors.\n *\n * Performance guarantee: when no collectors are registered (production mode),\n * every dispatch method is a branch on `this.collectors.length === 0` which\n * modern JS engines will predict and eliminate. The overhead is a single\n * comparison per call, effectively zero.\n */\nexport class DiagnosticPipeline {\n  private collectors: DiagnosticCollector[] = [];\n\n  register(collector: DiagnosticCollector): void {\n    this.collectors.push(collector);\n  }\n\n  unregister(collector: DiagnosticCollector): void {\n    const idx = this.collectors.indexOf(collector);\n    if (idx !== -1) this.collectors.splice(idx, 1);\n  }\n\n  clear(): void {\n    this.collectors = [];\n  }\n\n  get hasCollectors(): boolean {\n    return this.collectors.length > 0;\n  }\n\n  get collectorCount(): number {\n    return this.collectors.length;\n  }\n\n  // Inline-optimized dispatchers, each checks length once then loops.\n  // When collectors.length === 0, the JIT eliminates the entire method body.\n\n  firePipelineStart(event: DiagnosticEvent & { type: \"pipeline_start\" }): void {\n    if (this.collectors.length === 0) return;\n    for (const c of this.collectors) c.onPipelineStart?.(event);\n  }\n\n  fireTokenEmitted(event: DiagnosticEvent & { type: \"token_emitted\" }): void {\n    if (this.collectors.length === 0) return;\n    for (const c of this.collectors) c.onTokenEmitted?.(event);\n  }\n\n  fireNormalizerStart(event: DiagnosticEvent & { type: \"normalizer_start\" }): void {\n    if (this.collectors.length === 0) return;\n    for (const c of this.collectors) c.onNormalizerStart?.(event);\n  }\n\n  fireTokenFused(event: DiagnosticEvent & { type: \"token_fused\" }): void {\n    if (this.collectors.length === 0) return;\n    for (const c of this.collectors) c.onTokenFused?.(event);\n  }\n\n  fireNormalizerEnd(event: DiagnosticEvent & { type: \"normalizer_end\" }): void {\n    if (this.collectors.length === 0) return;\n    for (const c of this.collectors) c.onNormalizerEnd?.(event);\n  }\n\n  fireParseletMatched(event: DiagnosticEvent & { type: \"parselet_matched\" }): void {\n    if (this.collectors.length === 0) return;\n    for (const c of this.collectors) c.onParseletMatched?.(event);\n  }\n\n  fireBytecodeBuilt(event: DiagnosticEvent & { type: \"bytecode_built\" }): void {\n    if (this.collectors.length === 0) return;\n    for (const c of this.collectors) c.onBytecodeBuilt?.(event);\n  }\n\n  fireVmStep(event: DiagnosticEvent & { type: \"vm_step\" }): void {\n    if (this.collectors.length === 0) return;\n    for (const c of this.collectors) c.onVmStep?.(event);\n  }\n\n  fireVmHalt(event: DiagnosticEvent & { type: \"vm_halt\" }): void {\n    if (this.collectors.length === 0) return;\n    for (const c of this.collectors) c.onVmHalt?.(event);\n  }\n\n  fireCacheHit(event: DiagnosticEvent & { type: \"cache_hit\" }): void {\n    if (this.collectors.length === 0) return;\n    for (const c of this.collectors) c.onCacheHit?.(event);\n  }\n\n  fireCacheMiss(event: DiagnosticEvent & { type: \"cache_miss\" }): void {\n    if (this.collectors.length === 0) return;\n    for (const c of this.collectors) c.onCacheMiss?.(event);\n  }\n\n  firePipelineEnd(event: DiagnosticEvent & { type: \"pipeline_end\" }): void {\n    if (this.collectors.length === 0) return;\n    for (const c of this.collectors) c.onPipelineEnd?.(event);\n  }\n\n  collectReports(): DiagnosticReport[] {\n    const reports: DiagnosticReport[] = [];\n    for (const c of this.collectors) {\n      const report = c.getReport();\n      if (report) reports.push(report);\n    }\n    return reports;\n  }\n\n  reset(): void {\n    for (const c of this.collectors) c.reset();\n  }\n}","import { DiagnosticEvent } from \"./events\";\nimport { DiagnosticReport } from \"./events\";\n\n/**\n * Interface for collecting diagnostic data during pipeline execution.\n *\n * All methods are implemented as concrete no-ops so subclasses only\n * need to override the ones they care about. This avoids optional\n * method issues with TypeScript's strict mode.\n *\n * The parameters are named `_event` because these base implementations\n * deliberately ignore them. Overrides are free to name theirs `event` and use\n * it; TypeScript does not match parameter names when checking overrides.\n */\nexport abstract class DiagnosticCollector {\n  onPipelineStart(_event: DiagnosticEvent & { type: \"pipeline_start\" }): void {}\n  onTokenEmitted(_event: DiagnosticEvent & { type: \"token_emitted\" }): void {}\n  onNormalizerStart(_event: DiagnosticEvent & { type: \"normalizer_start\" }): void {}\n  onTokenFused(_event: DiagnosticEvent & { type: \"token_fused\" }): void {}\n  onNormalizerEnd(_event: DiagnosticEvent & { type: \"normalizer_end\" }): void {}\n  onParseletMatched(_event: DiagnosticEvent & { type: \"parselet_matched\" }): void {}\n  onBytecodeBuilt(_event: DiagnosticEvent & { type: \"bytecode_built\" }): void {}\n  onVmStep(_event: DiagnosticEvent & { type: \"vm_step\" }): void {}\n  onVmHalt(_event: DiagnosticEvent & { type: \"vm_halt\" }): void {}\n  onCacheHit(_event: DiagnosticEvent & { type: \"cache_hit\" }): void {}\n  onCacheMiss(_event: DiagnosticEvent & { type: \"cache_miss\" }): void {}\n  onPipelineEnd(_event: DiagnosticEvent & { type: \"pipeline_end\" }): void {}\n\n  abstract getReport(): DiagnosticReport | undefined;\n  abstract reset(): void;\n}","import { DiagnosticCollector } from \"./collector\";\nimport { DiagnosticReport, DiagnosticReportJSON, DiagnosticEvent, CategorizedParselet } from \"./events\";\n\n/**\n * Collects all pipeline events with high-resolution timestamps.\n *\n * Overrides the zero-filled `elapsedNs` on every incoming event with a\n * real `performance.now()` delta from `onPipelineStart`. This enables\n * per-stage timing extraction from the event timeline (lexer/parser/\n * compiler/VM breakdown) rather than relying on a single total elapsed.\n *\n * Produces a complete DiagnosticReport at the end of evaluation.\n */\nexport class TimelineDiagnosticCollector extends DiagnosticCollector {\n  private events: DiagnosticEvent[] = [];\n  private startNs: number = 0;\n  private parseletEntries: Map<string, { category: string; count: number }> = new Map();\n\n  // Incrementally-maintained summary state. See getReport()'s doc comment\n  // for why these exist. Each mirrors exactly what getReport() used to\n  // recompute by rescanning the full `events` array on every call.\n  private totalTokens = 0;\n  private cacheHitSeen = false;\n  private vmStepSeen = false;\n  private hasBytecodeBuilt = false;\n  private firstBytecodeOpcodesLength = 0;\n  private parseletMatches: CategorizedParselet[] = [];\n  private lastExpression = \"\";\n  private lastInputType = \"\";\n\n  /**\n   * Current cumulative count of `parselet_matched` events seen since\n   * construction (or the last `reset()`), a cheap peek that doesn't build\n   * the full report (`getReport()` copies the whole `parseletMatches`\n   * array). Used by `ExpressionEngine.evaluateExpressionWithDiagnostic()`\n   * to capture a \"before\" baseline per line, since `parseletMatches` itself\n   * is deliberately cumulative across an entire document pass (see\n   * `onPipelineStart`'s doc comment) rather than reset per line.\n   */\n  get parseletMatchCount(): number {\n    return this.parseletMatches.length;\n  }\n\n  reset(): void {\n    this.events = [];\n    this.parseletEntries.clear();\n    this.startNs = 0;\n    this.totalTokens = 0;\n    this.cacheHitSeen = false;\n    this.vmStepSeen = false;\n    this.hasBytecodeBuilt = false;\n    this.firstBytecodeOpcodesLength = 0;\n    this.parseletMatches = [];\n    this.lastExpression = \"\";\n    this.lastInputType = \"\";\n  }\n\n  /** Stamp the real wall-clock `elapsedNs` onto an event before storing it. */\n  private stamp<T extends DiagnosticEvent>(event: T): T {\n    const elapsedNs = this.startNs !== 0\n      ? performance.now() * 1e6 - this.startNs\n      : 0;\n    return { ...event, elapsedNs } as T;\n  }\n\n  onPipelineStart(event: DiagnosticEvent & { type: \"pipeline_start\" }): void {\n    // Set once per collector lifetime (until an explicit reset()), not on\n    // every pipeline, a multi-line evaluation pass fires pipeline_start\n    // once per line, all appending to the SAME `events` array (see\n    // buildLineStats() in the playground, which relies on that shared,\n    // ever-growing array to slice out each line's own events via\n    // cumulative-length diffing). Resetting the origin on every line meant\n    // every individual line's own timestamps were self-consistent, but\n    // nothing tied one line's clock to another's, any code trying to\n    // compare or span timestamps ACROSS lines (e.g. \"how far into this\n    // pass are we\") had no stable reference point to do it with.\n    if (this.startNs === 0) {\n      this.startNs = performance.now() * 1e6;\n    }\n    // Tracked incrementally (most-recent wins) so getReport()'s `metadata`\n    // describes the line THIS report is actually about, reading\n    // `events[0]` instead (the old code) froze `expression`/`inputType` on\n    // the very first line ever evaluated in the session, forever, which is\n    // wrong regardless of whether a field is meant to be cumulative or\n    // per-line: nothing downstream ever wanted \"line 1's expression\" once\n    // the document had moved on to line 50.\n    this.lastExpression = event.expression;\n    this.lastInputType = event.inputType;\n    this.events.push(this.stamp(event));\n  }\n\n  onTokenEmitted(event: DiagnosticEvent & { type: \"token_emitted\" }): void {\n    this.events.push(this.stamp(event));\n    this.totalTokens++;\n  }\n\n  onNormalizerStart(event: DiagnosticEvent & { type: \"normalizer_start\" }): void {\n    this.events.push(this.stamp(event));\n  }\n\n  onTokenFused(event: DiagnosticEvent & { type: \"token_fused\" }): void {\n    this.events.push(this.stamp(event));\n  }\n\n  onNormalizerEnd(event: DiagnosticEvent & { type: \"normalizer_end\" }): void {\n    this.events.push(this.stamp(event));\n  }\n\n  onParseletMatched(event: DiagnosticEvent & { type: \"parselet_matched\" }): void {\n    this.events.push(this.stamp(event));\n\n    const entry = this.parseletEntries.get(event.parseletCategory);\n    if (entry) {\n      entry.count++;\n    } else {\n      this.parseletEntries.set(event.parseletCategory, {\n        category: event.parseletCategory,\n        count: 1,\n      });\n    }\n\n    this.parseletMatches.push({\n      tokenType: event.tokenType,\n      tokenValue: event.tokenValue,\n      parseletCategory: event.parseletCategory,\n      parseletType: event.parseletType,\n      isPrefix: event.isPrefix,\n      bindingPower: event.bindingPower,\n      tokenOffset: event.tokenOffset,\n    });\n  }\n\n  onBytecodeBuilt(event: DiagnosticEvent & { type: \"bytecode_built\" }): void {\n    this.events.push(this.stamp(event));\n    // Matches getReport()'s original behavior: the FIRST bytecode_built\n    // event ever seen (not the most recent) wins, preserved as-is here\n    // this rewrite only changes HOW that value is computed, not what it is.\n    if (!this.hasBytecodeBuilt) {\n      this.hasBytecodeBuilt = true;\n      this.firstBytecodeOpcodesLength = event.opcodesLength;\n    }\n  }\n\n  onVmStep(event: DiagnosticEvent & { type: \"vm_step\" }): void {\n    this.events.push(this.stamp(event));\n    this.vmStepSeen = true;\n  }\n\n  onVmHalt(event: DiagnosticEvent & { type: \"vm_halt\" }): void {\n    this.events.push(this.stamp(event));\n  }\n\n  onCacheHit(event: DiagnosticEvent & { type: \"cache_hit\" }): void {\n    this.events.push(this.stamp(event));\n    this.cacheHitSeen = true;\n  }\n\n  onCacheMiss(event: DiagnosticEvent & { type: \"cache_miss\" }): void {\n    this.events.push(this.stamp(event));\n  }\n\n  onPipelineEnd(event: DiagnosticEvent & { type: \"pipeline_end\" }): void {\n    this.events.push(this.stamp(event));\n  }\n\n/**\n * Build the summary/metadata/parselets report from this collector's\n * running state.\n *\n * These fields used to be recomputed by rescanning the FULL `events`\n * array on every single call (`.some()`/`.filter()`/a manual scan), since\n * `events` is never cleared except by an explicit `reset()` (which nothing\n * in `ExpressionEngine` currently calls, the cumulative-across-the-whole-\n * document design is deliberate, see `onPipelineStart`'s comment and the\n * playground's `buildLineStats()`, which slices per-line events out of\n * this ever-growing array via cumulative-length diffing), that meant\n * per-call cost grew linearly with total prior calls: O(n²) diagnostic-mode\n * evaluation over a document's lifetime. Fixed by maintaining each of these\n * incrementally as events arrive (see the `on*` handlers above), the same\n * pattern already used for `parseletEntries`. Every value produced here is\n * identical to what the old rescanning code produced, including its\n * existing \"first bytecode_built event wins\" quirk. This is a performance\n * fix, not a behavior change.\n */\ngetReport(): DiagnosticReport | undefined {\n     if (this.events.length === 0) return undefined;\n\n     const elapsedNs = performance.now() * 1e6 - this.startNs;\n\n     const parseCategories = new Map<string, number>();\n     for (const [, entry] of this.parseletEntries) {\n       parseCategories.set(entry.category, entry.count);\n     }\n\n     const totalOpcodes = this.firstBytecodeOpcodesLength;\n     const cacheHit = this.cacheHitSeen;\n     const totalTokens = this.totalTokens;\n\n     const report: DiagnosticReport = {\n       events: this.events,\n       parselets: this.parseletMatches.map((e) => ({ ...e })),\n       summary: {\n         totalTokens,\n         totalParselets: parseCategories.size,\n         totalOpcodes,\n         cacheHit,\n         elapsedNs,\n         parseCategories,\n       },\n       metadata: {\n         expression: this.lastExpression,\n         inputType: this.lastInputType,\n         timestamp: Date.now(),\n         vmTraceEnabled: this.vmStepSeen,\n       },\n       toJSON(): DiagnosticReportJSON {\n         return {\n           events: report.events,\n           parselets: report.parselets,\n           summary: {\n             totalTokens: report.summary.totalTokens,\n             totalParselets: report.summary.totalParselets,\n             totalOpcodes: report.summary.totalOpcodes,\n             cacheHit: report.summary.cacheHit,\n             elapsedNs: report.summary.elapsedNs,\n             parseCategories: Object.fromEntries(report.summary.parseCategories),\n           },\n           metadata: { ...report.metadata },\n         };\n       },\n     };\n\n     return report;\n   }\n}","\n\nimport type { MatrixData, RangeData, ColourData, SplitData } from \"@solve-js/vm/Value\";\nimport type { SymbolicNode } from \"@solve-js/symbolic\";\n\n/**\n * Diagnostic event types as string constants (not const enum, for cross-module compatibility with isolatedModules)\n */\nexport const DiagnosticEventType = {\n  TokenEmitted: \"token_emitted\",\n  NormalizerStart: \"normalizer_start\",\n  TokenFused: \"token_fused\",\n  NormalizerEnd: \"normalizer_end\",\n  ParseletMatched: \"parselet_matched\",\n  BytecodeBuilt: \"bytecode_built\",\n  VmStep: \"vm_step\",\n  VmHalt: \"vm_halt\",\n  CacheHit: \"cache_hit\",\n  CacheMiss: \"cache_miss\",\n  PipelineStart: \"pipeline_start\",\n  PipelineEnd: \"pipeline_end\",\n} as const;\n\n/** Discriminator naming which pipeline event a diagnostic record describes. */\nexport type EventType = (typeof DiagnosticEventType)[keyof typeof DiagnosticEventType];\n\n/** Base event, all events include a timestamp relative to pipeline start */\nexport interface BaseEvent {\n  readonly type: string;\n  readonly elapsedNs: number;\n  readonly expression: string;\n}\n\n/** Emitted after each token is produced by the lexer */\nexport interface TokenEmittedEvent extends BaseEvent {\n  readonly type: \"token_emitted\";\n  readonly token: {\n    readonly type: string;\n    readonly value: string;\n    readonly offset: number;\n    readonly line: number;\n    readonly col: number;\n  };\n}\n\n/** Emitted when the parser resolves a parselet for a token */\nexport interface ParseletMatchedEvent extends BaseEvent {\n  readonly type: \"parselet_matched\";\n  readonly tokenType: string;\n  readonly tokenValue: string;\n  readonly parseletCategory: string;\n  readonly parseletType: string;\n  readonly isPrefix: boolean;\n  readonly bindingPower?: number;\n  readonly tokenOffset: number;\n}\n\n/** Emitted after bytecode is built */\nexport interface BytecodeBuiltEvent extends BaseEvent {\n  readonly type: \"bytecode_built\";\n  readonly opcodesLength: number;\n  readonly numbersLength: number;\n  readonly stringsLength: number;\n  readonly isCached: boolean;\n}\n\n/** Emitted after each VM opcode execution (only when vmTrace is enabled) */\nexport interface VmStepEvent extends BaseEvent {\n  readonly type: \"vm_step\";\n  readonly opcode: number;\n  readonly opcodeName: string;\n  readonly ip: number;\n  readonly stackDepth: number;\n  readonly instructionNumber: number;\n  readonly stack: ReadonlyArray<{\n    readonly type: number;\n    readonly value: number | bigint | string | boolean | MatrixData | RangeData | ColourData | SplitData | SymbolicNode;\n    readonly unit?: string;\n  }>;\n}\n\n/** Emitted when the VM halts with a result */\nexport interface VmHaltEvent extends BaseEvent {\n  readonly type: \"vm_halt\";\n  readonly result?: {\n    readonly type: number;\n    readonly value: number | bigint | string | boolean | MatrixData | RangeData | ColourData | SplitData | SymbolicNode;\n    readonly unit?: string;\n  };\n}\n\n/** Emitted on cache hit */\nexport interface CacheHitEvent extends BaseEvent {\n  readonly type: \"cache_hit\";\n  readonly cache: \"bytecode\" | \"line\";\n  readonly key: string;\n}\n\n/** Emitted on cache miss */\nexport interface CacheMissEvent extends BaseEvent {\n  readonly type: \"cache_miss\";\n  readonly cache: \"bytecode\" | \"line\";\n  readonly key: string;\n}\n\n/** Emitted when a pipeline evaluation begins */\nexport interface PipelineStartEvent extends BaseEvent {\n  readonly type: \"pipeline_start\";\n  readonly inputType: string;\n}\n\n/** Emitted when a pipeline evaluation completes */\nexport interface PipelineEndEvent extends BaseEvent {\n  readonly type: \"pipeline_end\";\n  readonly success: boolean;\n  readonly error?: string;\n  readonly totalTokens: number;\n  readonly totalOpcodes: number;\n}\n\n/** Emitted when the normalizer begins its pass */\nexport interface NormalizerStartEvent extends BaseEvent {\n  readonly type: \"normalizer_start\";\n  readonly inputTokenCount: number;\n}\n\n/** Emitted when the normalizer fuses tokens */\nexport interface TokenFusedEvent extends BaseEvent {\n  readonly type: \"token_fused\";\n  readonly ruleName: string;\n  readonly sourceTokenCount: number;\n  readonly fusedTokenType: string;\n  readonly fusedTokenValue: string;\n}\n\n/** Emitted when the normalizer completes its pass */\nexport interface NormalizerEndEvent extends BaseEvent {\n  readonly type: \"normalizer_end\";\n  readonly outputTokenCount: number;\n  readonly fusionsCount: number;\n}\n\n/** Union of all event types */\nexport type DiagnosticEvent =\n  | TokenEmittedEvent\n  | NormalizerStartEvent\n  | TokenFusedEvent\n  | NormalizerEndEvent\n  | ParseletMatchedEvent\n  | BytecodeBuiltEvent\n  | VmStepEvent\n  | VmHaltEvent\n  | CacheHitEvent\n  | CacheMissEvent\n  | PipelineStartEvent\n  | PipelineEndEvent;\n\n/** Categorized parselet info */\nexport interface CategorizedParselet {\n  readonly tokenType: string;\n  readonly tokenValue: string;\n  readonly parseletCategory: string;\n  readonly parseletType: string;\n  readonly isPrefix: boolean;\n  readonly bindingPower?: number;\n  readonly tokenOffset: number;\n}\n\n/** JSON-serializable representation of a DiagnosticReport */\nexport interface DiagnosticReportJSON {\n   readonly events: readonly DiagnosticEvent[];\n   readonly parselets: readonly CategorizedParselet[];\n   readonly summary: {\n     readonly totalTokens: number;\n     readonly totalParselets: number;\n     readonly totalOpcodes: number;\n     readonly cacheHit: boolean;\n     readonly elapsedNs: number;\n     readonly parseCategories: Record<string, number>;\n   };\n   readonly metadata: {\n     readonly expression: string;\n     readonly inputType: string;\n     readonly timestamp: number;\n     readonly vmTraceEnabled: boolean;\n   };\n}\n\n/** Structured diagnostic report */\nexport interface DiagnosticReport {\n   readonly events: readonly DiagnosticEvent[];\n   readonly parselets: readonly CategorizedParselet[];\n   readonly summary: {\n     readonly totalTokens: number;\n     readonly totalParselets: number;\n     readonly totalOpcodes: number;\n     readonly cacheHit: boolean;\n     readonly elapsedNs: number;\n     readonly parseCategories: ReadonlyMap<string, number>;\n   };\n   readonly metadata: {\n     readonly expression: string;\n     readonly inputType: string;\n     readonly timestamp: number;\n     readonly vmTraceEnabled: boolean;\n   };\n\n   /** Serialize to a JSON-safe plain object */\n   toJSON(): DiagnosticReportJSON;\n}\n\n/** JSON-serializable representation of a DiagnosticReport */\nexport interface DiagnosticReportJSON {\n   readonly events: readonly DiagnosticEvent[];\n   readonly parselets: readonly CategorizedParselet[];\n   readonly summary: {\n     readonly totalTokens: number;\n     readonly totalParselets: number;\n     readonly totalOpcodes: number;\n     readonly cacheHit: boolean;\n     readonly elapsedNs: number;\n     readonly parseCategories: Record<string, number>;\n   };\n   readonly metadata: {\n     readonly expression: string;\n     readonly inputType: string;\n     readonly timestamp: number;\n     readonly vmTraceEnabled: boolean;\n   };\n}"]}

package/dist/chunk-U4AEVL5Z.js

@@ -0,0 +1,2 @@
+import {c as c$1}from'./chunk-MPB7KUN5.js';var d="2.1.0";var g=d;var l={date:{maxOffsetYears:100,minOffsetYears:-100,defaultFormat:"YYYY-MM-DD"},performance:{defaultCacheSize:2e3,maxDocumentLines:1e5},validation:{maxExpressionLength:2e3,maxComplexity:500,maxNestingDepth:50,autoBalanceParens:false},vm:{maxStackDepth:200,maxInstructions:5e4,maxCollectionSize:1e5,maxAllocatedElements:2e6,maxFunctionCalls:1e4,maxGoalSeekIterations:100},worker:{maxConcurrentWorkers:4,idleTimeoutMs:3e4,maxRetries:3,baseBackoffMs:1e3},diagnostic:{enabled:false,vmTraceEnabled:false}};function r(s,e){return {date:{...s.date,...e.date},performance:{...s.performance,...e.performance},validation:{...s.validation,...e.validation},vm:{...s.vm,...e.vm},worker:{...s.worker,...e.worker},diagnostic:{...s.diagnostic,...e.diagnostic}}}var c=class{constructor(e={}){this.config=r(l,e);}get(e){let o=e.split("."),t=this.config;for(let i of o)if(t&&typeof t=="object"&&i in t)t=t[i];else throw c$1.config("CONFIG_PATH_NOT_FOUND",`Configuration path not found: ${e}`,{path:e});return t}set(e,o){let t=e.split(".");if(t.length<2)throw c$1.config("INVALID_CONFIG_PATH",`Invalid path: ${e}. Must be in format 'section.property'`,{path:e});let i=t[0],u=t[1];if(!(i in this.config))throw c$1.config("CONFIG_SECTION_NOT_FOUND",`Configuration section not found: ${i}`,{section:i,path:e});let a=this.config[i];if(a&&typeof a=="object")a[u]=o;else throw c$1.config("CONFIG_PROPERTY_NOT_FOUND",`Configuration property not found: ${e}`,{path:e})}getConfig(){return r(this.config,{})}update(e){this.config=r(this.config,e);}reset(){this.config=r(l,{});}validate(){let e=[];return this.config.performance.maxDocumentLines>1e5&&e.push("maxDocumentLines cannot exceed 100,000"),this.config.date.maxOffsetYears>1e3&&e.push("maxOffsetYears cannot exceed 1000"),{valid:e.length===0,error:e.join("; "),warnings:[]}}};export{g as a,l as b,r as c,c as d};//# sourceMappingURL=chunk-U4AEVL5Z.js.map
+//# sourceMappingURL=chunk-U4AEVL5Z.js.map

package/dist/chunk-U4AEVL5Z.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../package.json","../src/constants/version.ts","../src/constants/Configuration.ts"],"names":["version","ENGINE_VERSION","DEFAULT_CONFIG","mergeEngineConfig","base","override","ConfigManager","config","path","keys","current","key","ErrorFactory","value","section","property","sectionConfig","errors"],"mappings":"2CAEE,IAAAA,EAAW,OAAA,CCcN,IAAMC,CAAAA,CAAyBD,MC0SzBE,CAAAA,CAA+B,CACzC,IAAA,CAAM,CAIJ,eAAgB,GAAA,CAChB,cAAA,CAAgB,KAChB,aAAA,CAAe,YACjB,EACA,WAAA,CAAa,CAIX,gBAAA,CAAkB,GAAA,CAalB,iBAAkB,GACpB,CAAA,CACC,WAAY,CACV,mBAAA,CAAqB,IACrB,aAAA,CAAe,GAAA,CACf,eAAA,CAAiB,EAAA,CACjB,kBAAmB,KACrB,CAAA,CACA,GAAI,CACF,aAAA,CAAe,IACf,eAAA,CAAiB,GAAA,CAKjB,iBAAA,CAAmB,GAAA,CAInB,qBAAsB,GAAA,CAMtB,gBAAA,CAAkB,GAAA,CAMlB,qBAAA,CAAuB,GACzB,CAAA,CACA,MAAA,CAAQ,CACN,oBAAA,CAAsB,EACtB,aAAA,CAAe,GAAA,CACf,WAAY,CAAA,CACZ,aAAA,CAAe,GACjB,CAAA,CACA,UAAA,CAAY,CACV,OAAA,CAAS,MACT,cAAA,CAAgB,KAClB,CACF,EAiBK,SAASC,EACdC,CAAAA,CACAC,CAAAA,CACc,CACd,OAAO,CACL,IAAA,CAAM,CAAE,GAAGD,CAAAA,CAAK,IAAA,CAAM,GAAGC,CAAAA,CAAS,IAAK,CAAA,CACvC,WAAA,CAAa,CAAE,GAAGD,CAAAA,CAAK,WAAA,CAAa,GAAGC,EAAS,WAAY,CAAA,CAC5D,UAAA,CAAY,CAAE,GAAGD,CAAAA,CAAK,UAAA,CAAY,GAAGC,CAAAA,CAAS,UAAW,EACzD,EAAA,CAAI,CAAE,GAAGD,CAAAA,CAAK,GAAI,GAAGC,CAAAA,CAAS,EAAG,CAAA,CACjC,MAAA,CAAQ,CAAE,GAAGD,CAAAA,CAAK,MAAA,CAAQ,GAAGC,EAAS,MAAO,CAAA,CAC7C,WAAY,CAAE,GAAGD,EAAK,UAAA,CAAY,GAAGC,CAAAA,CAAS,UAAW,CAC3D,CACF,CAYO,IAAMC,CAAAA,CAAN,KAAoB,CAGzB,WAAA,CAAYC,CAAAA,CAAgC,GAAI,CAC9C,IAAA,CAAK,OAASJ,CAAAA,CAAkBD,CAAAA,CAAgBK,CAAM,EACxD,CAQA,GAAA,CAAOC,CAAAA,CAAiB,CACtB,IAAMC,CAAAA,CAAOD,EAAK,KAAA,CAAM,GAAG,EACvBE,CAAAA,CAAmB,IAAA,CAAK,MAAA,CAE5B,IAAA,IAAWC,KAAOF,CAAAA,CAChB,GAAIC,GAAW,OAAOA,CAAAA,EAAY,UAAYC,CAAAA,IAAOD,CAAAA,CACnDA,CAAAA,CAAWA,CAAAA,CAAoCC,CAAG,CAAA,CAAA,KAElD,MAAMC,GAAAA,CAAa,MAAA,CACjB,wBACA,CAAA,8BAAA,EAAiCJ,CAAI,CAAA,CAAA,CACrC,CAAE,KAAAA,CAAK,CACT,EAIJ,OAAOE,CACT,CAQA,GAAA,CAAOF,CAAAA,CAAcK,CAAAA,CAAgB,CACnC,IAAMJ,CAAAA,CAAOD,CAAAA,CAAK,MAAM,GAAG,CAAA,CAC3B,GAAIC,CAAAA,CAAK,MAAA,CAAS,CAAA,CAChB,MAAMG,IAAa,MAAA,CACjB,qBAAA,CACA,iBAAiBJ,CAAI,CAAA,sCAAA,CAAA,CACrB,CAAE,IAAA,CAAAA,CAAK,CACT,CAAA,CAGF,IAAMM,CAAAA,CAAUL,CAAAA,CAAK,CAAC,CAAA,CAChBM,EAAWN,CAAAA,CAAK,CAAC,CAAA,CAEvB,GAAI,EAAEK,CAAAA,IAAW,IAAA,CAAK,QACpB,MAAMF,GAAAA,CAAa,OACjB,0BAAA,CACA,CAAA,iCAAA,EAAoCE,CAAO,CAAA,CAAA,CAC3C,CAAE,OAAA,CAAAA,CAAAA,CAAS,KAAAN,CAAK,CAClB,EAGF,IAAMQ,CAAAA,CAAgB,IAAA,CAAK,MAAA,CAAOF,CAA6B,CAAA,CAC/D,GAAIE,GAAiB,OAAOA,CAAAA,EAAkB,SAC3CA,CAAAA,CAAqDD,CAAQ,CAAA,CAAIF,CAAAA,CAAAA,WAE5DD,GAAAA,CAAa,MAAA,CACjB,2BAAA,CACA,CAAA,kCAAA,EAAqCJ,CAAI,CAAA,CAAA,CACzC,CAAE,IAAA,CAAAA,CAAK,CACT,CAEJ,CAUA,WAA0B,CACxB,OAAOL,EAAkB,IAAA,CAAK,MAAA,CAAQ,EAAE,CAC1C,CAKA,MAAA,CAAOI,EAAqC,CAC1C,IAAA,CAAK,OAASJ,CAAAA,CAAkB,IAAA,CAAK,MAAA,CAAQI,CAAM,EACrD,CAcA,KAAA,EAAc,CACZ,IAAA,CAAK,MAAA,CAASJ,EAAkBD,CAAAA,CAAgB,EAAE,EACpD,CAKA,QAAA,EAA6B,CAC3B,IAAMe,CAAAA,CAAmB,GAGzB,OAAI,IAAA,CAAK,MAAA,CAAO,WAAA,CAAY,iBAAmB,GAAA,EAC7CA,CAAAA,CAAO,KAAK,wCAAwC,CAAA,CAIlD,KAAK,MAAA,CAAO,IAAA,CAAK,cAAA,CAAiB,GAAA,EACpCA,EAAO,IAAA,CAAK,mCAAmC,EAG1C,CACL,KAAA,CAAOA,EAAO,MAAA,GAAW,CAAA,CACzB,KAAA,CAAOA,CAAAA,CAAO,KAAK,IAAI,CAAA,CACvB,SAAU,EACZ,CACF,CACF","file":"chunk-U4AEVL5Z.js","sourcesContent":["{\n  \"name\": \"solve-engine\",\n  \"version\": \"2.1.0\",\n  \"description\": \"An embeddable expression engine for natural-language calculations: units, currencies, percentages, dates and matrices, with the parsing and evaluation plumbing already built.\",\n  \"keywords\": [\n    \"expression-evaluator\",\n    \"calculator\",\n    \"bytecode-vm\",\n    \"parser\",\n    \"lexer\",\n    \"dsl\",\n    \"markdown\",\n    \"obsidian\"\n  ],\n  \"license\": \"MIT\",\n  \"author\": \"Liam Riddell\",\n  \"homepage\": \"https://liamriddell.github.io/solve-engine/\",\n  \"repository\": {\n    \"type\": \"git\",\n    \"url\": \"git+https://github.com/LiamRiddell/solve-engine.git\",\n    \"directory\": \"packages/engine\"\n  },\n  \"bugs\": {\n    \"url\": \"https://github.com/LiamRiddell/solve-engine/issues\"\n  },\n  \"publishConfig\": {\n    \"access\": \"public\"\n  },\n  \"type\": \"module\",\n  \"engines\": {\n    \"node\": \">=22\"\n  },\n  \"files\": [\n    \"dist\",\n    \"LICENSE\"\n  ],\n  \"main\": \"./dist/index.cjs\",\n  \"module\": \"./dist/index.js\",\n  \"types\": \"./dist/index.d.ts\",\n  \"exports\": {\n    \".\": {\n      \"import\": {\n        \"types\": \"./dist/index.d.ts\",\n        \"default\": \"./dist/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/index.d.cts\",\n        \"default\": \"./dist/index.cjs\"\n      }\n    },\n    \"./engine\": {\n      \"import\": {\n        \"types\": \"./dist/engine.d.ts\",\n        \"default\": \"./dist/engine.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/engine.d.cts\",\n        \"default\": \"./dist/engine.cjs\"\n      }\n    },\n    \"./vm\": {\n      \"import\": {\n        \"types\": \"./dist/vm.d.ts\",\n        \"default\": \"./dist/vm.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/vm.d.cts\",\n        \"default\": \"./dist/vm.cjs\"\n      }\n    },\n    \"./format\": {\n      \"import\": {\n        \"types\": \"./dist/format.d.ts\",\n        \"default\": \"./dist/format.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/format.d.cts\",\n        \"default\": \"./dist/format.cjs\"\n      }\n    },\n    \"./language\": {\n      \"import\": {\n        \"types\": \"./dist/language.d.ts\",\n        \"default\": \"./dist/language.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/language.d.cts\",\n        \"default\": \"./dist/language.cjs\"\n      }\n    },\n    \"./packages\": {\n      \"import\": {\n        \"types\": \"./dist/packages.d.ts\",\n        \"default\": \"./dist/packages.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/packages.d.cts\",\n        \"default\": \"./dist/packages.cjs\"\n      }\n    },\n    \"./constants\": {\n      \"import\": {\n        \"types\": \"./dist/constants.d.ts\",\n        \"default\": \"./dist/constants.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/constants.d.cts\",\n        \"default\": \"./dist/constants.cjs\"\n      }\n    },\n    \"./lexer\": {\n      \"import\": {\n        \"types\": \"./dist/lexer.d.ts\",\n        \"default\": \"./dist/lexer.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/lexer.d.cts\",\n        \"default\": \"./dist/lexer.cjs\"\n      }\n    },\n    \"./parser\": {\n      \"import\": {\n        \"types\": \"./dist/parser.d.ts\",\n        \"default\": \"./dist/parser.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/parser.d.cts\",\n        \"default\": \"./dist/parser.cjs\"\n      }\n    },\n    \"./normalizer\": {\n      \"import\": {\n        \"types\": \"./dist/normalizer.d.ts\",\n        \"default\": \"./dist/normalizer.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/normalizer.d.cts\",\n        \"default\": \"./dist/normalizer.cjs\"\n      }\n    },\n    \"./resolvers\": {\n      \"import\": {\n        \"types\": \"./dist/resolvers.d.ts\",\n        \"default\": \"./dist/resolvers.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/resolvers.d.cts\",\n        \"default\": \"./dist/resolvers.cjs\"\n      }\n    },\n    \"./errors\": {\n      \"import\": {\n        \"types\": \"./dist/errors.d.ts\",\n        \"default\": \"./dist/errors.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/errors.d.cts\",\n        \"default\": \"./dist/errors.cjs\"\n      }\n    },\n    \"./utilities\": {\n      \"import\": {\n        \"types\": \"./dist/utilities.d.ts\",\n        \"default\": \"./dist/utilities.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/utilities.d.cts\",\n        \"default\": \"./dist/utilities.cjs\"\n      }\n    },\n    \"./uom\": {\n      \"import\": {\n        \"types\": \"./dist/uom.d.ts\",\n        \"default\": \"./dist/uom.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/uom.d.cts\",\n        \"default\": \"./dist/uom.cjs\"\n      }\n    },\n    \"./services\": {\n      \"import\": {\n        \"types\": \"./dist/services.d.ts\",\n        \"default\": \"./dist/services.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/services.d.cts\",\n        \"default\": \"./dist/services.cjs\"\n      }\n    },\n    \"./worker\": {\n      \"import\": {\n        \"types\": \"./dist/worker.d.ts\",\n        \"default\": \"./dist/worker.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/worker.d.cts\",\n        \"default\": \"./dist/worker.cjs\"\n      }\n    },\n    \"./testing\": {\n      \"import\": {\n        \"types\": \"./dist/testing.d.ts\",\n        \"default\": \"./dist/testing.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/testing.d.cts\",\n        \"default\": \"./dist/testing.cjs\"\n      }\n    }\n  },\n  \"scripts\": {\n    \"build\": \"tsup\",\n    \"prepublishOnly\": \"npm run build && node ../../scripts/assert-publishable.mjs .\",\n    \"dev\": \"tsup --watch\",\n    \"test\": \"jest --config jest.config.cjs --no-coverage\",\n    \"typecheck\": \"tsgo --noEmit --skipLibCheck\",\n    \"typecheck:tsc\": \"tsc --noEmit --skipLibCheck\"\n  },\n  \"dependencies\": {\n    \"@tanstack/query-core\": \"^5.100.10\"\n  },\n  \"devDependencies\": {\n    \"@jest/globals\": \"^30.4.1\",\n    \"@types/node\": \"^26.2.0\",\n    \"convert\": \"^7.0.0\",\n    \"jest\": \"^30.4.2\",\n    \"ts-jest\": \"^29.4.12\",\n    \"tsup\": \"8.5.1\",\n    \"typescript\": \"5.9.3\"\n  },\n  \"//sideEffects\": \"Load-bearing claim, not boilerplate. tsup's splitting emits bare chunk imports at the top of dist/index.js, and this field tells Rollup, webpack and Vite they may delete them, which esbuild reports as [ignored-bare-import] once per import during `npm run size`. The engine does have module-level work to lose: registerAllTokenTypes(), _PrecedenceParser.BP_TABLE and its cached token ids, and several process-wide registries. It is safe because every chunk doing that work is also imported for its bindings somewhere, so no bundler can drop it. That is a property of how tsup currently splits the code rather than a design guarantee, so `npm run smoke:bundled` (scripts/check-tree-shaking.mjs) proves it on every run of `npm run verify` instead of assuming it, and its header explains the two fixes if it ever stops holding.\",\n  \"sideEffects\": false\n}\n","/**\n * The running engine's own semver version, sourced directly from this\n * package's package.json so it can never drift from what's actually\n * published. Exists so IEnginePackage.engineVersion range checks\n * (api/EngineVersionCompatibility.ts) have something real to check\n * against.\n */\nimport { version } from \"../../package.json\";\n\n/**\n * The running engine's version, taken from package.json.\n *\n * What a package's `engineVersion` range is checked against at registration.\n * A prerelease is compared by its coerced release version, so a 1.0.0 beta\n * satisfies `^1.0.0`. See `api/EngineVersionCompatibility.ts`.\n */\nexport const ENGINE_VERSION: string = version;\n","/**\n * Configuration Module for solve-js Engine\n * \n * This module provides the **single source of truth** for all engine configuration.\n * Every configurable aspect of the engine, from safety limits and performance\n * budgets to VM constraints and worker pool sizing, is defined here.\n * \n * ### Design principles\n * \n * 1. **Engine owns its config.** The engine defines its own config shape and defaults.\n *    Consumers (e.g., the Obsidian plugin) pass partial overrides; all unspecified\n *    fields fall back to `DEFAULT_CONFIG`.\n * \n * 2. **Self-documenting.** Every interface and field has descriptive JSDoc so the\n *    config is understandable at a glance, whether you're using the engine as an\n *    npm package or reading the source.\n * \n * 3. **Minimal consumer knowledge.** Consumers only need to pass `Partial<EngineConfig>`.\n *    They don't need to replicate the full config shape, just the fields they\n *    want to override.\n * \n * @module Configuration\n */\n\nimport { ErrorFactory } from \"@solve-js/errors/UnifiedErrorFramework\";\n\n/**\n * A host's test for whether a calendar date is a public holiday, given the\n * `Date` for that day at local midnight. Return `true` to exclude it from\n * working-day arithmetic.\n */\nexport type HolidayPredicate = (date: Date) => boolean;\n\n/**\n * The host-supplied public-holiday calendar, in the same \"bring your own data\"\n * shape the stocks and weather packages already use for a host callback (see\n * `packages/stocks/StocksPackage.ts`): weekends are decidable from the date\n * alone, holidays are not, so they come from the host or not at all.\n *\n * Either a {@link HolidayPredicate}, for a host that computes holidays itself\n * (an existing library, a region rule), or an iterable of specific dates as\n * `YYYY-MM-DD` strings, epoch-millisecond numbers or `Date` objects, for a host\n * that just has a list. Resolved to one internal predicate by\n * `vm/HolidayCalendar.ts`'s `resolveHolidayPredicate()`.\n *\n * Left unset, working-day arithmetic skips weekends only, which is the honest\n * default: the engine excludes exactly the days it can prove are non-working.\n */\nexport type HolidayCalendar = HolidayPredicate | Iterable<string | number | Date>;\n\n/**\n * Date-related configuration.\n * Controls the bounds and formatting for date/time expression evaluation\n * (e.g., `today + 20 days`, `last monday`).\n */\nexport interface DateConfig {\n  /**\n   * How far forward a date offset whose COST grows with the offset may reach,\n   * in years. Enforced by `vm/VM.ts`'s `addBusinessDays()`.\n   *\n   * Bounds the walk, not the calendar. Every other date offset in the engine\n   * is arithmetic on a Date field, so `today + 100000 days` costs exactly what\n   * one day costs and needs no ceiling; workdays are the one offset that has\n   * to step day by day, because which days are skipped depends on where each\n   * step lands. `today + 100000000 workdays` therefore froze the host for\n   * thirteen seconds inside a single ADD opcode (where `vm.maxInstructions`\n   * cannot see it) and then answered \"Invalid Date\", and a trillion never\n   * returned at all.\n   *\n   * Release hardening: this field was declared, documented as a \"safety\n   * limit\", and read nowhere, so it bounded nothing. A limit a host can\n   * configure and the engine ignores is worse than no limit, because it reads\n   * as protection that is not there.\n   */\n  readonly maxOffsetYears: number;\n  /** How far BACK the same walk may reach, in years, as a negative number. See {@link maxOffsetYears}. */\n  readonly minOffsetYears: number;\n  /** Default date string format for display (moment.js format string) */\n  readonly defaultFormat: string;\n  /**\n   * Public-holiday calendar for working-day arithmetic (`N working days after\n   * <date>`, `working days between <date> and <date>`, `<date> + N workdays`).\n   * See {@link HolidayCalendar}.\n   *\n   * Optional and unset by default: with no calendar, working-day arithmetic\n   * skips weekends only. A host that wants holidays excluded too supplies one\n   * here (`new ExpressionEngine({ config: { date: { holidays } } })`), the\n   * same way stocks and weather take a host data source. Threaded into the VM\n   * by `engine/ExpressionEngine.ts` exactly as {@link maxOffsetYears} is,\n   * because working-day math is a VM operation several grammar forms share, so\n   * the calendar has to be one source the VM owns rather than per-package state\n   * the VM cannot see.\n   */\n  readonly holidays?: HolidayCalendar;\n}\n\n/**\n * Performance-related configuration.\n * Controls caching, timeouts, and processing limits to prevent runaway\n * resource consumption on large documents.\n */\nexport interface PerformanceConfig {\n  /**\n   * Maximum number of entries in {@link ExpressionEngine}'s bytecode cache\n   * (per-instance, keyed by expression text) before the oldest entry is\n   * evicted. Raise this for documents with many distinct expressions if\n   * repeated re-evaluation (e.g. scrolling) is re-parsing instead of\n   * hitting cache, bug fix (release hardening pass): this field used to\n   * be read nowhere; the cache size was a hardcoded, unconfigurable\n   * constant. Note this does NOT bound {@link LineCache}, which has no\n   * size limit of its own.\n   */\n  readonly defaultCacheSize: number;\n  /**\n   * Maximum lines a document may have for the engine to process it in one\n   * pass. Enforced by `ExpressionEngine.parseDocument()` and by\n   * `engine/DocumentModel.ts`'s `setDocument()`, the two entry points that\n   * take a whole document.\n   *\n   * A document costs memory per line whatever each line says: a parsed line\n   * record, a cache entry, a dependency-graph node. Two hundred thousand\n   * lines of `1 + 1` therefore exhausted the heap and aborted the process\n   * before any per-line limit had anything to object to, which is the same\n   * shape of hole as an unbounded expression and needs the same kind of\n   * ceiling. Refusing the document names the limit; a host that genuinely has\n   * a larger one raises this field.\n   *\n   * Release hardening: declared and read nowhere until now.\n   */\n  readonly maxDocumentLines: number;\n}\n\n/**\n * Validation / safety-limit configuration.\n * Protects against runaway expressions that could cause excessive memory use\n * or stack overflow. These limits are checked during lexing and parsing.\n */\n/** Bounds on untrusted input: expression length and nesting depth. */\nexport interface ValidationConfig {\n  /** Maximum expression length in characters. Prevents excessively long strings from entering the pipeline. */\n  readonly maxExpressionLength: number;\n  /** Maximum expression complexity score (`tokens + functionCalls×5 + nestingDepth×10`). Protects against deeply nested or combinatorially complex expressions. */\n  readonly maxComplexity: number;\n  /** Maximum parentheses nesting depth. Prevents stack overflow in the recursive-descent parser. */\n  readonly maxNestingDepth: number;\n  /**\n   * Auto-balance unmatched parentheses by appending missing closing parens\n   * or prepending missing opening parens. When disabled, unbalanced expressions\n   * cause parse errors instead of being silently corrected.\n   *\n   * Disabled by default for strict parsing. Enable for forgiving user input\n   * (e.g., chat-style calculators where users often omit closing parens).\n   * Has zero overhead when disabled, the O(n) paren-count scan is skipped.\n   */\n  readonly autoBalanceParens: boolean;\n}\n\n/**\n * Worker pool configuration.\n * Controls the parallel execution workers used for batch evaluation.\n */\nexport interface WorkerConfig {\n  /** Maximum number of concurrent Web Workers allowed */\n  readonly maxConcurrentWorkers: number;\n  /** Time (ms) a worker stays alive while idle before being terminated */\n  readonly idleTimeoutMs: number;\n  /** Maximum retry attempts for a failed worker operation */\n  readonly maxRetries: number;\n  /** Base backoff delay (ms) between retries (exponential backoff applied on top) */\n  readonly baseBackoffMs: number;\n}  /**\n   * Diagnostic / telemetry configuration.\n   * Controls the diagnostic event pipeline for profiling and debugging.\n   * All diagnostics are disabled by default for maximum production performance.\n   */\n  export interface DiagnosticConfig {\n    /** Master switch: enable the diagnostic pipeline (collectors receive events for all pipeline stages) */\n    readonly enabled: boolean;\n    /** Enable VM trace mode, emits per-opcode execution events (very verbose; disables some optimizations) */\n    readonly vmTraceEnabled: boolean;\n  }\n\n  /**\n   * Virtual Machine configuration.\n   * Controls the internal bytecode VM that executes compiled expressions.\n   */\n  export interface VMConfig {\n    /** Maximum stack depth (value slots) for VM execution, prevents stack overflow in recursive/pratt-parser generated bytecode */\n    readonly maxStackDepth: number;\n    /** Maximum opcodes executed per expression, halts runaway infinite loops */\n    readonly maxInstructions: number;\n    /**\n     * Maximum elements a collection may be expanded to before `map`/`reduce`/\n     * `sum`/`prod` will iterate it.\n     *\n     * A Range is stored as its two bounds and costs nothing until something\n     * materializes it, at which point it becomes one Value per element. Twenty\n     * characters (`sum(x, 1:100000000)`) therefore asked for a hundred million\n     * of them, and neither `maxInstructions` nor `maxStackDepth` could see it:\n     * the expansion happens inside a single opcode, so the instruction counter\n     * is never consulted while it runs, and the elements never reach the value\n     * stack. V8 aborted the whole process with \"Reached heap limit\", which a\n     * host embedding the engine cannot catch.\n     */\n    readonly maxCollectionSize: number;\n    /**\n     * Maximum elements (collection Values, matrix cells) one evaluation may\n     * materialize in total.\n     *\n     * `maxCollectionSize` above bounds a single collection. This bounds the sum\n     * of everything an expression asks for, which is a different question and\n     * the one that actually protects the host: two collections that are\n     * individually legal are legal together, and an operation whose result is\n     * the PRODUCT of two legal operands is bounded by neither of them. A matrix\n     * multiply is exactly that shape, so three lines within every other limit\n     * (`:a = map(1*x, 0:20000)`, `:b = transpose(a)`, `b * a`) asked for four\n     * hundred million cells and aborted the process.\n     *\n     * Counted in elements rather than bytes, because a count is what a call\n     * site has before it allocates. An element is 8 bytes as a numeric matrix\n     * cell and closer to a hundred as a full Value, so the default is worth\n     * roughly 16 MB of matrix or 200 MB of expanded collection: far past any\n     * document and far short of what an editor cannot survive.\n     */\n    readonly maxAllocatedElements: number;\n    /**\n     * Maximum user-defined-function calls one evaluation may make in TOTAL,\n     * however deeply or widely they nest.\n     *\n     * `maxFunctionRecursionDepth` bounds how DEEP calls nest and cannot see\n     * how MANY there are, and those are different numbers. Twenty-two lines of\n     * `f(n)(v) = f(n-1)(v) + f(n-1)(v)` reach a depth of only 22 against a\n     * limit of 50, and make 2,097,152 calls doing it: a fatal heap abort in\n     * under a second. `maxInstructions` cannot bound it either, because\n     * `executeBytecode()` re-enters itself per call and each reentrant call\n     * gets its OWN instruction count, so recursion refreshes its allowance on\n     * the way in. This is the tally that does not refresh; see\n     * `vm/AllocationBudget.ts`, which holds it for the same reason it holds\n     * the element tally.\n     *\n     * Counted in calls rather than in the instructions they run, because the\n     * call is the thing that multiplies: every call allocates a frame, its\n     * arguments and its result whatever its body says.\n     */\n    readonly maxFunctionCalls: number;\n    /**\n     * Hard ceiling on how many bisection steps goal seek (`solve line N for\n     * <var> = <target>`, see `packages/goalseek/`) may take before it gives up\n     * with a structured error rather than continuing.\n     *\n     * Goal seek re-evaluates the target line's expression once per step while\n     * narrowing an interval, and an untrusted document must never be able to\n     * make that loop spin. `maxInstructions` bounds each individual\n     * re-evaluation, but not how many of them the search performs, so this is\n     * the tally that bounds the search itself, the same reason `maxFunctionCalls`\n     * exists alongside `maxInstructions`. Bisection halves the interval every\n     * step, so a hundred steps resolves an input to roughly one part in 2^100:\n     * far past any precision a document needs, and a definite stop either way.\n     */\n    readonly maxGoalSeekIterations: number;\n  }\n\n/**\n * Complete engine configuration.\n *\n * Every field has a default in `DEFAULT_CONFIG`. To customize, pass a\n * `Partial<EngineConfig>` when constructing `ExpressionEngine`. Only the\n * sections/fields you supply are overridden; all others use their defaults.\n *\n * @example\n * ```typescript\n * import { ExpressionEngine } from \"solve-js\";\n *\n * const engine = new ExpressionEngine({ config: {\n *   validation: {\n *     maxExpressionLength: 1000,\n *     maxComplexity: 200,\n *   },\n *   // date, performance, vm, worker, diagnostic all use defaults\n * } });\n * ```\n */\nexport interface EngineConfig {\n    /** Date/time expression evaluation bounds and formatting */\n    readonly date: DateConfig;\n    /** Performance budgets and cache sizing */\n    readonly performance: PerformanceConfig;\n    /** Safety limits for expression complexity */\n    readonly validation: ValidationConfig;\n    /** Internal bytecode VM configuration */\n    readonly vm: VMConfig;\n    /** Parallel worker pool configuration */\n    readonly worker: WorkerConfig;\n    /** Diagnostic pipeline configuration */\n    readonly diagnostic: DiagnosticConfig;\n  }\n\n/**\n * A partial {@link EngineConfig} override, one section at a time.\n *\n * Overrides are merged per section over {@link DEFAULT_CONFIG}, so you can set a\n * single field of one section (`{ validation: { maxExpressionLength: 1000 } }`)\n * and keep every other default in that section. A plain `Partial<EngineConfig>`\n * cannot express that, it demands a whole section object, which is why the\n * documented overrides never typechecked against it. This is the type the\n * constructor and {@link createEngine} accept.\n */\nexport type EngineConfigOverride = {\n  readonly [K in keyof EngineConfig]?: Partial<EngineConfig[K]>;\n};\n\n/**\n * Default configuration values\n */\nexport const DEFAULT_CONFIG: EngineConfig = {\n   date: {\n     // A century of workdays is about 26,000 steps, which is microseconds,\n     // and past any offset a person means. The walk is what these bound; see\n     // DateConfig above for why no other date offset needs a ceiling.\n     maxOffsetYears: 100,\n     minOffsetYears: -100,\n     defaultFormat: 'YYYY-MM-DD'\n   },\n   performance: {\n     // Preserves the effective cache size the hardcoded (now-removed)\n     // BYTECODE_CACHE_MAX_ENTRIES constant had, so wiring this field up\n     // doesn't silently shrink the default cache for existing consumers.\n     defaultCacheSize: 2000,\n     // Raised from the 10,000 this field was declared with, which was never\n     // enforced and turned out to be under what this engine already supports:\n     // its paging design is tested against a 20,000-line document\n     // (`engine/PageManager.ts` and its spec) and its throughput benchmark\n     // parses a 50,000-line one. Twice the largest of those, and the same\n     // number `ConfigManager.validate()` already refuses to go above.\n     //\n     // Measured under a 256MB heap: setting a 100,000-line document costs\n     // 64MB, evaluating every line of a 20,000-line one costs 106MB, and\n     // 200,000 lines aborts the process before a single expression is looked\n     // at. A host with a small heap should lower this; the ceiling is here to\n     // stop the size that cannot work anywhere.\n     maxDocumentLines: 100000,\n   },\n    validation: {\n      maxExpressionLength: 2000,\n      maxComplexity: 500,\n      maxNestingDepth: 50,\n      autoBalanceParens: false,\n    },\n    vm: {\n      maxStackDepth: 200,\n      maxInstructions: 50000,\n      // Two orders of magnitude above anything a person types by hand (the\n      // longest range in the test suite is 1000 elements) and small enough\n      // that expanding it is measured in milliseconds rather than in whether\n      // the host survives.\n      maxCollectionSize: 100000,\n      // Twenty times the single-collection ceiling above, so an expression may\n      // legitimately handle a number of large collections, and two hundred\n      // times below the allocation that took the process down.\n      maxAllocatedElements: 2000000,\n      // Six hundred times the largest call count any test or example makes\n      // (five levels of composition is sixteen calls), and small enough that\n      // the calls it does allow cost single-digit megabytes rather than the\n      // heap. A document that needs more than ten thousand calls on one line\n      // is doing something a calculator was not built for.\n      maxFunctionCalls: 10000,\n      // A hundred bisection steps resolve an input to one part in 2^100, far\n      // finer than any document needs and a firm stop for an untrusted one. A\n      // continuous, monotonic relationship converges in tens of steps, well\n      // under this; hitting it means the target is unreachable or the\n      // relationship is not the smooth one goal seek assumes.\n      maxGoalSeekIterations: 100,\n    },\n    worker: {\n      maxConcurrentWorkers: 4,\n      idleTimeoutMs: 30000,\n      maxRetries: 3,\n      baseBackoffMs: 1000,\n    },\n    diagnostic: {\n      enabled: false,\n      vmTraceEnabled: false,\n    },\n  };\n\n/**\n * Merge a partial config override onto a base `EngineConfig`, section by\n * section, `{ ...base.section, ...override.section }` for each of the 7\n * top-level sections, not a single top-level spread.\n *\n * A shallow `{ ...base, ...override }` at the TOP level replaces an entire\n * section wholesale the moment a caller overrides even one field in it\n * (e.g. `{ performance: { defaultCacheSize: 500 } }` would silently drop\n * every other `performance.*` field back to `undefined`, not to its\n * default). This function exists specifically so every config consumer\n * shares one correct merge instead of each hand-rolling (and risking) its\n * own. `ConfigManager` and `ExpressionEngine` both call this rather than\n * either duplicating the section list or instantiating a whole\n * `ConfigManager` just to reuse its private merge logic.\n */\nexport function mergeEngineConfig(\n  base: EngineConfig,\n  override: EngineConfigOverride\n): EngineConfig {\n  return {\n    date: { ...base.date, ...override.date },\n    performance: { ...base.performance, ...override.performance },\n    validation: { ...base.validation, ...override.validation },\n    vm: { ...base.vm, ...override.vm },\n    worker: { ...base.worker, ...override.worker },\n    diagnostic: { ...base.diagnostic, ...override.diagnostic },\n  };\n}\n\n/**\n * Configuration manager for engine settings\n *\n * @example\n * ```typescript\n * const configManager = new ConfigManager();\n * configManager.set('performance.defaultCacheSize', 2000);\n * const cacheSize = configManager.get('performance.defaultCacheSize');\n * ```\n */\nexport class ConfigManager {\n  private config: EngineConfig;\n\n  constructor(config: Partial<EngineConfig> = {}) {\n    this.config = mergeEngineConfig(DEFAULT_CONFIG, config);\n  }\n\n  /**\n   * Get configuration value by path\n   * \n   * @param path - Dot-notation path to config value\n   * @returns Configuration value\n   */\n  get<T>(path: string): T {\n    const keys = path.split('.');\n    let current: unknown = this.config;\n\n    for (const key of keys) {\n      if (current && typeof current === 'object' && key in current) {\n        current = (current as Record<string, unknown>)[key];\n      } else {\n        throw ErrorFactory.config(\n          \"CONFIG_PATH_NOT_FOUND\",\n          `Configuration path not found: ${path}`,\n          { path }\n        );\n      }\n    }\n\n    return current as T;\n  }\n\n  /**\n   * Set configuration value by path\n   * \n   * @param path - Dot-notation path to config value\n   * @param value - New value\n   */\n  set<T>(path: string, value: T): void {\n    const keys = path.split('.');\n    if (keys.length < 2) {\n      throw ErrorFactory.config(\n        \"INVALID_CONFIG_PATH\",\n        `Invalid path: ${path}. Must be in format 'section.property'`,\n        { path }\n      );\n    }\n    \n    const section = keys[0];\n    const property = keys[1];\n    \n    if (!(section in this.config)) {\n      throw ErrorFactory.config(\n        \"CONFIG_SECTION_NOT_FOUND\",\n        `Configuration section not found: ${section}`,\n        { section, path }\n      );\n    }\n    \n    const sectionConfig = this.config[section as keyof EngineConfig];\n    if (sectionConfig && typeof sectionConfig === 'object') {\n      (sectionConfig as unknown as Record<string, unknown>)[property] = value;\n    } else {\n      throw ErrorFactory.config(\n        \"CONFIG_PROPERTY_NOT_FOUND\",\n        `Configuration property not found: ${path}`,\n        { path }\n      );\n    }\n  }\n\n  /**\n   * Get complete configuration.\n   *\n   * A detached copy, section objects included. A top-level spread would hand\n   * the caller this manager's own section objects, so `getConfig().vm.x = 1`\n   * would be an undeclared back door into {@link set}, bypassing its path\n   * validation and reaching every later {@link get}.\n   */\n  getConfig(): EngineConfig {\n    return mergeEngineConfig(this.config, {});\n  }\n\n  /**\n   * Update multiple configuration values\n   */\n  update(config: Partial<EngineConfig>): void {\n    this.config = mergeEngineConfig(this.config, config);\n  }\n\n  /**\n   * Reset to default configuration.\n   *\n   * Goes through {@link mergeEngineConfig} for the same reason the constructor\n   * does. A top-level `{ ...DEFAULT_CONFIG }` copies the six section\n   * references, not the sections, so after a reset this manager's\n   * `performance` object WAS `DEFAULT_CONFIG.performance` and the next\n   * `set('performance.x', ...)` wrote into the module constant. That constant\n   * is what every `ExpressionEngine` is built from, so one manager's reset\n   * could change the cache size, instruction ceiling or allocation budget of\n   * every engine constructed later in the process.\n   */\n  reset(): void {\n    this.config = mergeEngineConfig(DEFAULT_CONFIG, {});\n  }\n\n  /**\n   * Validate configuration values\n   */\n  validate(): ValidationResult {\n    const errors: string[] = [];\n\n    // Validate performance config\n    if (this.config.performance.maxDocumentLines > 100000) {\n      errors.push('maxDocumentLines cannot exceed 100,000');\n    }\n\n    // Validate date config\n    if (this.config.date.maxOffsetYears > 1000) {\n      errors.push('maxOffsetYears cannot exceed 1000');\n    }\n\n    return {\n      valid: errors.length === 0,\n      error: errors.join('; '),\n      warnings: []\n    };\n  }\n}\n\n/**\n * Result type for {@link ConfigManager.validate}.\n */\nexport interface ValidationResult {\n  valid: boolean;\n  error?: string;\n  warnings?: string[];\n}\n\n"]}

package/dist/chunk-UURM7P3P.cjs

@@ -0,0 +1,4 @@
+'use strict';function e(n){return n.startsWith('"')&&n.endsWith('"')&&n.length>=2?n.slice(1,-1):n}function s(n,i=Number.MAX_SAFE_INTEGER){let t=1,r=n.indexOf(`
+`);for(;r!==-1;){if(++t>i)return t;r=n.indexOf(`
+`,r+1);}return t}exports.a=e;exports.b=s;//# sourceMappingURL=chunk-UURM7P3P.cjs.map
+//# sourceMappingURL=chunk-UURM7P3P.cjs.map

package/dist/chunk-UURM7P3P.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/utilities/Strings.ts"],"names":["stripQuotes","value","countLines","text","stopAfter","count","index"],"mappings":"aASO,SAASA,CAAAA,CAAYC,CAAAA,CAAuB,CAClD,OAAOA,EAAM,UAAA,CAAW,GAAG,CAAA,EAAKA,CAAAA,CAAM,SAAS,GAAG,CAAA,EAAKA,CAAAA,CAAM,MAAA,EAAU,EACpEA,CAAAA,CAAM,KAAA,CAAM,CAAA,CAAG,EAAE,CAAA,CACjBA,CACJ,CAeO,SAASC,EAAWC,CAAAA,CAAcC,CAAAA,CAAoB,MAAA,CAAO,gBAAA,CAA0B,CAC7F,IAAIC,CAAAA,CAAQ,CAAA,CACRC,CAAAA,CAAQH,EAAK,OAAA,CAAQ;AAAA,CAAI,CAAA,CAC7B,KAAOG,CAAAA,GAAU,EAAA,EAAI,CACpB,GAAI,EAAED,CAAAA,CAAQD,CAAAA,CAAW,OAAOC,CAAAA,CAChCC,CAAAA,CAAQH,EAAK,OAAA,CAAQ;AAAA,CAAA,CAAMG,CAAAA,CAAQ,CAAC,EACrC,CACA,OAAOD,CACR","file":"chunk-UURM7P3P.cjs","sourcesContent":["/**\n * Strips a single layer of matching double quotes from a string, if present.\n * Returns the input unchanged if it isn't fully wrapped in quotes.\n *\n * Was needed for STRING token values, which the lexer used to emit with their\n * surrounding `\"...\"` quotes still attached. `tokenizeString()` now strips them\n * when it builds the token, so on that path this is a no-op kept as a defence\n * against text arriving from somewhere else already quoted.\n */\nexport function stripQuotes(value: string): string {\n\treturn value.startsWith('\"') && value.endsWith('\"') && value.length >= 2\n\t\t? value.slice(1, -1)\n\t\t: value;\n}\n\n/**\n * How many lines `text` has, without splitting it into an array.\n *\n * `split(\"\\n\").length` answers the same question and allocates the whole\n * document to do it, which is the wrong shape for a caller whose next move may\n * be to refuse the document for being too large. Counting stops as soon as the\n * answer is \"more than the caller cares about\".\n *\n * @param text - The document.\n * @param stopAfter - Stop counting once past this many lines.\n * @returns The line count, or `stopAfter + 1` for anything longer. A document\n * with no newline in it is one line, matching `split`.\n */\nexport function countLines(text: string, stopAfter: number = Number.MAX_SAFE_INTEGER): number {\n\tlet count = 1;\n\tlet index = text.indexOf(\"\\n\");\n\twhile (index !== -1) {\n\t\tif (++count > stopAfter) return count;\n\t\tindex = text.indexOf(\"\\n\", index + 1);\n\t}\n\treturn count;\n}\n"]}

package/dist/chunk-VAGS5JS7.cjs

@@ -0,0 +1,2 @@
+'use strict';var chunk2LFLR3VZ_cjs=require('./chunk-2LFLR3VZ.cjs'),chunk5IJD5L3O_cjs=require('./chunk-5IJD5L3O.cjs'),chunkSOMGSIO4_cjs=require('./chunk-SOMGSIO4.cjs');var v={maxPasses:100,maxTokens:1e4,onFusion:()=>{}};function N(a,e,r){let n=r[0],o=r[r.length-1],t=new chunk2LFLR3VZ_cjs.a(a,chunk5IJD5L3O_cjs.c(a),e,e,n.offset,n.lineBreaks??0,n.line,n.col);return t.sourceEnd=o.sourceEnd??o.offset+o.text.length,t}function C(a,e){let r=e[e.length-1];r&&(a.sourceEnd=r.sourceEnd??r.offset+r.text.length);}var w=["NUMBER","HEX","BIGINT","FLOAT","LSHIFT","RSHIFT","BIT_AND","BIT_OR","BIT_XOR","LPAREN","RPAREN","LBRACKET","RBRACKET","COMMA","COLON","EQUALS","THEREFORE","PIPE","AMPERSAND","AT","SEMICOLON","QUESTION","EXCLAMATION","EOF","WS","NEWLINE"],I=(()=>{let a=w.map(n=>chunk5IJD5L3O_cjs.c(n)),e=Math.max(...a)+1,r=new Uint8Array(e);for(let n of a)r[n]=1;return r})(),L=class{constructor(e={}){this.rules=[];this.sortedRulesCache=null;this.phraseTrie=new T;this.options={...v,...e};}register(e){this.rules.push(e),this.sortedRulesCache=null;}unregister(e){this.rules=this.rules.filter(r=>r.name!==e),this.sortedRulesCache=null;}clear(){this.rules=[],this.sortedRulesCache=null,this.phraseTrie=new T;}getSortedRules(){return this.sortedRulesCache===null&&(this.sortedRulesCache=[...this.rules].sort((e,r)=>r.priority-e.priority)),this.sortedRulesCache}get ruleCount(){return this.rules.length}addPhrase(e,r){this.phraseTrie.addPhrase(e,r);}getPhrases(){return this.phraseTrie.getAllPhrases()}canStartPhrase(e){return this.phraseTrie.canStart(e)}normalize(e,r){if(e.length===0)return e;let n=this.getSortedRules(),o=r??this.options.onFusion,t=this.options.maxPasses,s=this.options.maxTokens,i=e,m=true,p=0;for(;m&&p<t;){m=false,p++;let h=[],u=0;for(;u<i.length;){let E=false,y=i[u].typeId;if(y>=I.length||I[y]===0){let c=this.phraseTrie.matchAt(i,u);if(c){let l=i.slice(u,u+c.consumed);for(let d of c.replacement)h.push(d);c.consumed>1&&c.replacement.length===1&&(C(c.replacement[0],l),o({rule:c.ruleName??"phrase-trie",sourceTokens:l,fusedToken:c.replacement[0]})),u+=c.consumed,m=true;continue}}for(let c of n){let l=c.match(i,u);if(l){let d=i.slice(u,u+l.consumed);for(let g of l.replacement)h.push(g);if(l.consumed>1&&l.replacement.length===1)C(l.replacement[0],d),o({rule:c.name,sourceTokens:d,fusedToken:l.replacement[0]});else if(l.consumed>1&&l.replacement.length<l.consumed)for(let g of l.replacement)o({rule:c.name,sourceTokens:d,fusedToken:g});u+=l.consumed,m=true,E=true;break}}E||(h.push(i[u]),u++);}if(h.length>s)throw chunkSOMGSIO4_cjs.c.validation("NORMALIZED_TOKEN_LIMIT_EXCEEDED",`Normalized token count (${h.length}) exceeds safety limit (${s})`,{tokenCount:h.length,maxTokens:s});i=h;}return i}};var T=class{constructor(){this.startWords=new Set;this.root=new Map;}addPhrase(e,r){let n=e.toLowerCase().trim().split(/\s+/);if(n.length===0||n[0]==="")return;this.startWords.add(n[0]);let o=n[0],t;if(this.root.has(o)?t=this.root.get(o):(t={children:new Map,terminal:null},this.root.set(o,t)),n.length===1){t.terminal={tokenType:r,phrase:e,consumed:1};return}for(let s=1;s<n.length;s++){let i=n[s];t.children.has(i)||t.children.set(i,{children:new Map,terminal:null}),t=t.children.get(i);}t.terminal={tokenType:r,phrase:e,consumed:n.length};}matchAt(e,r){if(r>=e.length)return null;let n=e[r].type;if(n==="TAG"||n.startsWith("TAG_"))return null;let o=e[r].value.toLowerCase();if(!this.startWords.has(o))return null;let t=this.root.get(o);if(!t)return null;let s=null,i=1;if(t.terminal){let m=e.slice(r,r+1);s={consumed:1,replacement:[N(t.terminal.tokenType,t.terminal.phrase,m)],ruleName:t.terminal.phrase};}for(let m=r+1;m<e.length&&t?.children;m++){let p=e[m].type;if(p==="TAG"||p.startsWith("TAG_"))break;let h=e[m].value.toLowerCase();if(t=t.children.get(h),!t)break;if(i++,t.terminal){let u=e.slice(r,r+i);s={consumed:i,replacement:[N(t.terminal.tokenType,t.terminal.phrase,u)],ruleName:t.terminal.phrase};}}return s}get size(){return this.root.size}getAllPhrases(){let e={},r=(n,o)=>{n.terminal&&(e[o.join(" ")]=n.terminal.tokenType);for(let[t,s]of n.children)r(s,[...o,t]);};for(let[n,o]of this.root)r(o,[n]);return e}canStart(e){return this.startWords.has(e.toLowerCase())}};var S=new Set(["per","a","an","each","every"]),k=new Set(["to","power","increase","decrease","times","multiply","divide","by"]);function x(a=50,e){let r=e??(n=>k.has(n.toLowerCase()));return {name:"implicit:multiply",priority:a,match(n,o){if(o+1>=n.length)return null;let t=n[o],s=n[o+1],i=s.value.toLowerCase();if(r(i)||S.has(i)&&n[o+2]?.type==="UNIT"||!((t.type==="NUMBER"||t.type==="RPAREN")&&(s.type==="IDENT"||s.type==="LPAREN"||s.type==="PI"||s.type==="E")))return null;let p=new chunk2LFLR3VZ_cjs.a("STAR",chunk5IJD5L3O_cjs.c("STAR"),"*","*",s.offset,0,s.line,s.col);return {consumed:1,replacement:[t,p]}}}}function W(a,e){let r=[];for(let n=0;n<e;n++){let o=a[n];if(o.type==="LBRACKET")r.push(true);else if(o.type==="LPAREN"){let t=a[n-1],s=!!t&&(t.type==="MAP"||t.type==="REDUCE"||t.type==="SUM_FN"||t.type==="PROD_FN"||t.type==="IDENT"&&(t.value.toLowerCase()==="map"||t.value.toLowerCase()==="reduce"||t.value.toLowerCase()==="sum"||t.value.toLowerCase()==="prod"));r.push(s);}else (o.type==="RBRACKET"||o.type==="RPAREN")&&r.pop();}return r.length>0&&r[r.length-1]}function U(){return [x()]}var Y={"to the power of":"CARET","power of":"CARET","increase by":"INCREASE_BY","decrease by":"DECREASE_BY","times by":"TIMES_BY","multiply by":"MULTIPLY_BY","divide by":"DIVIDE_BY","multiplied by":"MULTIPLY_BY","divided by":"DIVIDE_BY"};exports.a=T;exports.b=N;exports.c=L;exports.d=x;exports.e=W;exports.f=U;exports.g=Y;//# sourceMappingURL=chunk-VAGS5JS7.cjs.map
+//# sourceMappingURL=chunk-VAGS5JS7.cjs.map