solve-engine 1.2.0 → 2.1.0

package/dist/chunk-E6Z4NQAS.js

@@ -0,0 +1,2 @@
+var A=(_=>(_[_.NOP=0]="NOP",_[_.HALT=1]="HALT",_[_.SWAP=2]="SWAP",_[_.DUP=3]="DUP",_[_.PUSH_NUMBER=10]="PUSH_NUMBER",_[_.PUSH_BIGINT=11]="PUSH_BIGINT",_[_.PUSH_HEX=12]="PUSH_HEX",_[_.PUSH_STRING=13]="PUSH_STRING",_[_.PUSH_BOOLEAN=14]="PUSH_BOOLEAN",_[_.PUSH_VARIABLE=15]="PUSH_VARIABLE",_[_.PUSH_DECIMAL=16]="PUSH_DECIMAL",_[_.ADD=20]="ADD",_[_.SUB=21]="SUB",_[_.MUL=22]="MUL",_[_.DIV=23]="DIV",_[_.MOD=24]="MOD",_[_.EXP=25]="EXP",_[_.NEG=26]="NEG",_[_.POS=27]="POS",_[_.MAKE_UNCERTAIN=28]="MAKE_UNCERTAIN",_[_.LSHIFT=30]="LSHIFT",_[_.RSHIFT=31]="RSHIFT",_[_.URSHIFT=32]="URSHIFT",_[_.BIT_AND=33]="BIT_AND",_[_.BIT_OR=34]="BIT_OR",_[_.BIT_XOR=35]="BIT_XOR",_[_.BIT_NOT=36]="BIT_NOT",_[_.EQ=40]="EQ",_[_.NEQ=41]="NEQ",_[_.LT=42]="LT",_[_.LTE=43]="LTE",_[_.GT=44]="GT",_[_.GTE=45]="GTE",_[_.CALL_PLUGIN=50]="CALL_PLUGIN",_[_.CALL_BUILTIN=51]="CALL_BUILTIN",_[_.RETURN=52]="RETURN",_[_.LOAD_VAR=60]="LOAD_VAR",_[_.STORE_VAR=61]="STORE_VAR",_[_.LOAD_GLOBAL_VAR=62]="LOAD_GLOBAL_VAR",_[_.STORE_GLOBAL_VAR=63]="STORE_GLOBAL_VAR",_[_.TO_NUMBER=70]="TO_NUMBER",_[_.TO_HEX=71]="TO_HEX",_[_.TO_PERCENTAGE=74]="TO_PERCENTAGE",_[_.UOM_CONVERT=80]="UOM_CONVERT",_[_.UOM_CONVERT_TO=81]="UOM_CONVERT_TO",_[_.UOM_GET_VALUE=82]="UOM_GET_VALUE",_[_.UOM_BEST=83]="UOM_BEST",_[_.UOM_CONVERT_IN=84]="UOM_CONVERT_IN",_[_.UOM_POSSIBILITIES=85]="UOM_POSSIBILITIES",_[_.DATE_NOW=90]="DATE_NOW",_[_.DATE_ADD=91]="DATE_ADD",_[_.DATE_SUB=92]="DATE_SUB",_[_.DATE_NEXT_WEEKDAY=93]="DATE_NEXT_WEEKDAY",_[_.DATE_LAST_WEEKDAY=94]="DATE_LAST_WEEKDAY",_[_.DATE_LITERAL=95]="DATE_LITERAL",_[_.DATE_WORKDAY_OFFSET=96]="DATE_WORKDAY_OFFSET",_[_.DATE_WORKDAYS_BETWEEN=97]="DATE_WORKDAYS_BETWEEN",_[_.RATE_DIV=110]="RATE_DIV",_[_.RATE_MUL=111]="RATE_MUL",_[_.RATE_CONVERT=112]="RATE_CONVERT",_[_.CLOCK_TIME_TODAY=120]="CLOCK_TIME_TODAY",_[_.LOGICAL_AND=130]="LOGICAL_AND",_[_.LOGICAL_OR=131]="LOGICAL_OR",_[_.SELECT=132]="SELECT",_[_.TO_FRACTION=140]="TO_FRACTION",_[_.TO_MULTIPLIER=141]="TO_MULTIPLIER",_[_.TO_SCI=142]="TO_SCI",_[_.TO_BINARY=143]="TO_BINARY",_[_.TO_OCTAL=144]="TO_OCTAL",_[_.CALL_AS_CONVERTER=145]="CALL_AS_CONVERTER",_[_.DEFINE_USER_FUNCTION=150]="DEFINE_USER_FUNCTION",_[_.CALL_USER_FUNCTION=151]="CALL_USER_FUNCTION",_[_.MAT_NEW=152]="MAT_NEW",_[_.MAT_INDEX1=153]="MAT_INDEX1",_[_.MAT_INDEX2=154]="MAT_INDEX2",_[_.MAT_SLICE=155]="MAT_SLICE",_[_.RANGE_NEW=156]="RANGE_NEW",_[_.MAP_INVOKE=157]="MAP_INVOKE",_[_.REDUCE_INVOKE=158]="REDUCE_INVOKE",_[_.BIND_UNKNOWN=159]="BIND_UNKNOWN",_))(A||{}),I=(()=>{let E=new Map;for(let[N,T]of Object.entries(A))typeof T=="number"&&E.set(T,N);return E})();function L(E){return I.get(E)??`UNKNOWN_${E}`}export{A as a,L as b};//# sourceMappingURL=chunk-E6Z4NQAS.js.map
+//# sourceMappingURL=chunk-E6Z4NQAS.js.map

package/dist/chunk-E6Z4NQAS.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/parser/OpCode.ts"],"names":["OpCode","OP_CODE_NAMES","map","key","value","getOpCodeName","op"],"mappings":"AAcO,IAAKA,OAEXA,CAAAA,CAAAA,CAAAA,CAAA,GAAA,CAAM,GAAN,KAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,KAAO,CAAA,CAAA,CAAP,MAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,IAAA,CAAO,GAAP,MAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,IAAM,CAAA,CAAA,CAAN,KAAA,CAGAA,IAAA,WAAA,CAAc,EAAA,CAAA,CAAd,aAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,YAAc,EAAA,CAAA,CAAd,aAAA,CACAA,IAAA,QAAA,CAAW,EAAA,CAAA,CAAX,WACAA,CAAAA,CAAAA,CAAAA,CAAA,WAAA,CAAc,IAAd,aAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,aAAe,EAAA,CAAA,CAAf,cAAA,CACAA,IAAA,aAAA,CAAgB,EAAA,CAAA,CAAhB,gBAMAA,CAAAA,CAAAA,CAAAA,CAAA,YAAA,CAAe,EAAA,CAAA,CAAf,cAAA,CAGAA,IAAA,GAAA,CAAM,EAAA,CAAA,CAAN,MACAA,CAAAA,CAAAA,CAAAA,CAAA,GAAA,CAAM,IAAN,KAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,IAAM,EAAA,CAAA,CAAN,KAAA,CACAA,IAAA,GAAA,CAAM,EAAA,CAAA,CAAN,MACAA,CAAAA,CAAAA,CAAAA,CAAA,GAAA,CAAM,IAAN,KAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,GAAA,CAAM,EAAA,CAAA,CAAN,MACAA,CAAAA,CAAAA,CAAAA,CAAA,GAAA,CAAM,IAAN,KAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,IAAM,EAAA,CAAA,CAAN,KAAA,CAMAA,IAAA,cAAA,CAAiB,EAAA,CAAA,CAAjB,iBAGAA,CAAAA,CAAAA,CAAAA,CAAA,MAAA,CAAS,IAAT,QAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,OAAS,EAAA,CAAA,CAAT,QAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,OAAA,CAAU,IAAV,SAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,QAAU,EAAA,CAAA,CAAV,SAAA,CACAA,IAAA,MAAA,CAAS,EAAA,CAAA,CAAT,SACAA,CAAAA,CAAAA,CAAAA,CAAA,OAAA,CAAU,IAAV,SAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,QAAU,EAAA,CAAA,CAAV,SAAA,CAGAA,IAAA,EAAA,CAAK,EAAA,CAAA,CAAL,IAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,IAAM,EAAA,CAAA,CAAN,KAAA,CACAA,IAAA,EAAA,CAAK,EAAA,CAAA,CAAL,KACAA,CAAAA,CAAAA,CAAAA,CAAA,GAAA,CAAM,IAAN,KAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,GAAK,EAAA,CAAA,CAAL,IAAA,CACAA,IAAA,GAAA,CAAM,EAAA,CAAA,CAAN,MAGAA,CAAAA,CAAAA,CAAAA,CAAA,WAAA,CAAc,EAAA,CAAA,CAAd,aAAA,CACAA,IAAA,YAAA,CAAe,EAAA,CAAA,CAAf,eACAA,CAAAA,CAAAA,CAAAA,CAAA,MAAA,CAAS,IAAT,QAAA,CAGAA,CAAAA,CAAAA,CAAAA,CAAA,SAAW,EAAA,CAAA,CAAX,UAAA,CACAA,IAAA,SAAA,CAAY,EAAA,CAAA,CAAZ,YACAA,CAAAA,CAAAA,CAAAA,CAAA,eAAA,CAAkB,IAAlB,iBAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,gBAAA,CAAmB,EAAA,CAAA,CAAnB,mBAGAA,CAAAA,CAAAA,CAAAA,CAAA,SAAA,CAAY,IAAZ,WAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,OAAS,EAAA,CAAA,CAAT,QAAA,CACAA,IAAA,aAAA,CAAgB,EAAA,CAAA,CAAhB,gBAGAA,CAAAA,CAAAA,CAAAA,CAAA,WAAA,CAAc,IAAd,aAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,eAAiB,EAAA,CAAA,CAAjB,gBAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,aAAA,CAAgB,IAAhB,eAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,SAAW,EAAA,CAAA,CAAX,UAAA,CACAA,IAAA,cAAA,CAAiB,EAAA,CAAA,CAAjB,gBAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,kBAAoB,EAAA,CAAA,CAApB,mBAAA,CAGAA,IAAA,QAAA,CAAW,EAAA,CAAA,CAAX,WACAA,CAAAA,CAAAA,CAAAA,CAAA,QAAA,CAAW,EAAA,CAAA,CAAX,UAAA,CACAA,IAAA,QAAA,CAAW,EAAA,CAAA,CAAX,WACAA,CAAAA,CAAAA,CAAAA,CAAA,iBAAA,CAAoB,IAApB,mBAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,kBAAoB,EAAA,CAAA,CAApB,mBAAA,CACAA,IAAA,YAAA,CAAe,EAAA,CAAA,CAAf,eACAA,CAAAA,CAAAA,CAAAA,CAAA,mBAAA,CAAsB,IAAtB,qBAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,qBAAA,CAAwB,EAAA,CAAA,CAAxB,wBAKAA,CAAAA,CAAAA,CAAAA,CAAA,QAAA,CAAW,KAAX,UAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,SAAW,GAAA,CAAA,CAAX,UAAA,CACAA,IAAA,YAAA,CAAe,GAAA,CAAA,CAAf,eAIAA,CAAAA,CAAAA,CAAAA,CAAA,gBAAA,CAAmB,KAAnB,kBAAA,CAKAA,CAAAA,CAAAA,CAAAA,CAAA,YAAc,GAAA,CAAA,CAAd,aAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,UAAA,CAAa,KAAb,YAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,OAAS,GAAA,CAAA,CAAT,QAAA,CAUAA,IAAA,WAAA,CAAc,GAAA,CAAA,CAAd,cACAA,CAAAA,CAAAA,CAAAA,CAAA,aAAA,CAAgB,KAAhB,eAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,OAAS,GAAA,CAAA,CAAT,QAAA,CACAA,IAAA,SAAA,CAAY,GAAA,CAAA,CAAZ,WAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,SAAW,GAAA,CAAA,CAAX,UAAA,CACAA,IAAA,iBAAA,CAAoB,GAAA,CAAA,CAApB,oBAUAA,CAAAA,CAAAA,CAAAA,CAAA,oBAAA,CAAuB,KAAvB,sBAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,mBAAqB,GAAA,CAAA,CAArB,oBAAA,CAMAA,IAAA,OAAA,CAAU,GAAA,CAAA,CAAV,UACAA,CAAAA,CAAAA,CAAAA,CAAA,UAAA,CAAa,GAAA,CAAA,CAAb,YAAA,CACAA,IAAA,UAAA,CAAa,GAAA,CAAA,CAAb,aACAA,CAAAA,CAAAA,CAAAA,CAAA,SAAA,CAAY,KAAZ,WAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,UAAY,GAAA,CAAA,CAAZ,WAAA,CACAA,IAAA,UAAA,CAAa,GAAA,CAAA,CAAb,aACAA,CAAAA,CAAAA,CAAAA,CAAA,aAAA,CAAgB,KAAhB,eAAA,CAOAA,CAAAA,CAAAA,CAAAA,CAAA,YAAA,CAAe,GAAA,CAAA,CAAf,eArJWA,CAAAA,CAAAA,EAAAA,CAAAA,EAAA,EAAA,CAAA,CAsKNC,GAA8C,IAAM,CACzD,IAAMC,CAAAA,CAAM,IAAI,IAChB,IAAA,GAAW,CAACC,EAAKC,CAAK,CAAA,GAAK,OAAO,OAAA,CAAQJ,CAAM,EAC3C,OAAOI,CAAAA,EAAU,QAAA,EAAUF,CAAAA,CAAI,IAAIE,CAAAA,CAAOD,CAAG,EAElD,OAAOD,CACR,KAOO,SAASG,EAAcC,CAAAA,CAAoB,CACjD,OAAOL,CAAAA,CAAc,GAAA,CAAIK,CAAE,CAAA,EAAK,CAAA,QAAA,EAAWA,CAAE,CAAA,CAC9C","file":"chunk-E6Z4NQAS.js","sourcesContent":["/**\n * The VM's bytecode instruction set.\n *\n * Emitted by parselets (via {@link BytecodeBuilder}) during parsing and\n * consumed by the VM's dispatch loop during execution. Values are grouped\n * into numeric bands by category (0-9 stack ops, 10-19 push-literal, 20-29\n * arithmetic, ...) purely for readability, the VM dispatches on the exact\n * numeric value, not the band.\n *\n * Third-party packages emit `CALL_PLUGIN` (with a plugin-function index\n * from {@link allocatePluginFunctionIndex}) to invoke their own logic\n * see `IEnginePackage.pluginFunctions`. The other opcodes are used\n * internally by the built-in packages' parselets.\n */\nexport enum OpCode {\n\t// Stack operations\n\tNOP = 0,\n\tHALT = 1,\n\tSWAP = 2,\n\tDUP = 3,\n\n\t// Push literals\n\tPUSH_NUMBER = 10,\n\tPUSH_BIGINT = 11,\n\tPUSH_HEX = 12,\n\tPUSH_STRING = 13,\n\tPUSH_BOOLEAN = 14,\n\tPUSH_VARIABLE = 15,\n\t// A decimal-point literal, pushed with the exact base-ten value it was\n\t// written as alongside the nearest double. The operand is a string-pool\n\t// index holding the normalized \".\" decimal text (thousands grouping already\n\t// stripped), read back into a Number-typed Value whose `exact` sidecar makes\n\t// money that combines with it exact. See vm/Value.ts's numberValueExact().\n\tPUSH_DECIMAL = 16,\n\n\t// Arithmetic (BinaryOperator)\n\tADD = 20,\n\tSUB = 21,\n\tMUL = 22,\n\tDIV = 23,\n\tMOD = 24,\n\tEXP = 25,\n\tNEG = 26,\n\tPOS = 27,\n\t// `a ± b` (or the ASCII `a +/- b`): pops the spread then the center off the\n\t// stack and pushes a Number carrying a one-sigma uncertainty (`vm/Value.ts`'s\n\t// numberValueUncertain). Takes no operand byte, like the other arithmetic\n\t// ops. See packages/uncertainty/ for the parselet that emits it and\n\t// vm/VMConversion.ts's uncertainOp for how the four arithmetic ops propagate.\n\tMAKE_UNCERTAIN = 28,\n\n\t// Bitwise\n\tLSHIFT = 30,\n\tRSHIFT = 31,\n\tURSHIFT = 32,\n\tBIT_AND = 33,\n\tBIT_OR = 34,\n\tBIT_XOR = 35,\n\tBIT_NOT = 36,\n\n\t// Comparison\n\tEQ = 40,\n\tNEQ = 41,\n\tLT = 42,\n\tLTE = 43,\n\tGT = 44,\n\tGTE = 45,\n\n\t// Functions\n\tCALL_PLUGIN = 50,     // Plugin-registered functions (may be async — pre-resolved by orchestrator)\n\tCALL_BUILTIN = 51,    // Sync built-in functions (sqrt, sin, diceRoll, matmul)\n\tRETURN = 52,          // Reserved for future user-defined functions\n\n\t// Variables\n\tLOAD_VAR = 60,\n\tSTORE_VAR = 61,\n\tLOAD_GLOBAL_VAR = 62,   // Reads from the process-wide GlobalVariableStore, not the VM's local scope\n\tSTORE_GLOBAL_VAR = 63,  // Writes to the process-wide GlobalVariableStore, visible to every document\n\n\t// Type conversion\n\tTO_NUMBER = 70,\n\tTO_HEX = 71,\n\tTO_PERCENTAGE = 74,\n\n\t// UoM\n\tUOM_CONVERT = 80,\n\tUOM_CONVERT_TO = 81,\n\tUOM_GET_VALUE = 82,\n\tUOM_BEST = 83,\n\tUOM_CONVERT_IN = 84,\n\tUOM_POSSIBILITIES = 85,  // \"sourceUnit to ?\" — list units convertible from sourceUnit\n\n\t// Datetime\n\tDATE_NOW = 90,\n\tDATE_ADD = 91,\n\tDATE_SUB = 92,\n\tDATE_NEXT_WEEKDAY = 93,  // \"next <Weekday>\" — the next occurrence strictly after now\n\tDATE_LAST_WEEKDAY = 94,  // \"last <Weekday>\" — the previous occurrence strictly before now\n\tDATE_LITERAL = 95,       // Push a datetime literal whose epoch-ms was already resolved at parse time (see DateLiteralParselet)\n\tDATE_WORKDAY_OFFSET = 96,   // \"N working days after/before/from <date>\" — a business-day walk from the anchor date. One operand byte: 0 forward, 1 backward. Same walk as `<date> + N workdays` (vm/VM.ts's addBusinessDays). See WorkdayOffsetParselet.\n\tDATE_WORKDAYS_BETWEEN = 97, // \"working days between <date> and <date>\" — the count of working days in the inclusive span. See WorkdaysBetweenParselet and vm/BusinessDays.ts's countBusinessDaysBetween.\n\n\t// Rate, \"quantity per unit of something\" ($99/week, 30 fps). See\n\t// vm/Value.ts's rateValue()/isRateUnit()/splitRateUnit() for the\n\t// representation these opcodes operate on.\n\tRATE_DIV = 110,      // Uom ÷ Uom (different measures) -> Rate — the construction op\n\tRATE_MUL = 111,      // Rate × Uom (same measure as denominator) -> plain Uom (denominator cancels)\n\tRATE_CONVERT = 112,  // Rate -> Rate with a rescaled denominator unit (keeps the same real-world rate)\n\n\t// Time, clock-time-of-day, lap times, video timecode (distinct from\n\t// the Datetime band's calendar-date arithmetic).\n\tCLOCK_TIME_TODAY = 120,  // minutes-since-midnight -> Datetime anchored to today's calendar date\n\n\t// Conditionals, boolean logic and eager-evaluated ternary selection.\n\t// EQ/NEQ/LT/LTE/GT/GTE (40-45, above) already existed as dead opcodes\n\t// before this band was wired up; see vm/VM.ts for their handlers.\n\tLOGICAL_AND = 130,  // Boolean && Boolean -> Boolean\n\tLOGICAL_OR = 131,   // Boolean || Boolean -> Boolean\n\tSELECT = 132,       // (thenVal, elseVal, condition) -> thenVal if condition else elseVal — EAGER (both\n\t                    // branches already evaluated by the time this runs; no real branching/short-circuit,\n\t                    // a deliberate simplification for a side-effect-free expression language, see\n\t                    // packages/conditionals/parselets/IfThenElseParselet.ts)\n\n\t// Converters, the general \"as <type>\" mechanism. TO_NUMBER/TO_HEX/\n\t// TO_PERCENTAGE (70/71/74, above) cover the simplest cases; these cover\n\t// the ones with no existing opcode. CALL_AS_CONVERTER is the SDK\n\t// extension point. See IEnginePackage.asConverters and\n\t// vm/VMBuiltins.ts's asConverterRegistry.\n\tTO_FRACTION = 140,       // Number -> String, simplified fraction (\"0.5\" -> \"1/2\")\n\tTO_MULTIPLIER = 141,     // Number -> String, \"1 + n\" growth multiplier (\"0.5\" -> \"1.5x\")\n\tTO_SCI = 142,            // Number -> String, scientific notation (\"1500000\" -> \"1.5e+6\")\n\tTO_BINARY = 143,         // Number -> String, base-2 display (\"10\" -> \"0b1010\")\n\tTO_OCTAL = 144,          // Number -> String, base-8 display (\"10\" -> \"0o12\")\n\tCALL_AS_CONVERTER = 145, // (value, name) -> runtime asConverterRegistry lookup + call\n\n\t// User-defined, parameterized, reusable functions (f(x) = expr, then\n\t// f(5). See parser/PrecedenceParser.ts's IDENT_ID case\n\t// parser/BytecodeBuilder.ts's UserFunctionDef/emitUserFunctionBody, and\n\t// vm/VM.ts's VM.userFunctions/callFrames). Parameter references inside a\n\t// function body are ORDINARY LOAD_VAR opcodes, not a dedicated\n\t// parameter-load opcode, CALL_USER_FUNCTION binds arguments into a\n\t// name-keyed call frame at runtime, and LOAD_VAR checks the innermost\n\t// call frame before the flat variable store (see VM.getVar()).\n\tDEFINE_USER_FUNCTION = 150, // (operand = index into bytecode.userFunctionBodies) -> register name/params/program into vm.userFunctions. Registration happens at VM-EXECUTION time, not parse time, so a diagnostic/lookahead parse that compiles but never executes a definition line has no side effect on the shared registry.\n\tCALL_USER_FUNCTION = 151,   // (N arg values already on stack) -> pop N args, bind by NAME into a new call frame, execute the named function's stored body (reentrant executeBytecode), push its result\n\n\t// Matrix (Calca-parity, replaces the old ARR_* vector-only opcodes\n\t// which were never emitted by any registered parselet; see\n\t// vm/MatrixOps.ts for the shared column-major storage helpers this band\n\t// operates on, and vm/Value.ts's MatrixData for the representation).\n\tMAT_NEW = 152,      // (rows, cols operands; rows*cols values already on stack, ROW-MAJOR push order) -> pop rows*cols values, transpose to column-major, push a Matrix\n\tMAT_INDEX1 = 153,   // (matrix, index already on stack) -> column-major single-index read `a[i]`\n\tMAT_INDEX2 = 154,   // (matrix, row, col already on stack) -> `a[row, col]` read\n\tMAT_SLICE = 155,    // (matrix, rowRange, colRange already on stack) -> sub-matrix via two Range values\n\tRANGE_NEW = 156,    // (min, max already on stack) -> push a Range value `min:max`\n\tMAP_INVOKE = 157,   // map(...) — see parser/BytecodeBuilder.ts's `anonymousBodies` side-table\n\tREDUCE_INVOKE = 158, // reduce(...) — same anonymousBodies mechanism as MAP_INVOKE\n\t// An algebra verb's expression argument, evaluated with the verb's own\n\t// named unknown bound to itself (`der(x^2, x)` reads `x` as the unknown\n\t// even where the document also has a value for it). Operand = an index\n\t// into `anonymousBodies`, whose `params[0]` carries the name to bind, the\n\t// same side-table and the same call-frame shadowing MAP_INVOKE uses for a\n\t// transform body's parameters. See vm/VM.ts's handler.\n\tBIND_UNKNOWN = 159,\n\t// 159 and 160 were THEREFORE_SOLVE and STORE_EQUATION_OR_ASSIGNMENT, declared\n\t// but never emitted by any parselet nor handled in the VM switch. Both shapes\n\t// have effects (a stored equation, a direct vm.setVar()) that a cached\n\t// bytecode program cannot represent, so engine/ExpressionEngine.ts intercepts\n\t// them before compilation and always will. 159 has since been reused above;\n\t// 160 is still free.\n}\n\n// Reverse lookup built once at module load, getOpCodeName() is called once\n// per VM instruction whenever a diagnostic collector is attached (VM.ts's\n// trace path), so a per-call linear scan of every enum entry (TS numeric\n// enums are bidirectional at runtime, so Object.entries(OpCode) yields both\n// \"NOP\" -> 0 and \"0\" -> \"NOP\" style entries) would otherwise redo the same\n// scan every single traced instruction. Only the numeric-valued entries are\n// kept, the string-valued reverse entries TS also generates aren't needed\n// here.\nconst OP_CODE_NAMES: ReadonlyMap<number, string> = (() => {\n\tconst map = new Map<number, string>();\n\tfor (const [key, value] of Object.entries(OpCode)) {\n\t\tif (typeof value === \"number\") map.set(value, key);\n\t}\n\treturn map;\n})();\n\n/**\n * Gets the name of an OpCode as a string.\n * @param op The OpCode value\n * @returns The enum name as a string, or \"UNKNOWN_<value>\" if not found\n */\nexport function getOpCodeName(op: number): string {\n\treturn OP_CODE_NAMES.get(op) ?? `UNKNOWN_${op}`;\n}\n"]}

package/dist/chunk-EFJCC6FJ.cjs

@@ -0,0 +1,2 @@
+'use strict';function r(n){let e=5381;for(let t=0;t<n.length;t++)e=(e<<5)+e+n.charCodeAt(t)|0;return e>>>0}exports.a=r;//# sourceMappingURL=chunk-EFJCC6FJ.cjs.map
+//# sourceMappingURL=chunk-EFJCC6FJ.cjs.map

package/dist/chunk-EFJCC6FJ.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/utilities/Hash.ts"],"names":["djb2Hash","str","hash","i"],"mappings":"aAYO,SAASA,CAAAA,CAASC,CAAAA,CAAqB,CAC7C,IAAIC,CAAAA,CAAO,KACX,IAAA,IAASC,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIF,CAAAA,CAAI,MAAA,CAAQE,IAC/BD,CAAAA,CAAAA,CAASA,CAAAA,EAAQ,CAAA,EAAKA,CAAAA,CAAOD,CAAAA,CAAI,UAAA,CAAWE,CAAC,CAAA,CAAK,CAAA,CAEnD,OAAOD,CAAAA,GAAS,CACjB","file":"chunk-EFJCC6FJ.cjs","sourcesContent":["/**\n * Fast, non-cryptographic string hashing utilities.\n *\n * djb2 is chosen for its speed, simplicity, and excellent distribution\n * for short strings (typical line lengths in markdown documents).\n * It produces a 32-bit unsigned integer hash.\n */\n\n/**\n * djb2 string hash, fast, simple, good distribution.\n * Used for O(1) line text change detection in DocumentModel.\n */\nexport function djb2Hash(str: string): number {\n\tlet hash = 5381;\n\tfor (let i = 0; i < str.length; i++) {\n\t\thash = ((hash << 5) + hash + str.charCodeAt(i)) | 0;\n\t}\n\treturn hash >>> 0; // unsigned 32-bit\n}\n"]}

package/dist/chunk-ESUN2THE.cjs

@@ -0,0 +1,2 @@
+'use strict';var w={aliceblue:[240,248,255],antiquewhite:[250,235,215],aqua:[0,255,255],aquamarine:[127,255,212],azure:[240,255,255],beige:[245,245,220],bisque:[255,228,196],black:[0,0,0],blanchedalmond:[255,235,205],blue:[0,0,255],blueviolet:[138,43,226],brown:[165,42,42],burlywood:[222,184,135],cadetblue:[95,158,160],chartreuse:[127,255,0],chocolate:[210,105,30],coral:[255,127,80],cornflowerblue:[100,149,237],cornsilk:[255,248,220],crimson:[220,20,60],cyan:[0,255,255],darkblue:[0,0,139],darkcyan:[0,139,139],darkgoldenrod:[184,134,11],darkgray:[169,169,169],darkgreen:[0,100,0],darkgrey:[169,169,169],darkkhaki:[189,183,107],darkmagenta:[139,0,139],darkolivegreen:[85,107,47],darkorange:[255,140,0],darkorchid:[153,50,204],darkred:[139,0,0],darksalmon:[233,150,122],darkseagreen:[143,188,143],darkslateblue:[72,61,139],darkslategray:[47,79,79],darkslategrey:[47,79,79],darkturquoise:[0,206,209],darkviolet:[148,0,211],deeppink:[255,20,147],deepskyblue:[0,191,255],dimgray:[105,105,105],dimgrey:[105,105,105],dodgerblue:[30,144,255],firebrick:[178,34,34],floralwhite:[255,250,240],forestgreen:[34,139,34],fuchsia:[255,0,255],gainsboro:[220,220,220],ghostwhite:[248,248,255],gold:[255,215,0],goldenrod:[218,165,32],gray:[128,128,128],green:[0,128,0],greenyellow:[173,255,47],grey:[128,128,128],honeydew:[240,255,240],hotpink:[255,105,180],indianred:[205,92,92],indigo:[75,0,130],ivory:[255,255,240],khaki:[240,230,140],lavender:[230,230,250],lavenderblush:[255,240,245],lawngreen:[124,252,0],lemonchiffon:[255,250,205],lightblue:[173,216,230],lightcoral:[240,128,128],lightcyan:[224,255,255],lightgoldenrodyellow:[250,250,210],lightgray:[211,211,211],lightgreen:[144,238,144],lightgrey:[211,211,211],lightpink:[255,182,193],lightsalmon:[255,160,122],lightseagreen:[32,178,170],lightskyblue:[135,206,250],lightslategray:[119,136,153],lightslategrey:[119,136,153],lightsteelblue:[176,196,222],lightyellow:[255,255,224],lime:[0,255,0],limegreen:[50,205,50],linen:[250,240,230],magenta:[255,0,255],maroon:[128,0,0],mediumaquamarine:[102,205,170],mediumblue:[0,0,205],mediumorchid:[186,85,211],mediumpurple:[147,112,219],mediumseagreen:[60,179,113],mediumslateblue:[123,104,238],mediumspringgreen:[0,250,154],mediumturquoise:[72,209,204],mediumvioletred:[199,21,133],midnightblue:[25,25,112],mintcream:[245,255,250],mistyrose:[255,228,225],moccasin:[255,228,181],navajowhite:[255,222,173],navy:[0,0,128],oldlace:[253,245,230],olive:[128,128,0],olivedrab:[107,142,35],orange:[255,165,0],orangered:[255,69,0],orchid:[218,112,214],palegoldenrod:[238,232,170],palegreen:[152,251,152],paleturquoise:[175,238,238],palevioletred:[219,112,147],papayawhip:[255,239,213],peachpuff:[255,218,185],peru:[205,133,63],pink:[255,192,203],plum:[221,160,221],powderblue:[176,224,230],purple:[128,0,128],rebeccapurple:[102,51,153],red:[255,0,0],rosybrown:[188,143,143],royalblue:[65,105,225],saddlebrown:[139,69,19],salmon:[250,128,114],sandybrown:[244,164,96],seagreen:[46,139,87],seashell:[255,245,238],sienna:[160,82,45],silver:[192,192,192],skyblue:[135,206,235],slateblue:[106,90,205],slategray:[112,128,144],slategrey:[112,128,144],snow:[255,250,250],springgreen:[0,255,127],steelblue:[70,130,180],tan:[210,180,140],teal:[0,128,128],thistle:[216,191,216],tomato:[255,99,71],turquoise:[64,224,208],violet:[238,130,238],wheat:[245,222,179],white:[255,255,255],whitesmoke:[245,245,245],yellow:[255,255,0],yellowgreen:[154,205,50]};function s(r){return Math.min(255,Math.max(0,Math.round(r)))}function b(r){return Math.min(1,Math.max(0,r))}function h(r){return s(r).toString(16).padStart(2,"0")}function v(r){return String(Number(r.toFixed(3)))}function S(r){let e=r.startsWith("#")?r.slice(1):r;if(!/^[0-9a-fA-F]+$/.test(e))return null;let t=a=>parseInt(a+a,16),n=a=>parseInt(a,16);switch(e.length){case 3:return {r:t(e[0]),g:t(e[1]),b:t(e[2]),a:1,format:"hex"};case 4:return {r:t(e[0]),g:t(e[1]),b:t(e[2]),a:t(e[3])/255,format:"hex"};case 6:return {r:n(e.slice(0,2)),g:n(e.slice(2,4)),b:n(e.slice(4,6)),a:1,format:"hex"};case 8:return {r:n(e.slice(0,2)),g:n(e.slice(2,4)),b:n(e.slice(4,6)),a:n(e.slice(6,8))/255,format:"hex"};default:return null}}function q(r){let e=r.trim().toLowerCase();if(e==="transparent")return {r:0,g:0,b:0,a:0,format:"named",name:"transparent"};let t=w[e];return t?{r:t[0],g:t[1],b:t[2],a:1,format:"named",name:e}:null}function _(r){let e=r.trim();if(e.startsWith("#")||/^[0-9a-fA-F]{3,8}$/.test(e)){let t=S(e);if(t)return t}return q(e)}function p(r,e,t){let n=r/255,a=e/255,u=t/255,l=Math.max(n,a,u),o=Math.min(n,a,u),i=(l+o)/2;if(l===o)return {h:0,s:0,l:i};let m=l-o,L=i>.5?m/(2-l-o):m/(l+o),c;return l===n?c=(a-u)/m+(a<u?6:0):l===a?c=(u-n)/m+2:c=(n-a)/m+4,{h:c*60,s:L,l:i}}function M(r,e,t){if(e===0){let o=s(t*255);return {r:o,g:o,b:o}}let n=t<.5?t*(1+e):t+e-t*e,a=2*t-n,u=(r%360+360)%360/360,l=o=>{let i=o;return i<0&&(i+=1),i>1&&(i-=1),i<1/6?a+(n-a)*6*i:i<1/2?n:i<2/3?a+(n-a)*(2/3-i)*6:a};return {r:s(l(u+1/3)*255),g:s(l(u)*255),b:s(l(u-1/3)*255)}}function A(r){let e=`#${h(r.r)}${h(r.g)}${h(r.b)}`;return r.a<1?`${e}${h(r.a*255)}`:e}function E(r){switch(r.format){case "rgb":return `rgb(${r.r}, ${r.g}, ${r.b})`;case "rgba":return `rgba(${r.r}, ${r.g}, ${r.b}, ${v(r.a)})`;case "hsl":{let{h:e,s:t,l:n}=p(r.r,r.g,r.b);return `hsl(${Math.round(e)}, ${Math.round(t*100)}%, ${Math.round(n*100)}%)`}case "hsla":{let{h:e,s:t,l:n}=p(r.r,r.g,r.b);return `hsla(${Math.round(e)}, ${Math.round(t*100)}%, ${Math.round(n*100)}%, ${v(r.a)})`}case "named":return r.name??A(r);default:return A(r)}}function d(r){let e=r/255;return e<=.03928?e/12.92:Math.pow((e+.055)/1.055,2.4)}function $(r){return .2126*d(r.r)+.7152*d(r.g)+.0722*d(r.b)}function C(r,e){let t=$(r)+.05,n=$(e)+.05;return t>n?t/n:n/t}function D(r,e){let t=r.format==="named"?"hex":r.format;return {r:e.r??r.r,g:e.g??r.g,b:e.b??r.b,a:e.a??r.a,format:t}}function g(r,e){let t=p(r.r,r.g,r.b);e(t);let{r:n,g:a,b:u}=M(t.h,t.s,t.l);return D(r,{r:n,g:a,b:u})}function O(r,e){return g(r,t=>t.l=b(t.l+e))}function I(r,e){return g(r,t=>t.l=b(t.l-e))}function j(r,e){return g(r,t=>t.s=b(t.s+e))}function N(r,e){return g(r,t=>t.s=b(t.s-e))}function R(r,e){return g(r,t=>t.h=((t.h+e)%360+360)%360)}function B(r){return R(r,180)}function G(r){let e=s(.299*r.r+.587*r.g+.114*r.b);return D(r,{r:e,g:e,b:e})}function U(r,e=1){let t=b(e);return D(r,{r:s(r.r+(255-2*r.r)*t),g:s(r.g+(255-2*r.g)*t),b:s(r.b+(255-2*r.b)*t)})}function x(r,e,t=.5){let n=b(t),a=(l,o)=>l*(1-n)+o*n,u=r.format==="named"?"hex":r.format;return {r:s(a(r.r,e.r)),g:s(a(r.g,e.g)),b:s(a(r.b,e.b)),a:b(a(r.a,e.a)),format:u}}function z(r,e){let t=b(e),n=r.format;return t<1&&(n==="rgb"?n="rgba":n==="hsl"?n="hsla":n==="named"&&(n="hex")),{r:r.r,g:r.g,b:r.b,a:t,format:n}}var y={r:255,g:255,b:255,a:1,format:"hex"},k={r:0,g:0,b:0,a:1,format:"hex"},F={r:128,g:128,b:128,a:1};function K(r,e,t){let n=(r%360+360)%360/60,a=t*e,u=a*(1-Math.abs(n%2-1)),l=t-a,o=0,i=0,m=0;return n<1?[o,i,m]=[a,u,0]:n<2?[o,i,m]=[u,a,0]:n<3?[o,i,m]=[0,a,u]:n<4?[o,i,m]=[0,u,a]:n<5?[o,i,m]=[u,0,a]:[o,i,m]=[a,0,u],{r:s((o+l)*255),g:s((i+l)*255),b:s((m+l)*255)}}function V(r,e,t){let n=b(e),a=b(t);if(n+a>=1){let o=s(n/(n+a)*255);return {r:o,g:o,b:o}}let u=M(r,1,.5),l=o=>s(o*(1-n-a)+n*255);return {r:l(u.r),g:l(u.g),b:l(u.b)}}function Y(r,e){return x(r,y,e)}function J(r,e){return x(r,k,e)}function P(r,e){return x(r,F,e)}function H(r){return C(r,y)>=C(r,k)}function Q(r){return H(r)?y:k}var f={aa:4.5,aaa:7,aaLarge:3,aaaLarge:4.5};function X(r,e){let t=C(r,e);return t>=f.aaa?"AAA":t>=f.aa?"AA":t>=f.aaLarge?"AA Large":"Fail"}exports.A=f;exports.B=X;exports.a=s;exports.b=b;exports.c=_;exports.d=p;exports.e=M;exports.f=A;exports.g=E;exports.h=$;exports.i=C;exports.j=O;exports.k=I;exports.l=j;exports.m=N;exports.n=R;exports.o=B;exports.p=G;exports.q=U;exports.r=x;exports.s=z;exports.t=K;exports.u=V;exports.v=Y;exports.w=J;exports.x=P;exports.y=H;exports.z=Q;//# sourceMappingURL=chunk-ESUN2THE.cjs.map
+//# sourceMappingURL=chunk-ESUN2THE.cjs.map

package/dist/chunk-ESUN2THE.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/packages/colour/CssNamedColours.ts","../src/packages/colour/ColourMath.ts"],"names":["CSS_NAMED_COLOURS","clamp255","x","clamp01","hexByte","n","formatAlpha","a","parseHex","input","s","dbl","h","pair","namedColour","name","key","rgb","parseColour","trimmed","hex","rgbToHsl","g","b","rn","gn","bn","max","min","l","d","hslToRgb","v","q","p","hn","hue","t","tt","toHexString","c","base","formatColour","linearise","channel8","cs","relativeLuminance","contrastRatio","la","lb","derive","next","format","adjustHsl","fn","hsl","r","lighten","amount","darken","saturate","desaturate","rotateHue","degrees","complement","grayscale","y","invert","mix","weight","lerp","withAlpha","alpha","WHITE","BLACK","MID_GREY","hsvToRgb","hh","m","hwbToRgb","w","wh","bl","grey","channel","ch","tint","shade","tone","isDark","readableColour","background","WCAG_THRESHOLDS","wcagLevel","ratio"],"mappings":"aASO,IAAMA,CAAAA,CAAiF,CAC7F,SAAA,CAAW,CAAC,IAAK,GAAA,CAAK,GAAG,CAAA,CACzB,YAAA,CAAc,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,EAC5B,IAAA,CAAM,CAAC,CAAA,CAAG,GAAA,CAAK,GAAG,CAAA,CAClB,UAAA,CAAY,CAAC,IAAK,GAAA,CAAK,GAAG,CAAA,CAC1B,KAAA,CAAO,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACrB,MAAO,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACrB,MAAA,CAAQ,CAAC,GAAA,CAAK,IAAK,GAAG,CAAA,CACtB,KAAA,CAAO,CAAC,CAAA,CAAG,CAAA,CAAG,CAAC,CAAA,CACf,eAAgB,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAC9B,IAAA,CAAM,CAAC,CAAA,CAAG,EAAG,GAAG,CAAA,CAChB,UAAA,CAAY,CAAC,IAAK,EAAA,CAAI,GAAG,CAAA,CACzB,KAAA,CAAO,CAAC,GAAA,CAAK,EAAA,CAAI,EAAE,CAAA,CACnB,SAAA,CAAW,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACzB,SAAA,CAAW,CAAC,EAAA,CAAI,GAAA,CAAK,GAAG,CAAA,CACxB,UAAA,CAAY,CAAC,GAAA,CAAK,GAAA,CAAK,CAAC,CAAA,CACxB,SAAA,CAAW,CAAC,GAAA,CAAK,GAAA,CAAK,EAAE,CAAA,CACxB,KAAA,CAAO,CAAC,GAAA,CAAK,IAAK,EAAE,CAAA,CACpB,cAAA,CAAgB,CAAC,IAAK,GAAA,CAAK,GAAG,CAAA,CAC9B,QAAA,CAAU,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,EACxB,OAAA,CAAS,CAAC,GAAA,CAAK,EAAA,CAAI,EAAE,CAAA,CACrB,IAAA,CAAM,CAAC,CAAA,CAAG,IAAK,GAAG,CAAA,CAClB,QAAA,CAAU,CAAC,CAAA,CAAG,CAAA,CAAG,GAAG,CAAA,CACpB,SAAU,CAAC,CAAA,CAAG,GAAA,CAAK,GAAG,EACtB,aAAA,CAAe,CAAC,GAAA,CAAK,GAAA,CAAK,EAAE,CAAA,CAC5B,QAAA,CAAU,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACxB,SAAA,CAAW,CAAC,CAAA,CAAG,GAAA,CAAK,CAAC,CAAA,CACrB,QAAA,CAAU,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACxB,SAAA,CAAW,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACzB,WAAA,CAAa,CAAC,GAAA,CAAK,CAAA,CAAG,GAAG,CAAA,CACzB,eAAgB,CAAC,EAAA,CAAI,GAAA,CAAK,EAAE,EAC5B,UAAA,CAAY,CAAC,GAAA,CAAK,GAAA,CAAK,CAAC,CAAA,CACxB,UAAA,CAAY,CAAC,IAAK,EAAA,CAAI,GAAG,CAAA,CACzB,OAAA,CAAS,CAAC,GAAA,CAAK,CAAA,CAAG,CAAC,CAAA,CACnB,WAAY,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAC1B,YAAA,CAAc,CAAC,GAAA,CAAK,IAAK,GAAG,CAAA,CAC5B,aAAA,CAAe,CAAC,GAAI,EAAA,CAAI,GAAG,CAAA,CAC3B,aAAA,CAAe,CAAC,EAAA,CAAI,EAAA,CAAI,EAAE,CAAA,CAC1B,aAAA,CAAe,CAAC,EAAA,CAAI,EAAA,CAAI,EAAE,CAAA,CAC1B,aAAA,CAAe,CAAC,CAAA,CAAG,GAAA,CAAK,GAAG,CAAA,CAC3B,UAAA,CAAY,CAAC,GAAA,CAAK,CAAA,CAAG,GAAG,CAAA,CACxB,QAAA,CAAU,CAAC,GAAA,CAAK,EAAA,CAAI,GAAG,CAAA,CACvB,WAAA,CAAa,CAAC,CAAA,CAAG,IAAK,GAAG,CAAA,CACzB,OAAA,CAAS,CAAC,IAAK,GAAA,CAAK,GAAG,CAAA,CACvB,OAAA,CAAS,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,EACvB,UAAA,CAAY,CAAC,EAAA,CAAI,GAAA,CAAK,GAAG,CAAA,CACzB,SAAA,CAAW,CAAC,GAAA,CAAK,GAAI,EAAE,CAAA,CACvB,WAAA,CAAa,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAC3B,YAAa,CAAC,EAAA,CAAI,GAAA,CAAK,EAAE,EACzB,OAAA,CAAS,CAAC,GAAA,CAAK,CAAA,CAAG,GAAG,CAAA,CACrB,SAAA,CAAW,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACzB,UAAA,CAAY,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAC1B,IAAA,CAAM,CAAC,GAAA,CAAK,GAAA,CAAK,CAAC,CAAA,CAClB,SAAA,CAAW,CAAC,GAAA,CAAK,GAAA,CAAK,EAAE,CAAA,CACxB,IAAA,CAAM,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACpB,MAAO,CAAC,CAAA,CAAG,GAAA,CAAK,CAAC,EACjB,WAAA,CAAa,CAAC,GAAA,CAAK,GAAA,CAAK,EAAE,CAAA,CAC1B,IAAA,CAAM,CAAC,IAAK,GAAA,CAAK,GAAG,CAAA,CACpB,QAAA,CAAU,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACxB,QAAS,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACvB,SAAA,CAAW,CAAC,GAAA,CAAK,GAAI,EAAE,CAAA,CACvB,MAAA,CAAQ,CAAC,GAAI,CAAA,CAAG,GAAG,CAAA,CACnB,KAAA,CAAO,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACrB,KAAA,CAAO,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACrB,QAAA,CAAU,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACxB,aAAA,CAAe,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAC7B,SAAA,CAAW,CAAC,GAAA,CAAK,GAAA,CAAK,CAAC,CAAA,CACvB,YAAA,CAAc,CAAC,GAAA,CAAK,IAAK,GAAG,CAAA,CAC5B,SAAA,CAAW,CAAC,IAAK,GAAA,CAAK,GAAG,CAAA,CACzB,UAAA,CAAY,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,EAC1B,SAAA,CAAW,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACzB,oBAAA,CAAsB,CAAC,GAAA,CAAK,IAAK,GAAG,CAAA,CACpC,SAAA,CAAW,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACzB,WAAY,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,EAC1B,SAAA,CAAW,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACzB,SAAA,CAAW,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACzB,WAAA,CAAa,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAC3B,aAAA,CAAe,CAAC,EAAA,CAAI,GAAA,CAAK,GAAG,CAAA,CAC5B,YAAA,CAAc,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAC5B,cAAA,CAAgB,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAC9B,eAAgB,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,EAC9B,cAAA,CAAgB,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAC9B,WAAA,CAAa,CAAC,IAAK,GAAA,CAAK,GAAG,CAAA,CAC3B,IAAA,CAAM,CAAC,CAAA,CAAG,GAAA,CAAK,CAAC,CAAA,CAChB,UAAW,CAAC,EAAA,CAAI,GAAA,CAAK,EAAE,CAAA,CACvB,KAAA,CAAO,CAAC,GAAA,CAAK,IAAK,GAAG,CAAA,CACrB,OAAA,CAAS,CAAC,IAAK,CAAA,CAAG,GAAG,CAAA,CACrB,MAAA,CAAQ,CAAC,GAAA,CAAK,CAAA,CAAG,CAAC,CAAA,CAClB,gBAAA,CAAkB,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAChC,UAAA,CAAY,CAAC,CAAA,CAAG,CAAA,CAAG,GAAG,CAAA,CACtB,YAAA,CAAc,CAAC,GAAA,CAAK,EAAA,CAAI,GAAG,CAAA,CAC3B,YAAA,CAAc,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAC5B,cAAA,CAAgB,CAAC,EAAA,CAAI,IAAK,GAAG,CAAA,CAC7B,eAAA,CAAiB,CAAC,IAAK,GAAA,CAAK,GAAG,CAAA,CAC/B,iBAAA,CAAmB,CAAC,CAAA,CAAG,GAAA,CAAK,GAAG,EAC/B,eAAA,CAAiB,CAAC,EAAA,CAAI,GAAA,CAAK,GAAG,CAAA,CAC9B,eAAA,CAAiB,CAAC,GAAA,CAAK,GAAI,GAAG,CAAA,CAC9B,YAAA,CAAc,CAAC,EAAA,CAAI,EAAA,CAAI,GAAG,CAAA,CAC1B,UAAW,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,EACzB,SAAA,CAAW,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACzB,QAAA,CAAU,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACxB,WAAA,CAAa,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAC3B,IAAA,CAAM,CAAC,CAAA,CAAG,CAAA,CAAG,GAAG,CAAA,CAChB,OAAA,CAAS,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACvB,KAAA,CAAO,CAAC,GAAA,CAAK,GAAA,CAAK,CAAC,CAAA,CACnB,UAAW,CAAC,GAAA,CAAK,GAAA,CAAK,EAAE,EACxB,MAAA,CAAQ,CAAC,GAAA,CAAK,GAAA,CAAK,CAAC,CAAA,CACpB,SAAA,CAAW,CAAC,IAAK,EAAA,CAAI,CAAC,CAAA,CACtB,MAAA,CAAQ,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,EACtB,aAAA,CAAe,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAC7B,SAAA,CAAW,CAAC,IAAK,GAAA,CAAK,GAAG,CAAA,CACzB,aAAA,CAAe,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAC7B,cAAe,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAC7B,UAAA,CAAY,CAAC,GAAA,CAAK,IAAK,GAAG,CAAA,CAC1B,SAAA,CAAW,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACzB,KAAM,CAAC,GAAA,CAAK,GAAA,CAAK,EAAE,CAAA,CACnB,IAAA,CAAM,CAAC,GAAA,CAAK,IAAK,GAAG,CAAA,CACpB,IAAA,CAAM,CAAC,IAAK,GAAA,CAAK,GAAG,CAAA,CACpB,UAAA,CAAY,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CAC1B,MAAA,CAAQ,CAAC,GAAA,CAAK,CAAA,CAAG,GAAG,CAAA,CACpB,aAAA,CAAe,CAAC,GAAA,CAAK,GAAI,GAAG,CAAA,CAC5B,GAAA,CAAK,CAAC,IAAK,CAAA,CAAG,CAAC,CAAA,CACf,SAAA,CAAW,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,EACzB,SAAA,CAAW,CAAC,EAAA,CAAI,GAAA,CAAK,GAAG,CAAA,CACxB,WAAA,CAAa,CAAC,GAAA,CAAK,GAAI,EAAE,CAAA,CACzB,MAAA,CAAQ,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACtB,WAAY,CAAC,GAAA,CAAK,GAAA,CAAK,EAAE,CAAA,CACzB,QAAA,CAAU,CAAC,EAAA,CAAI,IAAK,EAAE,CAAA,CACtB,QAAA,CAAU,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACxB,OAAQ,CAAC,GAAA,CAAK,EAAA,CAAI,EAAE,EACpB,MAAA,CAAQ,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACtB,OAAA,CAAS,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACvB,SAAA,CAAW,CAAC,GAAA,CAAK,EAAA,CAAI,GAAG,CAAA,CACxB,UAAW,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,EACzB,SAAA,CAAW,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACzB,IAAA,CAAM,CAAC,IAAK,GAAA,CAAK,GAAG,CAAA,CACpB,WAAA,CAAa,CAAC,CAAA,CAAG,GAAA,CAAK,GAAG,CAAA,CACzB,UAAW,CAAC,EAAA,CAAI,GAAA,CAAK,GAAG,CAAA,CACxB,GAAA,CAAK,CAAC,GAAA,CAAK,IAAK,GAAG,CAAA,CACnB,IAAA,CAAM,CAAC,CAAA,CAAG,GAAA,CAAK,GAAG,CAAA,CAClB,QAAS,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACvB,MAAA,CAAQ,CAAC,GAAA,CAAK,GAAI,EAAE,CAAA,CACpB,SAAA,CAAW,CAAC,GAAI,GAAA,CAAK,GAAG,CAAA,CACxB,MAAA,CAAQ,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACtB,KAAA,CAAO,CAAC,GAAA,CAAK,GAAA,CAAK,GAAG,CAAA,CACrB,KAAA,CAAO,CAAC,GAAA,CAAK,IAAK,GAAG,CAAA,CACrB,UAAA,CAAY,CAAC,IAAK,GAAA,CAAK,GAAG,CAAA,CAC1B,MAAA,CAAQ,CAAC,GAAA,CAAK,GAAA,CAAK,CAAC,EACpB,WAAA,CAAa,CAAC,GAAA,CAAK,GAAA,CAAK,EAAE,CAC3B,CAAA,CClJO,SAASC,CAAAA,CAASC,EAAmB,CAC3C,OAAO,IAAA,CAAK,GAAA,CAAI,GAAA,CAAK,IAAA,CAAK,GAAA,CAAI,CAAA,CAAG,KAAK,KAAA,CAAMA,CAAC,CAAC,CAAC,CAChD,CAGO,SAASC,CAAAA,CAAQD,EAAmB,CAC1C,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,CAAG,IAAA,CAAK,GAAA,CAAI,CAAA,CAAGA,CAAC,CAAC,CAClC,CAEA,SAASE,EAAQC,CAAAA,CAAmB,CACnC,OAAOJ,CAAAA,CAASI,CAAC,CAAA,CAAE,QAAA,CAAS,EAAE,CAAA,CAAE,QAAA,CAAS,CAAA,CAAG,GAAG,CAChD,CAMA,SAASC,CAAAA,CAAYC,CAAAA,CAAmB,CACvC,OAAO,MAAA,CAAO,MAAA,CAAOA,CAAAA,CAAE,OAAA,CAAQ,CAAC,CAAC,CAAC,CACnC,CAUO,SAASC,CAAAA,CAASC,CAAAA,CAAkC,CAC1D,IAAMC,CAAAA,CAAID,CAAAA,CAAM,UAAA,CAAW,GAAG,EAAIA,CAAAA,CAAM,KAAA,CAAM,CAAC,CAAA,CAAIA,EACnD,GAAI,CAAC,gBAAA,CAAiB,IAAA,CAAKC,CAAC,CAAA,CAAG,OAAO,IAAA,CACtC,IAAMC,CAAAA,CAAOC,CAAAA,EAAsB,QAAA,CAASA,CAAAA,CAAIA,CAAAA,CAAG,EAAE,CAAA,CAC/CC,CAAAA,CAAQD,GAAsB,QAAA,CAASA,CAAAA,CAAG,EAAE,CAAA,CAClD,OAAQF,CAAAA,CAAE,MAAA,EACT,KAAK,CAAA,CACJ,OAAO,CAAE,CAAA,CAAGC,EAAID,CAAAA,CAAE,CAAC,CAAC,CAAA,CAAG,EAAGC,CAAAA,CAAID,CAAAA,CAAE,CAAC,CAAC,CAAA,CAAG,CAAA,CAAGC,CAAAA,CAAID,CAAAA,CAAE,CAAC,CAAC,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,OAAQ,KAAM,CAAA,CACxE,KAAK,CAAA,CACJ,OAAO,CAAE,CAAA,CAAGC,CAAAA,CAAID,CAAAA,CAAE,CAAC,CAAC,CAAA,CAAG,CAAA,CAAGC,EAAID,CAAAA,CAAE,CAAC,CAAC,CAAA,CAAG,EAAGC,CAAAA,CAAID,CAAAA,CAAE,CAAC,CAAC,EAAG,CAAA,CAAGC,CAAAA,CAAID,CAAAA,CAAE,CAAC,CAAC,CAAA,CAAI,GAAA,CAAK,MAAA,CAAQ,KAAM,CAAA,CACtF,KAAK,CAAA,CACJ,OAAO,CAAE,CAAA,CAAGG,CAAAA,CAAKH,CAAAA,CAAE,MAAM,CAAA,CAAG,CAAC,CAAC,CAAA,CAAG,CAAA,CAAGG,CAAAA,CAAKH,CAAAA,CAAE,KAAA,CAAM,EAAG,CAAC,CAAC,CAAA,CAAG,CAAA,CAAGG,EAAKH,CAAAA,CAAE,KAAA,CAAM,CAAA,CAAG,CAAC,CAAC,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,MAAA,CAAQ,KAAM,CAAA,CACtG,KAAK,CAAA,CACJ,OAAO,CACN,CAAA,CAAGG,CAAAA,CAAKH,CAAAA,CAAE,MAAM,CAAA,CAAG,CAAC,CAAC,CAAA,CACrB,EAAGG,CAAAA,CAAKH,CAAAA,CAAE,KAAA,CAAM,CAAA,CAAG,CAAC,CAAC,CAAA,CACrB,CAAA,CAAGG,EAAKH,CAAAA,CAAE,KAAA,CAAM,CAAA,CAAG,CAAC,CAAC,CAAA,CACrB,CAAA,CAAGG,CAAAA,CAAKH,CAAAA,CAAE,MAAM,CAAA,CAAG,CAAC,CAAC,CAAA,CAAI,GAAA,CACzB,MAAA,CAAQ,KACT,CAAA,CACD,QACC,OAAO,IACT,CACD,CAMO,SAASI,CAAAA,CAAYC,CAAAA,CAAiC,CAC5D,IAAMC,CAAAA,CAAMD,CAAAA,CAAK,IAAA,EAAK,CAAE,WAAA,EAAY,CACpC,GAAIC,CAAAA,GAAQ,cAAe,OAAO,CAAE,CAAA,CAAG,CAAA,CAAG,EAAG,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,EAAG,MAAA,CAAQ,OAAA,CAAS,IAAA,CAAM,aAAc,CAAA,CACjG,IAAMC,CAAAA,CAAMjB,CAAAA,CAAkBgB,CAAG,CAAA,CACjC,OAAKC,CAAAA,CACE,CAAE,EAAGA,CAAAA,CAAI,CAAC,CAAA,CAAG,CAAA,CAAGA,EAAI,CAAC,CAAA,CAAG,CAAA,CAAGA,CAAAA,CAAI,CAAC,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,OAAQ,OAAA,CAAS,IAAA,CAAMD,CAAI,CAAA,CAD1D,IAElB,CAGO,SAASE,CAAAA,CAAYT,CAAAA,CAAkC,CAC7D,IAAMU,CAAAA,CAAUV,CAAAA,CAAM,IAAA,EAAK,CAC3B,GAAIU,CAAAA,CAAQ,UAAA,CAAW,GAAG,CAAA,EAAK,oBAAA,CAAqB,IAAA,CAAKA,CAAO,CAAA,CAAG,CAClE,IAAMC,CAAAA,CAAMZ,EAASW,CAAO,CAAA,CAC5B,GAAIC,CAAAA,CAAK,OAAOA,CACjB,CACA,OAAON,EAAYK,CAAO,CAC3B,CAKO,SAASE,EAAS,CAAA,CAAWC,CAAAA,CAAWC,CAAAA,CAAgD,CAC9F,IAAMC,CAAAA,CAAK,CAAA,CAAI,GAAA,CACTC,CAAAA,CAAKH,CAAAA,CAAI,GAAA,CACTI,CAAAA,CAAKH,CAAAA,CAAI,IACTI,CAAAA,CAAM,IAAA,CAAK,GAAA,CAAIH,CAAAA,CAAIC,CAAAA,CAAIC,CAAE,CAAA,CACzBE,CAAAA,CAAM,KAAK,GAAA,CAAIJ,CAAAA,CAAIC,CAAAA,CAAIC,CAAE,CAAA,CACzBG,CAAAA,CAAAA,CAAKF,CAAAA,CAAMC,CAAAA,EAAO,EACxB,GAAID,CAAAA,GAAQC,CAAAA,CAAK,OAAO,CAAE,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,EAAAC,CAAE,CAAA,CACxC,IAAMC,CAAAA,CAAIH,CAAAA,CAAMC,CAAAA,CACVlB,CAAAA,CAAImB,CAAAA,CAAI,GAAMC,CAAAA,EAAK,CAAA,CAAIH,CAAAA,CAAMC,CAAAA,CAAAA,CAAOE,CAAAA,EAAKH,CAAAA,CAAMC,CAAAA,CAAAA,CACjDhB,CAAAA,CACJ,OAAIe,CAAAA,GAAQH,CAAAA,CAAIZ,CAAAA,CAAAA,CAAKa,CAAAA,CAAKC,CAAAA,EAAMI,CAAAA,EAAKL,CAAAA,CAAKC,CAAAA,CAAK,EAAI,CAAA,CAAA,CAC1CC,CAAAA,GAAQF,CAAAA,CAAIb,CAAAA,CAAAA,CAAKc,EAAKF,CAAAA,EAAMM,CAAAA,CAAI,CAAA,CACpClB,CAAAA,CAAAA,CAAKY,EAAKC,CAAAA,EAAMK,CAAAA,CAAI,CAAA,CAClB,CAAE,CAAA,CAAGlB,CAAAA,CAAI,EAAA,CAAI,CAAA,CAAAF,EAAG,CAAA,CAAAmB,CAAE,CAC1B,CAGO,SAASE,CAAAA,CAASnB,CAAAA,CAAWF,CAAAA,CAAWmB,CAAAA,CAAgD,CAC9F,GAAInB,CAAAA,GAAM,CAAA,CAAG,CACZ,IAAMsB,CAAAA,CAAI/B,CAAAA,CAAS4B,CAAAA,CAAI,GAAG,CAAA,CAC1B,OAAO,CAAE,CAAA,CAAGG,EAAG,CAAA,CAAGA,CAAAA,CAAG,CAAA,CAAGA,CAAE,CAC3B,CACA,IAAMC,CAAAA,CAAIJ,CAAAA,CAAI,EAAA,CAAMA,CAAAA,EAAK,CAAA,CAAInB,CAAAA,CAAAA,CAAKmB,EAAInB,CAAAA,CAAImB,CAAAA,CAAInB,CAAAA,CACxCwB,CAAAA,CAAI,CAAA,CAAIL,CAAAA,CAAII,CAAAA,CACZE,CAAAA,CAAAA,CAAQvB,EAAI,GAAA,CAAO,GAAA,EAAO,GAAA,CAAO,GAAA,CACjCwB,CAAAA,CAAOC,CAAAA,EAAsB,CAClC,IAAIC,EAAKD,CAAAA,CAGT,OAFIC,CAAAA,CAAK,CAAA,GAAGA,GAAM,CAAA,CAAA,CACdA,CAAAA,CAAK,CAAA,GAAGA,CAAAA,EAAM,GACdA,CAAAA,CAAK,CAAA,CAAI,CAAA,CAAUJ,CAAAA,CAAAA,CAAKD,CAAAA,CAAIC,CAAAA,EAAK,CAAA,CAAII,CAAAA,CACrCA,EAAK,CAAA,CAAI,CAAA,CAAUL,CAAAA,CACnBK,CAAAA,CAAK,EAAI,CAAA,CAAUJ,CAAAA,CAAAA,CAAKD,CAAAA,CAAIC,CAAAA,GAAM,EAAI,CAAA,CAAII,CAAAA,CAAAA,CAAM,CAAA,CAC7CJ,CACR,CAAA,CACA,OAAO,CACN,CAAA,CAAGjC,EAASmC,CAAAA,CAAID,CAAAA,CAAK,CAAA,CAAI,CAAC,EAAI,GAAG,CAAA,CACjC,CAAA,CAAGlC,CAAAA,CAASmC,EAAID,CAAE,CAAA,CAAI,GAAG,CAAA,CACzB,CAAA,CAAGlC,CAAAA,CAASmC,CAAAA,CAAID,CAAAA,CAAK,EAAI,CAAC,CAAA,CAAI,GAAG,CAClC,CACD,CAKO,SAASI,CAAAA,CAAYC,EAAuB,CAClD,IAAMC,CAAAA,CAAO,CAAA,CAAA,EAAIrC,CAAAA,CAAQoC,CAAAA,CAAE,CAAC,CAAC,GAAGpC,CAAAA,CAAQoC,CAAAA,CAAE,CAAC,CAAC,GAAGpC,CAAAA,CAAQoC,CAAAA,CAAE,CAAC,CAAC,GAC3D,OAAOA,CAAAA,CAAE,CAAA,CAAI,CAAA,CAAI,CAAA,EAAGC,CAAI,CAAA,EAAGrC,CAAAA,CAAQoC,EAAE,CAAA,CAAI,GAAG,CAAC,CAAA,CAAA,CAAKC,CACnD,CAOO,SAASC,CAAAA,CAAaF,CAAAA,CAAuB,CACnD,OAAQA,CAAAA,CAAE,MAAA,EACT,KAAK,KAAA,CACJ,OAAO,CAAA,IAAA,EAAOA,EAAE,CAAC,CAAA,EAAA,EAAKA,CAAAA,CAAE,CAAC,KAAKA,CAAAA,CAAE,CAAC,CAAA,CAAA,CAAA,CAClC,KAAK,OACJ,OAAO,CAAA,KAAA,EAAQA,CAAAA,CAAE,CAAC,CAAA,EAAA,EAAKA,CAAAA,CAAE,CAAC,CAAA,EAAA,EAAKA,EAAE,CAAC,CAAA,EAAA,EAAKlC,CAAAA,CAAYkC,CAAAA,CAAE,CAAC,CAAC,CAAA,CAAA,CAAA,CACxD,KAAK,MAAO,CACX,GAAM,CAAE,CAAA,CAAA5B,CAAAA,CAAG,CAAA,CAAAF,CAAAA,CAAG,CAAA,CAAAmB,CAAE,CAAA,CAAIR,CAAAA,CAASmB,CAAAA,CAAE,CAAA,CAAGA,EAAE,CAAA,CAAGA,CAAAA,CAAE,CAAC,CAAA,CAC1C,OAAO,CAAA,IAAA,EAAO,IAAA,CAAK,KAAA,CAAM5B,CAAC,CAAC,CAAA,EAAA,EAAK,IAAA,CAAK,KAAA,CAAMF,EAAI,GAAG,CAAC,CAAA,GAAA,EAAM,IAAA,CAAK,MAAMmB,CAAAA,CAAI,GAAG,CAAC,CAAA,EAAA,CAC7E,CACA,KAAK,MAAA,CAAQ,CACZ,GAAM,CAAE,CAAA,CAAAjB,CAAAA,CAAG,CAAA,CAAAF,EAAG,CAAA,CAAAmB,CAAE,CAAA,CAAIR,CAAAA,CAASmB,EAAE,CAAA,CAAGA,CAAAA,CAAE,CAAA,CAAGA,CAAAA,CAAE,CAAC,CAAA,CAC1C,OAAO,CAAA,KAAA,EAAQ,IAAA,CAAK,KAAA,CAAM5B,CAAC,CAAC,CAAA,EAAA,EAAK,KAAK,KAAA,CAAMF,CAAAA,CAAI,GAAG,CAAC,CAAA,GAAA,EAAM,IAAA,CAAK,KAAA,CAAMmB,CAAAA,CAAI,GAAG,CAAC,CAAA,GAAA,EAAMvB,CAAAA,CAAYkC,CAAAA,CAAE,CAAC,CAAC,CAAA,CAAA,CACpG,CACA,KAAK,OAAA,CACJ,OAAOA,CAAAA,CAAE,IAAA,EAAQD,EAAYC,CAAC,CAAA,CAE/B,QACC,OAAOD,EAAYC,CAAC,CACtB,CACD,CAIA,SAASG,CAAAA,CAAUC,CAAAA,CAA0B,CAC5C,IAAMC,CAAAA,CAAKD,CAAAA,CAAW,GAAA,CACtB,OAAOC,GAAM,MAAA,CAAUA,CAAAA,CAAK,KAAA,CAAQ,IAAA,CAAK,KAAKA,CAAAA,CAAK,IAAA,EAAS,KAAA,CAAO,GAAG,CACvE,CAGO,SAASC,CAAAA,CAAkBN,EAAuB,CACxD,OAAO,KAAA,CAASG,CAAAA,CAAUH,EAAE,CAAC,CAAA,CAAI,KAAA,CAASG,CAAAA,CAAUH,EAAE,CAAC,CAAA,CAAI,KAAA,CAASG,CAAAA,CAAUH,CAAAA,CAAE,CAAC,CAClF,CAGO,SAASO,CAAAA,CAAcxC,CAAAA,CAAegB,CAAAA,CAAuB,CACnE,IAAMyB,CAAAA,CAAKF,CAAAA,CAAkBvC,CAAC,EAAI,GAAA,CAC5B0C,CAAAA,CAAKH,CAAAA,CAAkBvB,CAAC,CAAA,CAAI,GAAA,CAClC,OAAOyB,CAAAA,CAAKC,EAAKD,CAAAA,CAAKC,CAAAA,CAAKA,CAAAA,CAAKD,CACjC,CASA,SAASE,CAAAA,CAAOV,CAAAA,CAAeW,CAAAA,CAAsE,CACpG,IAAMC,CAAAA,CAAuBZ,CAAAA,CAAE,MAAA,GAAW,OAAA,CAAU,KAAA,CAAQA,CAAAA,CAAE,MAAA,CAC9D,OAAO,CACN,CAAA,CAAGW,CAAAA,CAAK,CAAA,EAAKX,EAAE,CAAA,CACf,CAAA,CAAGW,CAAAA,CAAK,CAAA,EAAKX,EAAE,CAAA,CACf,CAAA,CAAGW,CAAAA,CAAK,CAAA,EAAKX,CAAAA,CAAE,CAAA,CACf,CAAA,CAAGW,CAAAA,CAAK,GAAKX,CAAAA,CAAE,CAAA,CACf,MAAA,CAAAY,CACD,CACD,CAEA,SAASC,CAAAA,CAAUb,CAAAA,CAAec,EAAoE,CACrG,IAAMC,CAAAA,CAAMlC,CAAAA,CAASmB,CAAAA,CAAE,CAAA,CAAGA,CAAAA,CAAE,CAAA,CAAGA,EAAE,CAAC,CAAA,CAClCc,CAAAA,CAAGC,CAAG,CAAA,CACN,GAAM,CAAE,CAAA,CAAAC,EAAG,CAAA,CAAAlC,CAAAA,CAAG,CAAA,CAAAC,CAAE,CAAA,CAAIQ,CAAAA,CAASwB,CAAAA,CAAI,CAAA,CAAGA,EAAI,CAAA,CAAGA,CAAAA,CAAI,CAAC,CAAA,CAChD,OAAOL,CAAAA,CAAOV,CAAAA,CAAG,CAAE,CAAA,CAAAgB,EAAG,CAAA,CAAAlC,CAAAA,CAAG,CAAA,CAAAC,CAAE,CAAC,CAC7B,CAGO,SAASkC,EAAQjB,CAAAA,CAAekB,CAAAA,CAA4B,CAClE,OAAOL,EAAUb,CAAAA,CAAIe,CAAAA,EAASA,CAAAA,CAAI,CAAA,CAAIpD,EAAQoD,CAAAA,CAAI,CAAA,CAAIG,CAAM,CAAE,CAC/D,CAGO,SAASC,CAAAA,CAAOnB,EAAekB,CAAAA,CAA4B,CACjE,OAAOL,CAAAA,CAAUb,EAAIe,CAAAA,EAASA,CAAAA,CAAI,CAAA,CAAIpD,CAAAA,CAAQoD,EAAI,CAAA,CAAIG,CAAM,CAAE,CAC/D,CAGO,SAASE,CAAAA,CAASpB,CAAAA,CAAekB,EAA4B,CACnE,OAAOL,CAAAA,CAAUb,CAAAA,CAAIe,CAAAA,EAASA,CAAAA,CAAI,CAAA,CAAIpD,CAAAA,CAAQoD,EAAI,CAAA,CAAIG,CAAM,CAAE,CAC/D,CAGO,SAASG,CAAAA,CAAWrB,CAAAA,CAAekB,EAA4B,CACrE,OAAOL,CAAAA,CAAUb,CAAAA,CAAIe,GAASA,CAAAA,CAAI,CAAA,CAAIpD,CAAAA,CAAQoD,CAAAA,CAAI,EAAIG,CAAM,CAAE,CAC/D,CAGO,SAASI,CAAAA,CAAUtB,CAAAA,CAAeuB,CAAAA,CAA6B,CACrE,OAAOV,CAAAA,CAAUb,CAAAA,CAAIe,CAAAA,EAASA,CAAAA,CAAI,CAAA,CAAA,CAAA,CAAMA,CAAAA,CAAI,CAAA,CAAIQ,GAAW,GAAA,CAAM,GAAA,EAAO,GAAI,CAC7E,CAGO,SAASC,CAAAA,CAAWxB,CAAAA,CAA2B,CACrD,OAAOsB,CAAAA,CAAUtB,CAAAA,CAAG,GAAG,CACxB,CAGO,SAASyB,CAAAA,CAAUzB,CAAAA,CAA2B,CACpD,IAAM0B,CAAAA,CAAIjE,CAAAA,CAAS,IAAA,CAAQuC,CAAAA,CAAE,CAAA,CAAI,IAAA,CAAQA,CAAAA,CAAE,EAAI,IAAA,CAAQA,CAAAA,CAAE,CAAC,CAAA,CAC1D,OAAOU,CAAAA,CAAOV,CAAAA,CAAG,CAAE,EAAG0B,CAAAA,CAAG,CAAA,CAAGA,CAAAA,CAAG,CAAA,CAAGA,CAAE,CAAC,CACtC,CAGO,SAASC,CAAAA,CAAO3B,CAAAA,CAAekB,CAAAA,CAAS,CAAA,CAAe,CAC7D,IAAM,CAAA,CAAIvD,CAAAA,CAAQuD,CAAM,EACxB,OAAOR,CAAAA,CAAOV,CAAAA,CAAG,CAChB,CAAA,CAAGvC,CAAAA,CAASuC,CAAAA,CAAE,CAAA,CAAA,CAAK,IAAM,CAAA,CAAIA,CAAAA,CAAE,CAAA,EAAK,CAAC,EACrC,CAAA,CAAGvC,CAAAA,CAASuC,CAAAA,CAAE,CAAA,CAAA,CAAK,IAAM,CAAA,CAAIA,CAAAA,CAAE,CAAA,EAAK,CAAC,CAAA,CACrC,CAAA,CAAGvC,CAAAA,CAASuC,CAAAA,CAAE,GAAK,GAAA,CAAM,CAAA,CAAIA,CAAAA,CAAE,CAAA,EAAK,CAAC,CACtC,CAAC,CACF,CAOO,SAAS4B,CAAAA,CAAI7D,CAAAA,CAAegB,CAAAA,CAAe8C,CAAAA,CAAS,EAAA,CAAiB,CAC3E,IAAMhC,CAAAA,CAAIlC,EAAQkE,CAAM,CAAA,CAClBC,CAAAA,CAAO,CAACpE,CAAAA,CAAWgE,CAAAA,GAAsBhE,CAAAA,EAAK,CAAA,CAAImC,GAAK6B,CAAAA,CAAI7B,CAAAA,CAC3De,CAAAA,CAAuB7C,CAAAA,CAAE,MAAA,GAAW,OAAA,CAAU,KAAA,CAAQA,CAAAA,CAAE,OAC9D,OAAO,CACN,CAAA,CAAGN,CAAAA,CAASqE,EAAK/D,CAAAA,CAAE,CAAA,CAAGgB,CAAAA,CAAE,CAAC,CAAC,CAAA,CAC1B,CAAA,CAAGtB,CAAAA,CAASqE,CAAAA,CAAK/D,CAAAA,CAAE,CAAA,CAAGgB,CAAAA,CAAE,CAAC,CAAC,CAAA,CAC1B,CAAA,CAAGtB,CAAAA,CAASqE,CAAAA,CAAK/D,EAAE,CAAA,CAAGgB,CAAAA,CAAE,CAAC,CAAC,EAC1B,CAAA,CAAGpB,CAAAA,CAAQmE,CAAAA,CAAK/D,CAAAA,CAAE,CAAA,CAAGgB,CAAAA,CAAE,CAAC,CAAC,EACzB,MAAA,CAAA6B,CACD,CACD,CAGO,SAASmB,CAAAA,CAAU/B,CAAAA,CAAegC,CAAAA,CAA2B,CACnE,IAAMjE,CAAAA,CAAIJ,CAAAA,CAAQqE,CAAK,CAAA,CACnBpB,CAAAA,CAAuBZ,CAAAA,CAAE,MAAA,CAC7B,OAAIjC,EAAI,CAAA,GACH6C,CAAAA,GAAW,KAAA,CAAOA,CAAAA,CAAS,MAAA,CACtBA,CAAAA,GAAW,KAAA,CAAOA,CAAAA,CAAS,OAC3BA,CAAAA,GAAW,OAAA,GAASA,CAAAA,CAAS,KAAA,CAAA,CAAA,CAEhC,CAAE,CAAA,CAAGZ,CAAAA,CAAE,CAAA,CAAG,EAAGA,CAAAA,CAAE,CAAA,CAAG,CAAA,CAAGA,CAAAA,CAAE,EAAG,CAAA,CAAAjC,CAAAA,CAAG,MAAA,CAAA6C,CAAO,CAC5C,CAKA,IAAMqB,CAAAA,CAAoB,CAAE,CAAA,CAAG,GAAA,CAAK,CAAA,CAAG,GAAA,CAAK,EAAG,GAAA,CAAK,CAAA,CAAG,CAAA,CAAG,MAAA,CAAQ,KAAM,CAAA,CAClEC,CAAAA,CAAoB,CAAE,CAAA,CAAG,EAAG,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,CAAA,CAAG,MAAA,CAAQ,KAAM,EAC5DC,CAAAA,CAAuB,CAAE,CAAA,CAAG,GAAA,CAAK,EAAG,GAAA,CAAK,CAAA,CAAG,GAAA,CAAK,CAAA,CAAG,CAAiB,CAAA,CAQpE,SAASC,CAAAA,CAAShE,CAAAA,CAAWF,CAAAA,CAAWsB,CAAAA,CAAgD,CAC9F,IAAM6C,CAAAA,CAAAA,CAASjE,CAAAA,CAAI,GAAA,CAAO,GAAA,EAAO,GAAA,CAAQ,EAAA,CACnC4B,CAAAA,CAAIR,EAAItB,CAAAA,CACRR,CAAAA,CAAIsC,CAAAA,EAAK,CAAA,CAAI,IAAA,CAAK,GAAA,CAAKqC,CAAAA,CAAK,CAAA,CAAK,CAAC,CAAA,CAAA,CAClCC,CAAAA,CAAI9C,CAAAA,CAAIQ,CAAAA,CACVgB,EAAI,CAAA,CACJlC,CAAAA,CAAI,CAAA,CACJC,CAAAA,CAAI,EACR,OAAIsD,CAAAA,CAAK,CAAA,CAAG,CAACrB,CAAAA,CAAGlC,CAAAA,CAAGC,CAAC,CAAA,CAAI,CAACiB,CAAAA,CAAGtC,CAAAA,CAAG,CAAC,CAAA,CACvB2E,EAAK,CAAA,CAAG,CAACrB,CAAAA,CAAGlC,CAAAA,CAAGC,CAAC,CAAA,CAAI,CAACrB,CAAAA,CAAGsC,CAAAA,CAAG,CAAC,CAAA,CAC5BqC,CAAAA,CAAK,CAAA,CAAG,CAACrB,CAAAA,CAAGlC,CAAAA,CAAGC,CAAC,CAAA,CAAI,CAAC,CAAA,CAAGiB,CAAAA,CAAGtC,CAAC,CAAA,CAC5B2E,EAAK,CAAA,CAAG,CAACrB,CAAAA,CAAGlC,CAAAA,CAAGC,CAAC,CAAA,CAAI,CAAC,CAAA,CAAGrB,EAAGsC,CAAC,CAAA,CAC5BqC,CAAAA,CAAK,CAAA,CAAG,CAACrB,CAAAA,CAAGlC,CAAAA,CAAGC,CAAC,EAAI,CAACrB,CAAAA,CAAG,CAAA,CAAGsC,CAAC,CAAA,CAChC,CAACgB,CAAAA,CAAGlC,CAAAA,CAAGC,CAAC,CAAA,CAAI,CAACiB,CAAAA,CAAG,CAAA,CAAGtC,CAAC,CAAA,CAClB,CAAE,CAAA,CAAGD,CAAAA,CAAAA,CAAUuD,EAAIsB,CAAAA,EAAK,GAAG,CAAA,CAAG,CAAA,CAAG7E,CAAAA,CAAAA,CAAUqB,CAAAA,CAAIwD,CAAAA,EAAK,GAAG,EAAG,CAAA,CAAG7E,CAAAA,CAAAA,CAAUsB,CAAAA,CAAIuD,CAAAA,EAAK,GAAG,CAAE,CAC7F,CAOO,SAASC,EAASnE,CAAAA,CAAWoE,CAAAA,CAAWzD,CAAAA,CAAgD,CAC9F,IAAM0D,CAAAA,CAAK9E,CAAAA,CAAQ6E,CAAC,EACdE,CAAAA,CAAK/E,CAAAA,CAAQoB,CAAC,CAAA,CACpB,GAAI0D,CAAAA,CAAKC,CAAAA,EAAM,CAAA,CAAG,CACjB,IAAMC,CAAAA,CAAOlF,CAAAA,CAAUgF,CAAAA,EAAMA,CAAAA,CAAKC,CAAAA,CAAAA,CAAO,GAAG,CAAA,CAC5C,OAAO,CAAE,CAAA,CAAGC,CAAAA,CAAM,CAAA,CAAGA,CAAAA,CAAM,CAAA,CAAGA,CAAK,CACpC,CACA,IAAM1C,CAAAA,CAAOV,CAAAA,CAASnB,CAAAA,CAAG,CAAA,CAAG,EAAG,CAAA,CACzBwE,CAAAA,CAAWC,CAAAA,EAAuBpF,EAASoF,CAAAA,EAAM,CAAA,CAAIJ,CAAAA,CAAKC,CAAAA,CAAAA,CAAMD,EAAK,GAAG,CAAA,CAC9E,OAAO,CAAE,EAAGG,CAAAA,CAAQ3C,CAAAA,CAAK,CAAC,CAAA,CAAG,CAAA,CAAG2C,CAAAA,CAAQ3C,CAAAA,CAAK,CAAC,EAAG,CAAA,CAAG2C,CAAAA,CAAQ3C,CAAAA,CAAK,CAAC,CAAE,CACrE,CAGO,SAAS6C,CAAAA,CAAK9C,EAAekB,CAAAA,CAA4B,CAC/D,OAAOU,CAAAA,CAAI5B,CAAAA,CAAGiC,CAAAA,CAAOf,CAAM,CAC5B,CAGO,SAAS6B,CAAAA,CAAM/C,CAAAA,CAAekB,CAAAA,CAA4B,CAChE,OAAOU,CAAAA,CAAI5B,CAAAA,CAAGkC,CAAAA,CAAOhB,CAAM,CAC5B,CAGO,SAAS8B,CAAAA,CAAKhD,CAAAA,CAAekB,CAAAA,CAA4B,CAC/D,OAAOU,EAAI5B,CAAAA,CAAGmC,CAAAA,CAAUjB,CAAM,CAC/B,CAOO,SAAS+B,CAAAA,CAAOjD,CAAAA,CAAwB,CAC9C,OAAOO,CAAAA,CAAcP,CAAAA,CAAGiC,CAAK,CAAA,EAAK1B,CAAAA,CAAcP,CAAAA,CAAGkC,CAAK,CACzD,CAGO,SAASgB,CAAAA,CAAeC,CAAAA,CAAoC,CAClE,OAAOF,CAAAA,CAAOE,CAAU,CAAA,CAAIlB,EAAQC,CACrC,CAMO,IAAMkB,CAAAA,CAAkB,CAAE,EAAA,CAAI,GAAA,CAAK,GAAA,CAAK,EAAG,OAAA,CAAS,CAAA,CAAG,QAAA,CAAU,GAAI,EAUrE,SAASC,CAAAA,CAAUtF,CAAAA,CAAegB,CAAAA,CAA0B,CAClE,IAAMuE,CAAAA,CAAQ/C,CAAAA,CAAcxC,CAAAA,CAAGgB,CAAC,CAAA,CAChC,OAAIuE,CAAAA,EAASF,EAAgB,GAAA,CAAY,KAAA,CACrCE,CAAAA,EAASF,CAAAA,CAAgB,GAAW,IAAA,CACpCE,CAAAA,EAASF,CAAAA,CAAgB,OAAA,CAAgB,WACtC,MACR","file":"chunk-ESUN2THE.cjs","sourcesContent":["/**\n * The complete CSS Color Module Level 4 named-colour set, as canonical sRGB\n * `[r, g, b]` triples (0-255). These are the same values every browser resolves\n * a keyword to, so `color(\"rebeccapurple\")` matches what the page would render.\n *\n * `transparent` is handled by the caller (it is `rgba(0, 0, 0, 0)`, an alpha the\n * triples here cannot express) and `currentColor` is deliberately absent: it is\n * context-dependent, not a fixed colour.\n */\nexport const CSS_NAMED_COLOURS: Readonly<Record<string, readonly [number, number, number]>> = {\n\taliceblue: [240, 248, 255],\n\tantiquewhite: [250, 235, 215],\n\taqua: [0, 255, 255],\n\taquamarine: [127, 255, 212],\n\tazure: [240, 255, 255],\n\tbeige: [245, 245, 220],\n\tbisque: [255, 228, 196],\n\tblack: [0, 0, 0],\n\tblanchedalmond: [255, 235, 205],\n\tblue: [0, 0, 255],\n\tblueviolet: [138, 43, 226],\n\tbrown: [165, 42, 42],\n\tburlywood: [222, 184, 135],\n\tcadetblue: [95, 158, 160],\n\tchartreuse: [127, 255, 0],\n\tchocolate: [210, 105, 30],\n\tcoral: [255, 127, 80],\n\tcornflowerblue: [100, 149, 237],\n\tcornsilk: [255, 248, 220],\n\tcrimson: [220, 20, 60],\n\tcyan: [0, 255, 255],\n\tdarkblue: [0, 0, 139],\n\tdarkcyan: [0, 139, 139],\n\tdarkgoldenrod: [184, 134, 11],\n\tdarkgray: [169, 169, 169],\n\tdarkgreen: [0, 100, 0],\n\tdarkgrey: [169, 169, 169],\n\tdarkkhaki: [189, 183, 107],\n\tdarkmagenta: [139, 0, 139],\n\tdarkolivegreen: [85, 107, 47],\n\tdarkorange: [255, 140, 0],\n\tdarkorchid: [153, 50, 204],\n\tdarkred: [139, 0, 0],\n\tdarksalmon: [233, 150, 122],\n\tdarkseagreen: [143, 188, 143],\n\tdarkslateblue: [72, 61, 139],\n\tdarkslategray: [47, 79, 79],\n\tdarkslategrey: [47, 79, 79],\n\tdarkturquoise: [0, 206, 209],\n\tdarkviolet: [148, 0, 211],\n\tdeeppink: [255, 20, 147],\n\tdeepskyblue: [0, 191, 255],\n\tdimgray: [105, 105, 105],\n\tdimgrey: [105, 105, 105],\n\tdodgerblue: [30, 144, 255],\n\tfirebrick: [178, 34, 34],\n\tfloralwhite: [255, 250, 240],\n\tforestgreen: [34, 139, 34],\n\tfuchsia: [255, 0, 255],\n\tgainsboro: [220, 220, 220],\n\tghostwhite: [248, 248, 255],\n\tgold: [255, 215, 0],\n\tgoldenrod: [218, 165, 32],\n\tgray: [128, 128, 128],\n\tgreen: [0, 128, 0],\n\tgreenyellow: [173, 255, 47],\n\tgrey: [128, 128, 128],\n\thoneydew: [240, 255, 240],\n\thotpink: [255, 105, 180],\n\tindianred: [205, 92, 92],\n\tindigo: [75, 0, 130],\n\tivory: [255, 255, 240],\n\tkhaki: [240, 230, 140],\n\tlavender: [230, 230, 250],\n\tlavenderblush: [255, 240, 245],\n\tlawngreen: [124, 252, 0],\n\tlemonchiffon: [255, 250, 205],\n\tlightblue: [173, 216, 230],\n\tlightcoral: [240, 128, 128],\n\tlightcyan: [224, 255, 255],\n\tlightgoldenrodyellow: [250, 250, 210],\n\tlightgray: [211, 211, 211],\n\tlightgreen: [144, 238, 144],\n\tlightgrey: [211, 211, 211],\n\tlightpink: [255, 182, 193],\n\tlightsalmon: [255, 160, 122],\n\tlightseagreen: [32, 178, 170],\n\tlightskyblue: [135, 206, 250],\n\tlightslategray: [119, 136, 153],\n\tlightslategrey: [119, 136, 153],\n\tlightsteelblue: [176, 196, 222],\n\tlightyellow: [255, 255, 224],\n\tlime: [0, 255, 0],\n\tlimegreen: [50, 205, 50],\n\tlinen: [250, 240, 230],\n\tmagenta: [255, 0, 255],\n\tmaroon: [128, 0, 0],\n\tmediumaquamarine: [102, 205, 170],\n\tmediumblue: [0, 0, 205],\n\tmediumorchid: [186, 85, 211],\n\tmediumpurple: [147, 112, 219],\n\tmediumseagreen: [60, 179, 113],\n\tmediumslateblue: [123, 104, 238],\n\tmediumspringgreen: [0, 250, 154],\n\tmediumturquoise: [72, 209, 204],\n\tmediumvioletred: [199, 21, 133],\n\tmidnightblue: [25, 25, 112],\n\tmintcream: [245, 255, 250],\n\tmistyrose: [255, 228, 225],\n\tmoccasin: [255, 228, 181],\n\tnavajowhite: [255, 222, 173],\n\tnavy: [0, 0, 128],\n\toldlace: [253, 245, 230],\n\tolive: [128, 128, 0],\n\tolivedrab: [107, 142, 35],\n\torange: [255, 165, 0],\n\torangered: [255, 69, 0],\n\torchid: [218, 112, 214],\n\tpalegoldenrod: [238, 232, 170],\n\tpalegreen: [152, 251, 152],\n\tpaleturquoise: [175, 238, 238],\n\tpalevioletred: [219, 112, 147],\n\tpapayawhip: [255, 239, 213],\n\tpeachpuff: [255, 218, 185],\n\tperu: [205, 133, 63],\n\tpink: [255, 192, 203],\n\tplum: [221, 160, 221],\n\tpowderblue: [176, 224, 230],\n\tpurple: [128, 0, 128],\n\trebeccapurple: [102, 51, 153],\n\tred: [255, 0, 0],\n\trosybrown: [188, 143, 143],\n\troyalblue: [65, 105, 225],\n\tsaddlebrown: [139, 69, 19],\n\tsalmon: [250, 128, 114],\n\tsandybrown: [244, 164, 96],\n\tseagreen: [46, 139, 87],\n\tseashell: [255, 245, 238],\n\tsienna: [160, 82, 45],\n\tsilver: [192, 192, 192],\n\tskyblue: [135, 206, 235],\n\tslateblue: [106, 90, 205],\n\tslategray: [112, 128, 144],\n\tslategrey: [112, 128, 144],\n\tsnow: [255, 250, 250],\n\tspringgreen: [0, 255, 127],\n\tsteelblue: [70, 130, 180],\n\ttan: [210, 180, 140],\n\tteal: [0, 128, 128],\n\tthistle: [216, 191, 216],\n\ttomato: [255, 99, 71],\n\tturquoise: [64, 224, 208],\n\tviolet: [238, 130, 238],\n\twheat: [245, 222, 179],\n\twhite: [255, 255, 255],\n\twhitesmoke: [245, 245, 245],\n\tyellow: [255, 255, 0],\n\tyellowgreen: [154, 205, 50],\n};\n","/**\n * Pure colour maths for the colour package. Everything here is a plain function\n * over numbers and {@link ColourData} with no engine imports and no side effects,\n * so it is trivially unit-testable and can be reused by a host renderer (the docs\n * notepad reads these to draw a swatch). Canonical storage is sRGB: `r`,`g`,`b`\n * are integers 0-255 and `a` is 0-1. HSL is derived on demand and re-quantised,\n * never stored, so equal-and-opposite operations return to a stable colour.\n */\nimport type { ColourData, ColourFormat } from \"@solve-js/vm/Value\";\nimport { CSS_NAMED_COLOURS } from \"./CssNamedColours\";\n\n/** Round and clamp a value to a valid 0-255 sRGB channel. */\nexport function clamp255(x: number): number {\n\treturn Math.min(255, Math.max(0, Math.round(x)));\n}\n\n/** Clamp a value to the 0-1 range used for alpha and normalised HSL. */\nexport function clamp01(x: number): number {\n\treturn Math.min(1, Math.max(0, x));\n}\n\nfunction hexByte(n: number): string {\n\treturn clamp255(n).toString(16).padStart(2, \"0\");\n}\n\n/**\n * Render the alpha channel the way CSS does: a plain decimal with no trailing\n * zeros (`1`, `0.5`, `0.333`), so `rgba(255, 0, 0, 0.5)` reads back cleanly.\n */\nfunction formatAlpha(a: number): string {\n\treturn String(Number(a.toFixed(3)));\n}\n\n// ── Parsing ─────────────────────────────────────────────────────────────\n\n/**\n * Parse a CSS hex colour: `#RGB`, `#RGBA`, `#RRGGBB` or `#RRGGBBAA`,\n * case-insensitive, leading `#` optional. Three and four digit forms expand each\n * nibble (`f` becomes `ff`), matching a browser. Any other length or a non-hex\n * character returns null so the caller can raise a clear error.\n */\nexport function parseHex(input: string): ColourData | null {\n\tconst s = input.startsWith(\"#\") ? input.slice(1) : input;\n\tif (!/^[0-9a-fA-F]+$/.test(s)) return null;\n\tconst dbl = (h: string): number => parseInt(h + h, 16);\n\tconst pair = (h: string): number => parseInt(h, 16);\n\tswitch (s.length) {\n\t\tcase 3:\n\t\t\treturn { r: dbl(s[0]), g: dbl(s[1]), b: dbl(s[2]), a: 1, format: \"hex\" };\n\t\tcase 4:\n\t\t\treturn { r: dbl(s[0]), g: dbl(s[1]), b: dbl(s[2]), a: dbl(s[3]) / 255, format: \"hex\" };\n\t\tcase 6:\n\t\t\treturn { r: pair(s.slice(0, 2)), g: pair(s.slice(2, 4)), b: pair(s.slice(4, 6)), a: 1, format: \"hex\" };\n\t\tcase 8:\n\t\t\treturn {\n\t\t\t\tr: pair(s.slice(0, 2)),\n\t\t\t\tg: pair(s.slice(2, 4)),\n\t\t\t\tb: pair(s.slice(4, 6)),\n\t\t\t\ta: pair(s.slice(6, 8)) / 255,\n\t\t\t\tformat: \"hex\",\n\t\t\t};\n\t\tdefault:\n\t\t\treturn null;\n\t}\n}\n\n/**\n * Resolve a CSS named colour (case-insensitive), including `transparent`. Returns\n * null for an unknown keyword so the caller can raise an error.\n */\nexport function namedColour(name: string): ColourData | null {\n\tconst key = name.trim().toLowerCase();\n\tif (key === \"transparent\") return { r: 0, g: 0, b: 0, a: 0, format: \"named\", name: \"transparent\" };\n\tconst rgb = CSS_NAMED_COLOURS[key];\n\tif (!rgb) return null;\n\treturn { r: rgb[0], g: rgb[1], b: rgb[2], a: 1, format: \"named\", name: key };\n}\n\n/** Parse either a hex string or a named colour; null if neither. */\nexport function parseColour(input: string): ColourData | null {\n\tconst trimmed = input.trim();\n\tif (trimmed.startsWith(\"#\") || /^[0-9a-fA-F]{3,8}$/.test(trimmed)) {\n\t\tconst hex = parseHex(trimmed);\n\t\tif (hex) return hex;\n\t}\n\treturn namedColour(trimmed);\n}\n\n// ── RGB <-> HSL ─────────────────────────────────────────────────────────\n\n/** Convert sRGB (0-255) to HSL with h in [0, 360), s and l in [0, 1]. */\nexport function rgbToHsl(r: number, g: number, b: number): { h: number; s: number; l: number } {\n\tconst rn = r / 255;\n\tconst gn = g / 255;\n\tconst bn = b / 255;\n\tconst max = Math.max(rn, gn, bn);\n\tconst min = Math.min(rn, gn, bn);\n\tconst l = (max + min) / 2;\n\tif (max === min) return { h: 0, s: 0, l };\n\tconst d = max - min;\n\tconst s = l > 0.5 ? d / (2 - max - min) : d / (max + min);\n\tlet h: number;\n\tif (max === rn) h = (gn - bn) / d + (gn < bn ? 6 : 0);\n\telse if (max === gn) h = (bn - rn) / d + 2;\n\telse h = (rn - gn) / d + 4;\n\treturn { h: h * 60, s, l };\n}\n\n/** Convert HSL (h in degrees, s and l in [0, 1]) to sRGB (0-255 integers). */\nexport function hslToRgb(h: number, s: number, l: number): { r: number; g: number; b: number } {\n\tif (s === 0) {\n\t\tconst v = clamp255(l * 255);\n\t\treturn { r: v, g: v, b: v };\n\t}\n\tconst q = l < 0.5 ? l * (1 + s) : l + s - l * s;\n\tconst p = 2 * l - q;\n\tconst hn = (((h % 360) + 360) % 360) / 360;\n\tconst hue = (t: number): number => {\n\t\tlet tt = t;\n\t\tif (tt < 0) tt += 1;\n\t\tif (tt > 1) tt -= 1;\n\t\tif (tt < 1 / 6) return p + (q - p) * 6 * tt;\n\t\tif (tt < 1 / 2) return q;\n\t\tif (tt < 2 / 3) return p + (q - p) * (2 / 3 - tt) * 6;\n\t\treturn p;\n\t};\n\treturn {\n\t\tr: clamp255(hue(hn + 1 / 3) * 255),\n\t\tg: clamp255(hue(hn) * 255),\n\t\tb: clamp255(hue(hn - 1 / 3) * 255),\n\t};\n}\n\n// ── Display ─────────────────────────────────────────────────────────────\n\n/** Canonical hex string, `#rrggbb`, extended to `#rrggbbaa` only when a < 1. */\nexport function toHexString(c: ColourData): string {\n\tconst base = `#${hexByte(c.r)}${hexByte(c.g)}${hexByte(c.b)}`;\n\treturn c.a < 1 ? `${base}${hexByte(c.a * 255)}` : base;\n}\n\n/**\n * Render a colour as the CSS string matching its authored `format`. Always valid\n * CSS, so a host can drop it straight into a `background` (this is both the\n * displayed answer text and the DTO `css` field).\n */\nexport function formatColour(c: ColourData): string {\n\tswitch (c.format) {\n\t\tcase \"rgb\":\n\t\t\treturn `rgb(${c.r}, ${c.g}, ${c.b})`;\n\t\tcase \"rgba\":\n\t\t\treturn `rgba(${c.r}, ${c.g}, ${c.b}, ${formatAlpha(c.a)})`;\n\t\tcase \"hsl\": {\n\t\t\tconst { h, s, l } = rgbToHsl(c.r, c.g, c.b);\n\t\t\treturn `hsl(${Math.round(h)}, ${Math.round(s * 100)}%, ${Math.round(l * 100)}%)`;\n\t\t}\n\t\tcase \"hsla\": {\n\t\t\tconst { h, s, l } = rgbToHsl(c.r, c.g, c.b);\n\t\t\treturn `hsla(${Math.round(h)}, ${Math.round(s * 100)}%, ${Math.round(l * 100)}%, ${formatAlpha(c.a)})`;\n\t\t}\n\t\tcase \"named\":\n\t\t\treturn c.name ?? toHexString(c);\n\t\tcase \"hex\":\n\t\tdefault:\n\t\t\treturn toHexString(c);\n\t}\n}\n\n// ── WCAG luminance and contrast ─────────────────────────────────────────\n\nfunction linearise(channel8: number): number {\n\tconst cs = channel8 / 255;\n\treturn cs <= 0.03928 ? cs / 12.92 : Math.pow((cs + 0.055) / 1.055, 2.4);\n}\n\n/** WCAG relative luminance, 0 (black) to 1 (white). Alpha is ignored, per WCAG. */\nexport function relativeLuminance(c: ColourData): number {\n\treturn 0.2126 * linearise(c.r) + 0.7152 * linearise(c.g) + 0.0722 * linearise(c.b);\n}\n\n/** WCAG contrast ratio between two colours, 1 (identical) to 21 (black on white). */\nexport function contrastRatio(a: ColourData, b: ColourData): number {\n\tconst la = relativeLuminance(a) + 0.05;\n\tconst lb = relativeLuminance(b) + 0.05;\n\treturn la > lb ? la / lb : lb / la;\n}\n\n// ── Operations ──────────────────────────────────────────────────────────\n\n/**\n * Rebuild a colour from new channels, preserving the display format and alpha\n * unless overridden. A `named` colour whose channels change is no longer that\n * keyword, so it falls back to hex display.\n */\nfunction derive(c: ColourData, next: { r?: number; g?: number; b?: number; a?: number }): ColourData {\n\tconst format: ColourFormat = c.format === \"named\" ? \"hex\" : c.format;\n\treturn {\n\t\tr: next.r ?? c.r,\n\t\tg: next.g ?? c.g,\n\t\tb: next.b ?? c.b,\n\t\ta: next.a ?? c.a,\n\t\tformat,\n\t};\n}\n\nfunction adjustHsl(c: ColourData, fn: (hsl: { h: number; s: number; l: number }) => void): ColourData {\n\tconst hsl = rgbToHsl(c.r, c.g, c.b);\n\tfn(hsl);\n\tconst { r, g, b } = hslToRgb(hsl.h, hsl.s, hsl.l);\n\treturn derive(c, { r, g, b });\n}\n\n/** Increase lightness by `amount` (a fraction 0-1). */\nexport function lighten(c: ColourData, amount: number): ColourData {\n\treturn adjustHsl(c, (hsl) => (hsl.l = clamp01(hsl.l + amount)));\n}\n\n/** Decrease lightness by `amount`. */\nexport function darken(c: ColourData, amount: number): ColourData {\n\treturn adjustHsl(c, (hsl) => (hsl.l = clamp01(hsl.l - amount)));\n}\n\n/** Increase saturation by `amount`. */\nexport function saturate(c: ColourData, amount: number): ColourData {\n\treturn adjustHsl(c, (hsl) => (hsl.s = clamp01(hsl.s + amount)));\n}\n\n/** Decrease saturation by `amount`. */\nexport function desaturate(c: ColourData, amount: number): ColourData {\n\treturn adjustHsl(c, (hsl) => (hsl.s = clamp01(hsl.s - amount)));\n}\n\n/** Rotate the hue by `degrees` (wraps at 360). */\nexport function rotateHue(c: ColourData, degrees: number): ColourData {\n\treturn adjustHsl(c, (hsl) => (hsl.h = ((hsl.h + degrees) % 360 + 360) % 360));\n}\n\n/** The colour on the opposite side of the wheel (hue + 180). */\nexport function complement(c: ColourData): ColourData {\n\treturn rotateHue(c, 180);\n}\n\n/** Convert to grey using Rec.601 luma, preserving alpha. */\nexport function grayscale(c: ColourData): ColourData {\n\tconst y = clamp255(0.299 * c.r + 0.587 * c.g + 0.114 * c.b);\n\treturn derive(c, { r: y, g: y, b: y });\n}\n\n/** Invert each channel by `amount` (1 = full inversion), preserving alpha. */\nexport function invert(c: ColourData, amount = 1): ColourData {\n\tconst t = clamp01(amount);\n\treturn derive(c, {\n\t\tr: clamp255(c.r + (255 - 2 * c.r) * t),\n\t\tg: clamp255(c.g + (255 - 2 * c.g) * t),\n\t\tb: clamp255(c.b + (255 - 2 * c.b) * t),\n\t});\n}\n\n/**\n * Blend two colours by linear sRGB interpolation, `weight` toward `b` (0.5 is the\n * midpoint). This matches Sass `mix()` and DevTools blending; it is not\n * perceptually uniform (that would be Oklab), a deliberate zero-dependency choice.\n */\nexport function mix(a: ColourData, b: ColourData, weight = 0.5): ColourData {\n\tconst t = clamp01(weight);\n\tconst lerp = (x: number, y: number): number => x * (1 - t) + y * t;\n\tconst format: ColourFormat = a.format === \"named\" ? \"hex\" : a.format;\n\treturn {\n\t\tr: clamp255(lerp(a.r, b.r)),\n\t\tg: clamp255(lerp(a.g, b.g)),\n\t\tb: clamp255(lerp(a.b, b.b)),\n\t\ta: clamp01(lerp(a.a, b.a)),\n\t\tformat,\n\t};\n}\n\n/** Set the alpha channel, upgrading the display format so the alpha shows. */\nexport function withAlpha(c: ColourData, alpha: number): ColourData {\n\tconst a = clamp01(alpha);\n\tlet format: ColourFormat = c.format;\n\tif (a < 1) {\n\t\tif (format === \"rgb\") format = \"rgba\";\n\t\telse if (format === \"hsl\") format = \"hsla\";\n\t\telse if (format === \"named\") format = \"hex\";\n\t}\n\treturn { r: c.r, g: c.g, b: c.b, a, format };\n}\n\n// ── Additional colour spaces and helpers ────────────────────────────────\n\n/** Opaque white and black, reused by the luminance-based helpers below. */\nconst WHITE: ColourData = { r: 255, g: 255, b: 255, a: 1, format: \"hex\" };\nconst BLACK: ColourData = { r: 0, g: 0, b: 0, a: 1, format: \"hex\" };\nconst MID_GREY: ColourData = { r: 128, g: 128, b: 128, a: 1, format: \"hex\" };\n\n/**\n * Convert HSV/HSB (hue in degrees, saturation and value in 0-1) to sRGB. HSV is\n * the wheel most colour pickers present (DevTools included), distinct from HSL:\n * `value` is how bright the colour is, where HSL's `lightness` is how close to\n * white or black.\n */\nexport function hsvToRgb(h: number, s: number, v: number): { r: number; g: number; b: number } {\n\tconst hh = ((((h % 360) + 360) % 360)) / 60;\n\tconst c = v * s;\n\tconst x = c * (1 - Math.abs((hh % 2) - 1));\n\tconst m = v - c;\n\tlet r = 0;\n\tlet g = 0;\n\tlet b = 0;\n\tif (hh < 1) [r, g, b] = [c, x, 0];\n\telse if (hh < 2) [r, g, b] = [x, c, 0];\n\telse if (hh < 3) [r, g, b] = [0, c, x];\n\telse if (hh < 4) [r, g, b] = [0, x, c];\n\telse if (hh < 5) [r, g, b] = [x, 0, c];\n\telse [r, g, b] = [c, 0, x];\n\treturn { r: clamp255((r + m) * 255), g: clamp255((g + m) * 255), b: clamp255((b + m) * 255) };\n}\n\n/**\n * Convert HWB (hue in degrees, whiteness and blackness in 0-1) to sRGB, the CSS\n * Color 4 model: start from the pure hue and mix in white and black. When\n * whiteness and blackness sum to 1 or more the hue washes out to grey.\n */\nexport function hwbToRgb(h: number, w: number, b: number): { r: number; g: number; b: number } {\n\tconst wh = clamp01(w);\n\tconst bl = clamp01(b);\n\tif (wh + bl >= 1) {\n\t\tconst grey = clamp255((wh / (wh + bl)) * 255);\n\t\treturn { r: grey, g: grey, b: grey };\n\t}\n\tconst base = hslToRgb(h, 1, 0.5);\n\tconst channel = (ch: number): number => clamp255(ch * (1 - wh - bl) + wh * 255);\n\treturn { r: channel(base.r), g: channel(base.g), b: channel(base.b) };\n}\n\n/** Mix toward white by `amount` (a tint). */\nexport function tint(c: ColourData, amount: number): ColourData {\n\treturn mix(c, WHITE, amount);\n}\n\n/** Mix toward black by `amount` (a shade). */\nexport function shade(c: ColourData, amount: number): ColourData {\n\treturn mix(c, BLACK, amount);\n}\n\n/** Mix toward mid-grey by `amount` (a tone). */\nexport function tone(c: ColourData, amount: number): ColourData {\n\treturn mix(c, MID_GREY, amount);\n}\n\n/**\n * Whether a colour reads as dark, meaning white text on it has at least as much\n * WCAG contrast as black text does. Backs {@link readableColour} and the\n * `isdark`/`islight` predicates.\n */\nexport function isDark(c: ColourData): boolean {\n\treturn contrastRatio(c, WHITE) >= contrastRatio(c, BLACK);\n}\n\n/** Black or white, whichever has the higher WCAG contrast against `background`. */\nexport function readableColour(background: ColourData): ColourData {\n\treturn isDark(background) ? WHITE : BLACK;\n}\n\n/**\n * WCAG 2.x minimum contrast ratios. Normal text needs 4.5 (AA) or 7 (AAA); large\n * text (>= 18pt, or >= 14pt bold) and UI components need 3 (AA) or 4.5 (AAA).\n */\nexport const WCAG_THRESHOLDS = { aa: 4.5, aaa: 7, aaLarge: 3, aaaLarge: 4.5 } as const;\n\n/** The four WCAG ratings this package reports, best first. */\nexport type WcagLevel = \"AAA\" | \"AA\" | \"AA Large\" | \"Fail\";\n\n/**\n * The best WCAG 2.x rating two colours pass for normal-size text: `AAA` (ratio\n * >= 7), `AA` (>= 4.5), `AA Large` (>= 3, which meets AA only for large text or\n * UI), or `Fail` (< 3). This is the badge a contrast checker shows.\n */\nexport function wcagLevel(a: ColourData, b: ColourData): WcagLevel {\n\tconst ratio = contrastRatio(a, b);\n\tif (ratio >= WCAG_THRESHOLDS.aaa) return \"AAA\";\n\tif (ratio >= WCAG_THRESHOLDS.aa) return \"AA\";\n\tif (ratio >= WCAG_THRESHOLDS.aaLarge) return \"AA Large\";\n\treturn \"Fail\";\n}\n"]}

package/dist/chunk-EVAOPEO4.js

@@ -0,0 +1,2 @@
+import {c}from'./chunk-MPB7KUN5.js';var m=0,l=0,p=Number.POSITIVE_INFINITY,h=0,y=Number.POSITIVE_INFINITY;function g(e,t,r){return c.execution({code:"ALLOCATION_LIMIT_EXCEEDED",message:`Evaluating this expression would materialise ${e.toLocaleString("en-US")} ${t}, past the limit of ${p.toLocaleString("en-US")} elements for one evaluation`,expected:`at most ${p.toLocaleString("en-US")} elements materialised while evaluating one expression`,found:`a request for ${e.toLocaleString("en-US")} more ${t}, on top of ${r.toLocaleString("en-US")} already materialised`,suggestion:"use a smaller collection or matrix, or raise the engine's vm.maxAllocatedElements setting",context:{requested:e,what:t,used:r,limit:p}})}function _(e){m++===0&&(l=0,p=e.getMaxAllocatedElements(),h=0,y=e.getMaxFunctionCalls());}function C(){m>0&&m--;}function T(e,t){if(m!==0){if(!(e>=0))throw g(e,t,l);if(l+=e,l>p)throw g(e,t,l-e)}}function D(e,t){if(m!==0&&(!(e>=0)||l+e>p))throw g(e,t,l)}function R(e,t){return D(e,t),new Array(e)}function P(){if(m!==0&&++h>y)throw c.execution({code:"FUNCTION_CALL_LIMIT_EXCEEDED",message:`Evaluating this expression would make more than ${y.toLocaleString("en-US")} user-defined-function calls, which is the limit for one evaluation`,expected:`at most ${y.toLocaleString("en-US")} function calls while evaluating one expression`,found:"a call past that limit, from a chain of functions that each call others more than once",suggestion:"check for a function that calls itself (or a chain of them) more times than intended, or raise the engine's vm.maxFunctionCalls setting",context:{calls:h,callLimit:y}})}var E=(n=>(n[n.Number=0]="Number",n[n.Hex=1]="Hex",n[n.BigInt=2]="BigInt",n[n.String=3]="String",n[n.Datetime=4]="Datetime",n[n.Percentage=5]="Percentage",n[n.Uom=6]="Uom",n[n.Matrix=7]="Matrix",n[n.Range=8]="Range",n[n.Symbolic=9]="Symbolic",n[n.Boolean=10]="Boolean",n[n.Unit=11]="Unit",n[n.Pending=12]="Pending",n[n.Error=13]="Error",n[n.Colour=14]="Colour",n[n.Split=15]="Split",n))(E||{}),f=class f{constructor(t=512){this.arena=[];this.index=0;this.initialSize=t;for(let r=0;r<t;r++)this.arena.push(new a(0,0));}acquire(t,r,o){if(this.index<this.arena.length){let s=this.arena[this.index++];return s.recycle(t,r,o),s}let d=new a(t,r,o);return this.arena.push(d),this.index++,d}reset(){let t=this.index;this.index=0,!(this.arena.length<=this.initialSize)&&(this.arena.length<=t*f.SHRINK_WHEN_HOLDING_TIMES||(this.arena.length=Math.max(this.initialSize,t*f.KEEP_TIMES)));}get usage(){return this.index}get capacity(){return this.arena.length}};f.SHRINK_WHEN_HOLDING_TIMES=4,f.KEEP_TIMES=2;var b=f,i=null,u=false;function A(e){return i||(i=new b(e)),i.reset(),u=true,i}function O(){u=false;}function v(){return u}function $(e){let t=new a(e.type,e.value,e.unit);return e.exact!==void 0&&(t.exact=e.exact),e.rational!==void 0&&(t.rational=e.rational),e.uncertainty!==void 0&&(t.uncertainty=e.uncertainty),t}var I=process.env.NODE_ENV==="development";function q(e){return I&&!v()&&(e.toNumber(),Object.freeze(e)),e}var a=class{constructor(t,r,o){this.type=t,this.value=r,this.unit=o,typeof r=="number"&&(this._cachedNumber=r);}recycle(t,r,o){this.type=t,this.value=r,this.unit=o,this._cachedNumber=typeof r=="number"?r:void 0,this.timedOut=void 0,this.exact=void 0,this.rational=void 0,this.uncertainty=void 0,this.decimalPlaces=void 0;}isNumber(){return this.type===0}isHex(){return this.type===1}isBigInt(){return this.type===2}isString(){return this.type===3}isMatrix(){return this.type===7}isVectorShape(){if(this.type!==7)return  false;let t=this.value;return t.rows===1||t.cols===1}isRange(){return this.type===8}isColour(){return this.type===14}isSymbolic(){return this.type===9}isError(){return this.type===13}isPending(){return this.type===12}isFault(){return this.type===13||this.type===12}get errorCode(){return this.type===13?this.value:void 0}get errorMessage(){return this.type===13?this.unit:void 0}toNumber(){if(this.type===12||this.type===13)return 0;if(this.type===7){let r=this.value;return r.rows===1&&r.cols===1&&typeof r.data[0]=="number"?r.data[0]:0}if(this.type===8||this.type===14)return 0;if(this.type===15)return this.value.shares[0].value;if(this.type===9)return 0;if(this.type===10)return this.value===true?1:0;if(this._cachedNumber!==void 0)return this._cachedNumber;if(typeof this.value=="bigint")return this._cachedNumber=Number(this.value),this._cachedNumber;let t=parseFloat(this.value);return this._cachedNumber=isNaN(t)?0:t,this._cachedNumber}isNaN(){if(this.type===12||this.type===13)return  false;if(this.type===7){let t=this.value;return t.rows===1&&t.cols===1&&typeof t.data[0]=="number"?isNaN(t.data[0]):false}return this.type===8||this.type===14||this.type===15||this.type===9||this.type===10?false:typeof this.value=="number"?isNaN(this.value):typeof this.value=="bigint"?false:isNaN(parseFloat(this.value))}};function x(e){return u&&i?i.acquire(0,e):new a(0,e)}function B(e,t){let r=x(e);return r.exact=t,r}function H(e,t){let r=x(e);return r.rational=t,r}function j(e,t){let r=x(e);return r.uncertainty=t,r}function k(e,t="hex"){let r=t==="hex"?void 0:t;return u&&i?i.acquire(1,e,r):new a(1,e,r)}function z(e){return u&&i?i.acquire(2,e):new a(2,e)}function K(e){return u&&i?i.acquire(3,e):new a(3,e)}function S(e,t){return u&&i?i.acquire(6,e,t):new a(6,e,t)}function Y(e,t,r){let o=S(e,t);return o.exact=r,o}function W(e,t,r){return S(e,`${t}/${r}`)}function X(e){return typeof e=="string"&&e.includes("/")}function G(e){let t=e.indexOf("/");if(t<0)throw c.internal("INVALID_RATE_UNIT",`splitRateUnit: "${e}" is not a rate unit (expected "numerator/denominator")`,{unit:e});return {numerator:e.slice(0,t),denominator:e.slice(t+1)}}var V="timecode@";function J(e){return `${V}${e}`}function M(e){return typeof e=="string"&&e.startsWith(V)}function Q(e){if(!M(e))throw c.internal("INVALID_TIMECODE_UNIT",`timecodeFps: "${e}" is not a timecode unit (expected "timecode@<fps>")`,{unit:e});return parseFloat(e.slice(V.length))}function N(e,t,r){T(r.length,"matrix cells");let o=r.some(s=>typeof s=="object"&&s!==null&&"kind"in s),d={rows:e,cols:t,data:r,hasSymbolic:o};return u&&i?i.acquire(7,d):new a(7,d)}function Z(e){return N(1,e.length,e)}function ee(e){return N(e.length,1,e)}function te(e,t){let r={min:e,max:t};return u&&i?i.acquire(8,r):new a(8,r)}function re(e){return u&&i?i.acquire(14,e):new a(14,e)}function ne(e){return u&&i?i.acquire(15,e):new a(15,e)}function ie(e){return u&&i?i.acquire(9,e):new a(9,e)}function ae(e){return u&&i?i.acquire(10,e):new a(10,e)}function ue(e){return u&&i?i.acquire(4,e):new a(4,e)}function oe(e){return u&&i?i.acquire(5,e):new a(5,e)}function le(e){return new a(12,e)}function se(e,t){return new a(13,e,t)}function ce(e,t,r){return e.type===13||e.type===12?e:t!==void 0&&(t.type===13||t.type===12)?t:r!==void 0&&(r.type===13||r.type===12)?r:null}function pe(e){for(let t=0;t<e.length;t++){let r=e[t];if(r.type===13||r.type===12)return r}return null}export{M as A,Q as B,N as C,Z as D,ee as E,te as F,re as G,ne as H,ie as I,ae as J,ue as K,oe as L,le as M,se as N,ce as O,pe as P,_ as a,C as b,T as c,D as d,R as e,P as f,E as g,A as h,O as i,v as j,$ as k,q as l,a as m,x as n,B as o,H as p,j as q,k as r,z as s,K as t,S as u,Y as v,W as w,X as x,G as y,J as z};//# sourceMappingURL=chunk-EVAOPEO4.js.map
+//# sourceMappingURL=chunk-EVAOPEO4.js.map

package/dist/chunk-EVAOPEO4.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/vm/AllocationBudget.ts","../src/vm/Value.ts"],"names":["depth","used","limit","calls","callLimit","exceeded","requested","what","alreadyUsed","ErrorFactory","beginEvaluation","vm","endEvaluation","chargeAllocation","count","checkAllocation","checkedArray","chargeFunctionCall","ValueType","_ValueArena","initialSize","i","Value","type","value","unit","v","usedLastCycle","ValueArena","_arena","_arenaActive","enableValueArena","size","disableValueArena","isArenaActive","persistentValue","p","isDevelopmentBuild","freezeIfDev","m","result","numberValue","n","numberValueExact","exact","numberValueRational","rational","numberValueUncertain","uncertainty","hexValue","base","tag","bigIntValue","stringValue","s","uomValue","uomValueExact","rateValue","magnitude","numeratorUnit","denominatorUnit","isRateUnit","splitRateUnit","idx","TIMECODE_UNIT_PREFIX","timecodeUnit","fps","isTimecodeUnit","timecodeFps","matrixValue","rows","cols","data","hasSymbolic","cell","rowVectorValue","colVectorValue","rangeValue","min","max","colourValue","c","splitValue","symbolicValue","node","boolValue","b","datetimeValue","percentageValue","pendingValue","queryKey","errorValue","code","message","faultedOperand","a","faultedIn","values"],"mappings":"oCAwDA,IAAIA,EAAQ,CAAA,CAGRC,CAAAA,CAAO,EAGPC,CAAAA,CAAQ,MAAA,CAAO,kBAGfC,CAAAA,CAAQ,CAAA,CAGRC,EAAY,MAAA,CAAO,iBAAA,CAMvB,SAASC,CAAAA,CAASC,CAAAA,CAAmBC,EAAcC,CAAAA,CAA4B,CAC9E,OAAOC,CAAAA,CAAa,SAAA,CAAU,CAC7B,IAAA,CAAM,4BACN,OAAA,CACC,CAAA,6CAAA,EAAgDH,EAAU,cAAA,CAAe,OAAO,CAAC,CAAA,CAAA,EAAIC,CAAI,uBACpEL,CAAAA,CAAM,cAAA,CAAe,OAAO,CAAC,CAAA,4BAAA,CAAA,CACnD,SAAU,CAAA,QAAA,EAAWA,CAAAA,CAAM,eAAe,OAAO,CAAC,CAAA,sDAAA,CAAA,CAClD,KAAA,CAAO,iBAAiBI,CAAAA,CAAU,cAAA,CAAe,OAAO,CAAC,CAAA,MAAA,EAASC,CAAI,CAAA,YAAA,EAAeC,CAAAA,CAAY,eAAe,OAAO,CAAC,wBACxH,UAAA,CAAY,2FAAA,CACZ,QAAS,CAAE,SAAA,CAAAF,EAAW,IAAA,CAAAC,CAAAA,CAAM,IAAA,CAAMC,CAAAA,CAAa,MAAAN,CAAM,CACtD,CAAC,CACF,CAQO,SAASQ,CAAAA,CAAgBC,CAAAA,CAAc,CACzCX,CAAAA,EAAAA,GAAY,CAAA,GACfC,EAAO,CAAA,CACPC,CAAAA,CAAQS,EAAG,uBAAA,EAAwB,CACnCR,EAAQ,CAAA,CACRC,CAAAA,CAAYO,CAAAA,CAAG,mBAAA,IAEjB,CAGO,SAASC,GAAsB,CACjCZ,CAAAA,CAAQ,GAAGA,CAAAA,GAChB,CAuBO,SAASa,CAAAA,CAAiBC,CAAAA,CAAeP,EAAoB,CACnE,GAAIP,IAAU,CAAA,CAKd,CAAA,GAAI,EAAEc,CAAAA,EAAS,CAAA,CAAA,CAAI,MAAMT,CAAAA,CAASS,EAAOP,CAAAA,CAAMN,CAAI,EAEnD,GADAA,CAAAA,EAAQa,EACJb,CAAAA,CAAOC,CAAAA,CAAO,MAAMG,CAAAA,CAASS,CAAAA,CAAOP,EAAMN,CAAAA,CAAOa,CAAK,EAC3D,CAgBO,SAASC,EAAgBD,CAAAA,CAAeP,CAAAA,CAAoB,CAClE,GAAIP,IAAU,CAAA,GACV,EAAEc,GAAS,CAAA,CAAA,EAAMb,CAAAA,CAAOa,EAAQZ,CAAAA,CAAAA,CAAO,MAAMG,EAASS,CAAAA,CAAOP,CAAAA,CAAMN,CAAI,CAC5E,CAgBO,SAASe,CAAAA,CAAgBF,CAAAA,CAAeP,EAAmB,CACjE,OAAAQ,EAAgBD,CAAAA,CAAOP,CAAI,EACpB,IAAI,KAAA,CAASO,CAAK,CAC1B,CAoBO,SAASG,CAAAA,EAA2B,CAC1C,GAAIjB,CAAAA,GAAU,CAAA,EACV,EAAEG,CAAAA,CAAQC,CAAAA,CACb,MAAMK,CAAAA,CAAa,SAAA,CAAU,CAC5B,IAAA,CAAM,8BAAA,CACN,OAAA,CACC,CAAA,gDAAA,EAAmDL,EAAU,cAAA,CAAe,OAAO,CAAC,CAAA,mEAAA,CAAA,CAErF,QAAA,CAAU,WAAWA,CAAAA,CAAU,cAAA,CAAe,OAAO,CAAC,CAAA,+CAAA,CAAA,CACtD,MAAO,wFAAA,CACP,UAAA,CAAY,0IACZ,OAAA,CAAS,CAAE,MAAAD,CAAAA,CAAO,SAAA,CAAAC,CAAU,CAC7B,CAAC,CAEH,KCzGYc,CAAAA,CAAAA,CAAAA,CAAAA,GAEXA,CAAAA,CAAAA,CAAAA,CAAA,OAAS,CAAA,CAAA,CAAT,QAAA,CACAA,IAAA,GAAA,CAAM,CAAA,CAAA,CAAN,MACAA,CAAAA,CAAAA,CAAAA,CAAA,MAAA,CAAS,GAAT,QAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,OAAS,CAAA,CAAA,CAAT,QAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,QAAA,CAAW,GAAX,UAAA,CACAA,CAAAA,CAAAA,CAAAA,CAAA,WAAa,CAAA,CAAA,CAAb,YAAA,CACAA,IAAA,GAAA,CAAM,CAAA,CAAA,CAAN,MAEAA,CAAAA,CAAAA,CAAAA,CAAA,MAAA,CAAS,GAAT,QAAA,CAEAA,CAAAA,CAAAA,CAAAA,CAAA,MAAQ,CAAA,CAAA,CAAR,OAAA,CAEAA,IAAA,QAAA,CAAW,CAAA,CAAA,CAAX,UAAA,CAEAA,CAAAA,CAAAA,CAAAA,CAAA,QAAU,EAAA,CAAA,CAAV,SAAA,CAEAA,IAAA,IAAA,CAAO,EAAA,CAAA,CAAP,OAEAA,CAAAA,CAAAA,CAAAA,CAAA,OAAA,CAAU,IAAV,SAAA,CAEAA,CAAAA,CAAAA,CAAAA,CAAA,MAAQ,EAAA,CAAA,CAAR,OAAA,CAEAA,IAAA,MAAA,CAAS,EAAA,CAAA,CAAT,SAEAA,CAAAA,CAAAA,CAAAA,CAAA,KAAA,CAAQ,EAAA,CAAA,CAAR,OAAA,CA1BWA,OAAA,EAAA,CAAA,CA4CCC,CAAAA,CAAN,MAAMA,CAAW,CAgCvB,YAAYC,CAAAA,CAAsB,GAAA,CAAK,CA/BvC,IAAA,CAAQ,KAAA,CAAiB,EAAC,CAC1B,IAAA,CAAQ,MAAgB,CAAA,CA+BvB,IAAA,CAAK,YAAcA,CAAAA,CACnB,IAAA,IAASC,CAAAA,CAAI,CAAA,CAAGA,EAAID,CAAAA,CAAaC,CAAAA,EAAAA,CAChC,KAAK,KAAA,CAAM,IAAA,CAAK,IAAIC,CAAAA,CAAM,CAAA,CAAkB,CAAC,CAAC,EAEhD,CAGA,OAAA,CAAQC,CAAAA,CAAiBC,EAA4GC,CAAAA,CAAsB,CAC1J,GAAI,IAAA,CAAK,KAAA,CAAQ,IAAA,CAAK,KAAA,CAAM,OAAQ,CACnC,IAAMC,EAAI,IAAA,CAAK,KAAA,CAAM,KAAK,KAAA,EAAO,CAAA,CACjC,OAAAA,CAAAA,CAAE,OAAA,CAAQH,EAAMC,CAAAA,CAAOC,CAAI,EACpBC,CACR,CAEA,IAAMA,CAAAA,CAAI,IAAIJ,EAAMC,CAAAA,CAAMC,CAAAA,CAAOC,CAAI,CAAA,CACrC,OAAA,IAAA,CAAK,MAAM,IAAA,CAAKC,CAAC,EACjB,IAAA,CAAK,KAAA,EAAA,CACEA,CACR,CAaA,KAAA,EAAc,CACb,IAAMC,CAAAA,CAAgB,KAAK,KAAA,CAC3B,IAAA,CAAK,MAAQ,CAAA,CACT,EAAA,IAAA,CAAK,KAAA,CAAM,MAAA,EAAU,KAAK,WAAA,CAAA,GAC1B,IAAA,CAAK,MAAM,MAAA,EAAUA,CAAAA,CAAgBR,EAAW,yBAAA,GAGpD,IAAA,CAAK,MAAM,MAAA,CAAS,IAAA,CAAK,IAAI,IAAA,CAAK,WAAA,CAAaQ,EAAgBR,CAAAA,CAAW,UAAU,IACrF,CAGA,IAAI,KAAA,EAAgB,CAAE,OAAO,IAAA,CAAK,KAAO,CACzC,IAAI,QAAA,EAAmB,CAAE,OAAO,IAAA,CAAK,MAAM,MAAQ,CACpD,EA7EaA,CAAAA,CA4BY,yBAAA,CAA4B,EA5BxCA,CAAAA,CA6BY,UAAA,CAAa,EA7B/B,IAAMS,CAAAA,CAANT,CAAAA,CAwFHU,CAAAA,CAA4B,KAC5BC,CAAAA,CAAe,KAAA,CAGZ,SAASC,CAAAA,CAAiBC,CAAAA,CAA2B,CAC3D,OAAKH,CAAAA,GAAQA,EAAS,IAAID,CAAAA,CAAWI,CAAI,CAAA,CAAA,CACzCH,CAAAA,CAAO,OAAM,CACbC,CAAAA,CAAe,KACRD,CACR,CAGO,SAASI,CAAAA,EAA0B,CACzCH,CAAAA,CAAe,MAChB,CAGO,SAASI,CAAAA,EAAyB,CACxC,OAAOJ,CACR,CAOO,SAASK,CAAAA,CAAgBT,EAAiB,CAChD,IAAMU,EAAI,IAAId,CAAAA,CAAMI,EAAE,IAAA,CAAMA,CAAAA,CAAE,KAAA,CAAOA,CAAAA,CAAE,IAAI,CAAA,CAI3C,OAAIA,EAAE,KAAA,GAAU,MAAA,GAAWU,EAAE,KAAA,CAAQV,CAAAA,CAAE,OAGnCA,CAAAA,CAAE,QAAA,GAAa,SAAWU,CAAAA,CAAE,QAAA,CAAWV,EAAE,QAAA,CAAA,CAGzCA,CAAAA,CAAE,cAAgB,MAAA,GAAWU,CAAAA,CAAE,WAAA,CAAcV,CAAAA,CAAE,aAC5CU,CACR,CAYA,IAAMC,CAAAA,CAAqB,OAAA,CAAQ,IAAI,QAAA,GAAa,aAAA,CAa7C,SAASC,CAAAA,CAA6Bd,CAAAA,CAAa,CACzD,OAAIa,CAAAA,EAAsB,CAACH,CAAAA,EAAc,GAKxCV,EAAM,QAAA,EAAS,CACf,MAAA,CAAO,MAAA,CAAOA,CAAK,CAAA,CAAA,CAEbA,CACR,CAaO,IAAMF,CAAAA,CAAN,KAAY,CA+ElB,WAAA,CACCC,EACAC,CAAAA,CACAC,CAAAA,CACC,CACD,IAAA,CAAK,IAAA,CAAOF,EACZ,IAAA,CAAK,KAAA,CAAQC,EACb,IAAA,CAAK,IAAA,CAAOC,EAGR,OAAOD,CAAAA,EAAU,WACpB,IAAA,CAAK,aAAA,CAAgBA,GAEvB,CAMA,OAAA,CAAQD,EAAiBC,CAAAA,CAA4GC,CAAAA,CAAqB,CACzJ,IAAA,CAAK,IAAA,CAAOF,EACZ,IAAA,CAAK,KAAA,CAAQC,EACb,IAAA,CAAK,IAAA,CAAOC,EAGZ,IAAA,CAAK,aAAA,CAAgB,OAAOD,CAAAA,EAAU,SAAWA,CAAAA,CAAQ,MAAA,CAEzD,KAAK,QAAA,CAAW,MAAA,CAGhB,KAAK,KAAA,CAAQ,MAAA,CAGb,KAAK,QAAA,CAAW,MAAA,CAGhB,KAAK,WAAA,CAAc,MAAA,CAGnB,KAAK,aAAA,CAAgB,OACtB,CAEA,QAAA,EAA8C,CAC7C,OAAO,IAAA,CAAK,OAAS,CACtB,CAEA,OAA2C,CAC1C,OAAO,KAAK,IAAA,GAAS,CACtB,CAEA,QAAA,EAA8C,CAC7C,OAAO,IAAA,CAAK,IAAA,GAAS,CACtB,CAEA,QAAA,EAA8C,CAC7C,OAAO,IAAA,CAAK,IAAA,GAAS,CACtB,CAEA,QAAA,EAAkD,CACjD,OAAO,IAAA,CAAK,IAAA,GAAS,CACtB,CAGA,aAAA,EAAyB,CACxB,GAAI,IAAA,CAAK,OAAS,CAAA,CAAkB,OAAO,OAC3C,IAAMe,CAAAA,CAAI,KAAK,KAAA,CACf,OAAOA,CAAAA,CAAE,IAAA,GAAS,GAAKA,CAAAA,CAAE,IAAA,GAAS,CACnC,CAEA,OAAA,EAAgD,CAC/C,OAAO,IAAA,CAAK,OAAS,CACtB,CAEA,UAAkD,CACjD,OAAO,KAAK,IAAA,GAAS,EACtB,CAEA,UAAA,EAAsD,CACrD,OAAO,IAAA,CAAK,OAAS,CACtB,CAaA,SAAmB,CAClB,OAAO,KAAK,IAAA,GAAS,EACtB,CAOA,SAAA,EAAqB,CACpB,OAAO,IAAA,CAAK,IAAA,GAAS,EACtB,CASA,OAAA,EAAmB,CAClB,OAAO,IAAA,CAAK,IAAA,GAAS,EAAA,EAAmB,KAAK,IAAA,GAAS,EACvD,CAUA,IAAI,SAAA,EAAgC,CACnC,OAAO,IAAA,CAAK,OAAS,EAAA,CAAmB,IAAA,CAAK,MAAmB,MACjE,CAMA,IAAI,YAAA,EAAmC,CACtC,OAAO,IAAA,CAAK,IAAA,GAAS,EAAA,CAAkB,IAAA,CAAK,KAAO,MACpD,CAEA,UAAmB,CAWlB,GADI,KAAK,IAAA,GAAS,EAAA,EACd,KAAK,IAAA,GAAS,EAAA,CAAiB,OAAO,CAAA,CAC1C,GAAI,KAAK,IAAA,GAAS,CAAA,CAAkB,CACnC,IAAMA,CAAAA,CAAI,KAAK,KAAA,CACf,OAAIA,EAAE,IAAA,GAAS,CAAA,EAAKA,EAAE,IAAA,GAAS,CAAA,EAAK,OAAOA,CAAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAM,QAAA,CAAiBA,EAAE,IAAA,CAAK,CAAC,EAC3E,CACR,CAIA,GAHI,IAAA,CAAK,IAAA,GAAS,CAAA,EAGd,IAAA,CAAK,OAAS,EAAA,CAAkB,SAIpC,GAAI,IAAA,CAAK,OAAS,EAAA,CAAiB,OAAQ,KAAK,KAAA,CAAoB,MAAA,CAAO,CAAC,CAAA,CAAE,KAAA,CAM9E,GAAI,IAAA,CAAK,IAAA,GAAS,EAAoB,OAAO,CAAA,CAO7C,GAAI,IAAA,CAAK,OAAS,EAAA,CAAmB,OAAO,KAAK,KAAA,GAAU,IAAA,CAAO,EAAI,CAAA,CAEtE,GAAI,KAAK,aAAA,GAAkB,MAAA,CAAW,OAAO,IAAA,CAAK,aAAA,CAElD,GAAI,OAAO,IAAA,CAAK,OAAU,QAAA,CACzB,OAAA,IAAA,CAAK,aAAA,CAAgB,MAAA,CAAO,KAAK,KAAK,CAAA,CAC/B,KAAK,aAAA,CAGb,IAAMC,EAAS,UAAA,CAAW,IAAA,CAAK,KAAe,CAAA,CAC9C,OAAA,IAAA,CAAK,cAAgB,KAAA,CAAMA,CAAM,EAAI,CAAA,CAAIA,CAAAA,CAClC,KAAK,aACb,CAEA,KAAA,EAAiB,CAEhB,GADI,IAAA,CAAK,IAAA,GAAS,IACd,IAAA,CAAK,IAAA,GAAS,GAAiB,OAAO,MAAA,CAC1C,GAAI,IAAA,CAAK,IAAA,GAAS,EAAkB,CACnC,IAAMD,EAAI,IAAA,CAAK,KAAA,CACf,OAAIA,CAAAA,CAAE,IAAA,GAAS,CAAA,EAAKA,CAAAA,CAAE,OAAS,CAAA,EAAK,OAAOA,EAAE,IAAA,CAAK,CAAC,GAAM,QAAA,CAAiB,KAAA,CAAMA,EAAE,IAAA,CAAK,CAAC,CAAC,CAAA,CAClF,KACR,CAQA,OAPI,IAAA,CAAK,OAAS,CAAA,EACd,IAAA,CAAK,IAAA,GAAS,EAAA,EACd,KAAK,IAAA,GAAS,EAAA,EACd,KAAK,IAAA,GAAS,CAAA,EAId,KAAK,IAAA,GAAS,EAAA,CAA0B,MACxC,OAAO,IAAA,CAAK,OAAU,QAAA,CAAiB,KAAA,CAAM,KAAK,KAAK,CAAA,CACvD,OAAO,IAAA,CAAK,KAAA,EAAU,QAAA,CAAiB,KAAA,CACpC,MAAM,UAAA,CAAW,IAAA,CAAK,KAAe,CAAC,CAC9C,CACD,EAMO,SAASE,EAAYC,CAAAA,CAAkB,CAC7C,OAAIZ,CAAAA,EAAgBD,CAAAA,CAAeA,EAAO,OAAA,CAAQ,CAAA,CAAkBa,CAAC,CAAA,CAC9D,IAAIpB,EAAM,CAAA,CAAkBoB,CAAC,CACrC,CAWO,SAASC,EAAiBD,CAAAA,CAAWE,CAAAA,CAA2B,CACtE,IAAMlB,CAAAA,CAAIe,EAAYC,CAAC,CAAA,CACvB,OAAAhB,CAAAA,CAAE,KAAA,CAAQkB,EACHlB,CACR,CAYO,SAASmB,CAAAA,CAAoBH,CAAAA,CAAWI,CAAAA,CAA2B,CACzE,IAAMpB,CAAAA,CAAIe,CAAAA,CAAYC,CAAC,CAAA,CACvB,OAAAhB,EAAE,QAAA,CAAWoB,CAAAA,CACNpB,CACR,CAcO,SAASqB,EAAqBL,CAAAA,CAAWM,CAAAA,CAA4B,CAC3E,IAAMtB,CAAAA,CAAIe,EAAYC,CAAC,CAAA,CACvB,OAAAhB,CAAAA,CAAE,YAAcsB,CAAAA,CACTtB,CACR,CAqBO,SAASuB,CAAAA,CAASP,EAAoBQ,CAAAA,CAAoB,KAAA,CAAc,CAC9E,IAAMC,CAAAA,CAAMD,IAAS,KAAA,CAAQ,MAAA,CAAYA,EACzC,OAAIpB,CAAAA,EAAgBD,EAAeA,CAAAA,CAAO,OAAA,CAAQ,CAAA,CAAea,CAAAA,CAAGS,CAAG,CAAA,CAChE,IAAI7B,EAAM,CAAA,CAAeoB,CAAAA,CAAGS,CAAG,CACvC,CAGO,SAASC,CAAAA,CAAYV,CAAAA,CAAkB,CAC7C,OAAIZ,CAAAA,EAAgBD,EAAeA,CAAAA,CAAO,OAAA,CAAQ,EAAkBa,CAAC,CAAA,CAC9D,IAAIpB,CAAAA,CAAM,EAAkBoB,CAAC,CACrC,CAGO,SAASW,CAAAA,CAAYC,EAAkB,CAC7C,OAAIxB,GAAgBD,CAAAA,CAAeA,CAAAA,CAAO,QAAQ,CAAA,CAAkByB,CAAC,EAC9D,IAAIhC,CAAAA,CAAM,EAAkBgC,CAAC,CACrC,CAGO,SAASC,EAASb,CAAAA,CAAWjB,CAAAA,CAAqB,CACxD,OAAIK,CAAAA,EAAgBD,EAAeA,CAAAA,CAAO,OAAA,CAAQ,EAAea,CAAAA,CAAGjB,CAAI,EACjE,IAAIH,CAAAA,CAAM,EAAeoB,CAAAA,CAAGjB,CAAI,CACxC,CAWO,SAAS+B,CAAAA,CAAcd,CAAAA,CAAWjB,EAAcmB,CAAAA,CAA2B,CACjF,IAAMlB,CAAAA,CAAI6B,CAAAA,CAASb,EAAGjB,CAAI,CAAA,CAC1B,OAAAC,CAAAA,CAAE,KAAA,CAAQkB,EACHlB,CACR,CAgBO,SAAS+B,CAAAA,CAAUC,CAAAA,CAAmBC,EAAuBC,CAAAA,CAAgC,CACnG,OAAOL,CAAAA,CAASG,EAAW,CAAA,EAAGC,CAAa,IAAIC,CAAe,CAAA,CAAE,CACjE,CAGO,SAASC,EAAWpC,CAAAA,CAA0C,CACpE,OAAO,OAAOA,CAAAA,EAAS,UAAYA,CAAAA,CAAK,QAAA,CAAS,GAAG,CACrD,CAMO,SAASqC,CAAAA,CAAcrC,CAAAA,CAA0D,CACvF,IAAMsC,CAAAA,CAAMtC,EAAK,OAAA,CAAQ,GAAG,EAC5B,GAAIsC,CAAAA,CAAM,EACT,MAAMtD,CAAAA,CAAa,SAClB,mBAAA,CACA,CAAA,gBAAA,EAAmBgB,CAAI,CAAA,uDAAA,CAAA,CACvB,CAAE,KAAAA,CAAK,CACR,CAAA,CAED,OAAO,CAAE,SAAA,CAAWA,CAAAA,CAAK,MAAM,CAAA,CAAGsC,CAAG,EAAG,WAAA,CAAatC,CAAAA,CAAK,MAAMsC,CAAAA,CAAM,CAAC,CAAE,CAC1E,CAyBA,IAAMC,CAAAA,CAAuB,WAAA,CAGtB,SAASC,CAAAA,CAAaC,CAAAA,CAAqB,CACjD,OAAO,GAAGF,CAAoB,CAAA,EAAGE,CAAG,CAAA,CACrC,CAGO,SAASC,CAAAA,CAAe1C,CAAAA,CAA0C,CACxE,OAAO,OAAOA,GAAS,QAAA,EAAYA,CAAAA,CAAK,WAAWuC,CAAoB,CACxE,CAMO,SAASI,CAAAA,CAAY3C,CAAAA,CAAsB,CACjD,GAAI,CAAC0C,CAAAA,CAAe1C,CAAI,CAAA,CACvB,MAAMhB,EAAa,QAAA,CAClB,uBAAA,CACA,iBAAiBgB,CAAI,CAAA,oDAAA,CAAA,CACrB,CAAE,IAAA,CAAAA,CAAK,CACR,CAAA,CAED,OAAO,WAAWA,CAAAA,CAAK,KAAA,CAAMuC,CAAAA,CAAqB,MAAM,CAAC,CAC1D,CASO,SAASK,CAAAA,CAAYC,CAAAA,CAAcC,EAAcC,CAAAA,CAAqC,CAU5F3D,EAAiB2D,CAAAA,CAAK,MAAA,CAAQ,cAAc,CAAA,CAS5C,IAAMC,EAAcD,CAAAA,CAAK,IAAA,CAAKE,GAAQ,OAAOA,CAAAA,EAAS,QAAA,EAAYA,CAAAA,GAAS,MAAQ,MAAA,GAAUA,CAAI,EAC3FnC,CAAAA,CAAgB,CAAE,KAAA+B,CAAAA,CAAM,IAAA,CAAAC,EAAM,IAAA,CAAAC,CAAAA,CAAM,YAAAC,CAAY,CAAA,CACtD,OAAI3C,CAAAA,EAAgBD,CAAAA,CAAeA,EAAO,OAAA,CAAQ,CAAA,CAAkBU,CAAC,CAAA,CAC9D,IAAIjB,CAAAA,CAAM,CAAA,CAAkBiB,CAAC,CACrC,CAGO,SAASoC,CAAAA,CAAeH,CAAAA,CAAgC,CAC9D,OAAOH,CAAAA,CAAY,EAAGG,CAAAA,CAAK,MAAA,CAAQA,CAAI,CACxC,CAGO,SAASI,EAAAA,CAAeJ,CAAAA,CAAgC,CAC9D,OAAOH,EAAYG,CAAAA,CAAK,MAAA,CAAQ,EAAGA,CAAI,CACxC,CAGO,SAASK,EAAAA,CAAWC,EAAaC,CAAAA,CAAoB,CAC3D,IAAM,CAAA,CAAe,CAAE,IAAAD,CAAAA,CAAK,GAAA,CAAAC,CAAI,CAAA,CAChC,OAAIjD,GAAgBD,CAAAA,CAAeA,CAAAA,CAAO,QAAQ,CAAA,CAAiB,CAAC,EAC7D,IAAIP,CAAAA,CAAM,EAAiB,CAAC,CACpC,CAQO,SAAS0D,EAAAA,CAAYC,EAAsB,CACjD,OAAInD,GAAgBD,CAAAA,CAAeA,CAAAA,CAAO,QAAQ,EAAA,CAAkBoD,CAAC,CAAA,CAC9D,IAAI3D,EAAM,EAAA,CAAkB2D,CAAC,CACrC,CAQO,SAASC,GAAWV,CAAAA,CAAwB,CAClD,OAAI1C,CAAAA,EAAgBD,CAAAA,CAAeA,EAAO,OAAA,CAAQ,EAAA,CAAiB2C,CAAI,CAAA,CAChE,IAAIlD,EAAM,EAAA,CAAiBkD,CAAI,CACvC,CAGO,SAASW,EAAAA,CAAcC,CAAAA,CAA2B,CACxD,OAAItD,CAAAA,EAAgBD,EAAeA,CAAAA,CAAO,OAAA,CAAQ,EAAoBuD,CAAI,CAAA,CACnE,IAAI9D,CAAAA,CAAM,CAAA,CAAoB8D,CAAI,CAC1C,CAKO,SAASC,EAAAA,CAAUC,CAAAA,CAAmB,CAC5C,OAAIxD,GAAgBD,CAAAA,CAAeA,CAAAA,CAAO,QAAQ,EAAA,CAAmByD,CAAC,EAC/D,IAAIhE,CAAAA,CAAM,GAAmBgE,CAAC,CACtC,CAGO,SAASC,EAAAA,CAAc7C,EAAkB,CAC/C,OAAIZ,GAAgBD,CAAAA,CAAeA,CAAAA,CAAO,OAAA,CAAQ,CAAA,CAAoBa,CAAC,CAAA,CAChE,IAAIpB,EAAM,CAAA,CAAoBoB,CAAC,CACvC,CAGO,SAAS8C,GAAgB9C,CAAAA,CAAkB,CACjD,OAAIZ,CAAAA,EAAgBD,CAAAA,CAAeA,EAAO,OAAA,CAAQ,CAAA,CAAsBa,CAAC,CAAA,CAClE,IAAIpB,CAAAA,CAAM,CAAA,CAAsBoB,CAAC,CACzC,CAQO,SAAS+C,EAAAA,CAAaC,CAAAA,CAAyB,CACrD,OAAO,IAAIpE,EAAM,EAAA,CAAmBoE,CAAQ,CAC7C,CAQO,SAASC,GAAWC,CAAAA,CAAcC,CAAAA,CAAwB,CAChE,OAAO,IAAIvE,CAAAA,CAAM,EAAA,CAAiBsE,EAAMC,CAAO,CAChD,CA2BO,SAASC,EAAAA,CAAeC,EAAUT,CAAAA,CAAWL,CAAAA,CAAyB,CAC5E,OAAIc,CAAAA,CAAE,OAAS,EAAA,EAAmBA,CAAAA,CAAE,OAAS,EAAA,CAA0BA,CAAAA,CACnET,IAAM,MAAA,GAAcA,CAAAA,CAAE,IAAA,GAAS,EAAA,EAAmBA,EAAE,IAAA,GAAS,EAAA,CAAA,CAA2BA,EACxFL,CAAAA,GAAM,MAAA,GAAcA,EAAE,IAAA,GAAS,EAAA,EAAmBA,EAAE,IAAA,GAAS,EAAA,CAAA,CAA2BA,EACrF,IACR,CAQO,SAASe,EAAAA,CAAUC,CAAAA,CAAwC,CACjE,IAAA,IAAS5E,CAAAA,CAAI,EAAGA,CAAAA,CAAI4E,CAAAA,CAAO,OAAQ5E,CAAAA,EAAAA,CAAK,CACvC,IAAMK,CAAAA,CAAIuE,CAAAA,CAAO5E,CAAC,CAAA,CAClB,GAAIK,EAAE,IAAA,GAAS,EAAA,EAAmBA,EAAE,IAAA,GAAS,EAAA,CAAmB,OAAOA,CACxE,CACA,OAAO,IACR","file":"chunk-EVAOPEO4.js","sourcesContent":["/**\n * The ceiling on how much memory one evaluation is allowed to ask for.\n *\n * The VM's other two counters bound how many opcodes run and how deep the value\n * stack gets, and both are checked BETWEEN opcodes. That leaves a hole the size\n * of a single opcode: whatever one opcode allocates in a loop of its own is\n * invisible to both, so twenty-four characters of input (`map(10*x,\n * 0:2000000000)`) could allocate until V8 aborted the process, which no\n * `try`/`catch` in the host can contain. Per-site caps close one hole each and\n * do not compose: two collections that are individually legal are legal\n * together, and an operation whose result is the PRODUCT of two legal inputs (a\n * matrix multiply) is bounded by neither of them.\n *\n * This is the counter that composes. Everything an evaluation materialises is\n * charged against one running tally, so the bound is on the total rather than\n * on any single step, and a new opcode inherits it by allocating through\n * {@link chargedArray} or by building a Value through a constructor that\n * already charges ({@link matrixValue}).\n *\n * The tally is module state rather than something threaded through every\n * signature. `executeBytecode()` opens an evaluation and every charge inside\n * that window lands on it, which is what lets a helper five call levels down\n * (`vm/MatrixOps.ts`'s `collectionToValues()`) charge without the four frames\n * in between passing a parameter along, and what keeps a charge down to an add\n * and a compare. This mirrors the value arena in `vm/Value.ts`, which is\n * ambient for the same reason and rests on the same fact: `executeBytecode()`\n * is synchronous, so exactly one evaluation is ever in flight in a realm.\n *\n * An \"element\" is one thing a user's input caused to exist: a `Value` in an\n * expanded collection, a cell in a matrix. They are counted rather than\n * measured in bytes, because a count is the quantity every call site already\n * has in hand before it allocates, and asking V8 how big something is costs\n * more than the allocation being guarded.\n *\n * A second tally lives here for the same structural reason and not because it\n * counts the same thing: {@link chargeFunctionCall} bounds how many\n * user-defined-function calls one evaluation may make in total. Surviving\n * reentry is the whole property both need, and this module is where reentry is\n * already tracked.\n *\n * @module AllocationBudget\n */\n\nimport { ErrorFactory } from \"@solve-js/errors/UnifiedErrorFramework\";\nimport type { VM } from \"@solve-js/vm/OpRegistry\";\n\n/**\n * How deep the evaluation is: 0 outside one, higher inside a reentrant call.\n *\n * `executeBytecode()` re-enters itself for a user-defined function call, a map\n * or reduce transform body, and an algebra verb's bound-unknown body. Only the\n * outermost entry clears the tally, so a runaway recursion cannot refresh its\n * own allowance the way it can refresh `maxInstructions` (each reentrant call\n * gets a fresh local instruction count, which is why function recursion needed\n * a separate guard of its own).\n */\nlet depth = 0;\n\n/** Elements charged so far in the evaluation currently in flight. */\nlet used = 0;\n\n/** The in-flight evaluation's ceiling, read from its VM when the evaluation opened. */\nlet limit = Number.POSITIVE_INFINITY;\n\n/** User-defined-function calls made so far in the evaluation currently in flight. */\nlet calls = 0;\n\n/** The in-flight evaluation's call ceiling, read from its VM when the evaluation opened. */\nlet callLimit = Number.POSITIVE_INFINITY;\n\n/**\n * The refusal itself, built in one place so the wording of the engine's most\n * likely \"this is too big\" message is not reinvented per site.\n */\nfunction exceeded(requested: number, what: string, alreadyUsed: number): Error {\n\treturn ErrorFactory.execution({\n\t\tcode: \"ALLOCATION_LIMIT_EXCEEDED\",\n\t\tmessage:\n\t\t\t`Evaluating this expression would materialise ${requested.toLocaleString(\"en-US\")} ${what}, ` +\n\t\t\t`past the limit of ${limit.toLocaleString(\"en-US\")} elements for one evaluation`,\n\t\texpected: `at most ${limit.toLocaleString(\"en-US\")} elements materialised while evaluating one expression`,\n\t\tfound: `a request for ${requested.toLocaleString(\"en-US\")} more ${what}, on top of ${alreadyUsed.toLocaleString(\"en-US\")} already materialised`,\n\t\tsuggestion: \"use a smaller collection or matrix, or raise the engine's vm.maxAllocatedElements setting\",\n\t\tcontext: { requested, what, used: alreadyUsed, limit },\n\t});\n}\n\n/**\n * Open an evaluation, taking its ceiling from the VM about to run it.\n *\n * @param vm - The VM running this program. Only consulted on the outermost\n * entry, so a reentrant call costs one increment.\n */\nexport function beginEvaluation(vm: VM): void {\n\tif (depth++ === 0) {\n\t\tused = 0;\n\t\tlimit = vm.getMaxAllocatedElements();\n\t\tcalls = 0;\n\t\tcallLimit = vm.getMaxFunctionCalls();\n\t}\n}\n\n/** Close the innermost evaluation. Always call from a `finally`, so a throw cannot leave one open. */\nexport function endEvaluation(): void {\n\tif (depth > 0) depth--;\n}\n\n/**\n * Record elements materialised by the evaluation in flight.\n *\n * Each thing is charged exactly once, where it comes into existence: a matrix\n * in `matrixValue()`, an expanded collection where it is expanded. A site that\n * knows a size in advance and whose result will be charged on birth uses\n * {@link checkAllocation} instead, so that refusing early does not mean\n * counting twice.\n *\n * Outside an evaluation this is a plain no-op rather than an error:\n * `matrixValue()` and the `vm/MatrixOps.ts` helpers are exported and get called\n * by tests, by the formatter and by hosts with no evaluation in flight, and\n * none of those is user input being executed.\n *\n * @param count - How many elements now exist.\n * @param what - What they are, in the plural and in a user's words (\"matrix\n * cells\", \"collection elements\"). Quoted verbatim in the error, so it should\n * name the thing rather than the code that makes it.\n * @throws `ALLOCATION_LIMIT_EXCEEDED` when this evaluation has had enough.\n * Recoverable: it describes this expression, not the engine.\n */\nexport function chargeAllocation(count: number, what: string): void {\n\tif (depth === 0) return;\n\t// Written as a negated `>=` so that NaN takes this branch. A NaN count would\n\t// otherwise be added to the tally and make every later `used > limit`\n\t// comparison false, silently switching the guard off for the rest of the\n\t// evaluation, which is the one failure mode a safety limit must not have.\n\tif (!(count >= 0)) throw exceeded(count, what, used);\n\tused += count;\n\tif (used > limit) throw exceeded(count, what, used - count);\n}\n\n/**\n * Refuse an allocation this evaluation cannot afford, without recording it.\n *\n * For the sites that know how big a result will be BEFORE building it and whose\n * result is charged later, when it is born. A matrix product is the case that\n * matters: its size is the product of two operands that are each affordable, so\n * it has to be refused from the shapes alone, before `matrixMultiply()` takes\n * the memory. Charging here as well as at birth would bill every matrix twice\n * and halve the ceiling the host asked for.\n *\n * @param count - How many elements the result would have.\n * @param what - What they are, in the plural. See {@link chargeAllocation}.\n * @throws `ALLOCATION_LIMIT_EXCEEDED` when the evaluation could not afford them.\n */\nexport function checkAllocation(count: number, what: string): void {\n\tif (depth === 0) return;\n\tif (!(count >= 0) || used + count > limit) throw exceeded(count, what, used);\n}\n\n/**\n * Check that an array is affordable, then allocate it.\n *\n * The intended way to build any user-sized array inside the VM whose contents\n * end up inside a Value that charges on birth, so that \"ask before you take\" is\n * a property of the allocator rather than something each new opcode has to be\n * told.\n *\n * @param count - Element count, checked before a single element exists.\n * @param what - What the elements are, in the plural. See {@link chargeAllocation}.\n * @returns An empty array of that length.\n * @throws `ALLOCATION_LIMIT_EXCEEDED` before allocating anything, when the\n * evaluation cannot afford it.\n */\nexport function checkedArray<T>(count: number, what: string): T[] {\n\tcheckAllocation(count, what);\n\treturn new Array<T>(count);\n}\n\n/**\n * Record one user-defined-function call, and refuse the one past the ceiling.\n *\n * Lives in this module rather than in the VM for the single reason the element\n * tally does: it has to survive `executeBytecode()` re-entering itself. A call\n * count kept per invocation would be reset by the very calls it is counting,\n * which is exactly what happens to `maxInstructions` and exactly why counting\n * instructions could never bound this.\n *\n * The thing being bounded is BREADTH, which no existing guard could see.\n * `maxFunctionRecursionDepth` bounds nesting, and a doubling chain\n * (`f22(v) = f21(v) + f21(v)`, twenty-two lines of it) nests only twenty-two\n * deep while making 2,097,152 calls, which was a fatal heap abort in under a\n * second. Depth 22 against a limit of 50 is comfortably legal, and it was.\n *\n * @throws `FUNCTION_CALL_LIMIT_EXCEEDED` when this evaluation has made\n * enough. Recoverable: the engine is fine, this line is not.\n */\nexport function chargeFunctionCall(): void {\n\tif (depth === 0) return;\n\tif (++calls > callLimit) {\n\t\tthrow ErrorFactory.execution({\n\t\t\tcode: \"FUNCTION_CALL_LIMIT_EXCEEDED\",\n\t\t\tmessage:\n\t\t\t\t`Evaluating this expression would make more than ${callLimit.toLocaleString(\"en-US\")} ` +\n\t\t\t\t`user-defined-function calls, which is the limit for one evaluation`,\n\t\t\texpected: `at most ${callLimit.toLocaleString(\"en-US\")} function calls while evaluating one expression`,\n\t\t\tfound: \"a call past that limit, from a chain of functions that each call others more than once\",\n\t\t\tsuggestion: \"check for a function that calls itself (or a chain of them) more times than intended, or raise the engine's vm.maxFunctionCalls setting\",\n\t\t\tcontext: { calls, callLimit },\n\t\t});\n\t}\n}\n\n/**\n * Elements charged so far in the evaluation in flight, or in the one that just\n * finished. For tests and for a host reporting on a refusal.\n *\n * @returns The running tally.\n */\nexport function allocationUsed(): number {\n\treturn used;\n}\n\n/**\n * User-defined-function calls made so far in the evaluation in flight, or in\n * the one that just finished. For tests and for a host reporting on a refusal.\n *\n * @returns The running tally.\n */\nexport function functionCallsUsed(): number {\n\treturn calls;\n}\n\n/**\n * Drop all in-flight evaluation state.\n *\n * For tests that need a known starting point, and as a repair for a host that\n * somehow lost an `endEvaluation()`. Ordinary execution never needs it:\n * `executeBytecode()` pairs its own begin and end in a `finally`, and the\n * outermost begin clears the tally regardless of what came before.\n */\nexport function resetAllocationTracking(): void {\n\tdepth = 0;\n\tused = 0;\n\tlimit = Number.POSITIVE_INFINITY;\n\tcalls = 0;\n\tcallLimit = Number.POSITIVE_INFINITY;\n}\n","import { ErrorFactory } from \"@solve-js/errors/UnifiedErrorFramework\";\nimport { chargeAllocation } from \"@solve-js/vm/AllocationBudget\";\nimport type { SymbolicNode, Rational } from \"@solve-js/symbolic\";\nimport type { DecimalData } from \"@solve-js/decimal\";\n\n/**\n * A single matrix cell. `boolean` covers element-wise comparison results\n * (`[1,6;3,8] < [5,2;7,4]` produces a Matrix of booleans, not numbers). A\n * `SymbolicNode` cell is a free-variable algebraic entry, e.g. `s =\n * [sx,0,0;0,sy,0;0,0,1]` where `sx`/`sy` are never assigned, so those\n * cells store a real `SymbolicNode` (a bare `var` node initially) rather\n * than degrading to `0`. See `MatrixOps.ts`'s `entryToSymbolic()`/\n * `symbolicToEntry()` for the two-way conversion every symbolic-aware\n * matrix op (multiply, inverse, determinant) uses.\n */\nexport type MatrixEntry = number | boolean | SymbolicNode;\n\n/**\n * A general rows×cols matrix, a vector is just a 1×N (row) or N×1 (column)\n * matrix. `data` is COLUMN-MAJOR (`data[row + col*rows]`), matching the\n * spec's own `a[index]` column-major indexing semantics directly (no\n * translation needed for single-index reads). `hasSymbolic` lets every\n * numeric matrix op fast-path the all-numeric case with one boolean check,\n * mirroring `binaryOp()`'s existing Number+Number fast path, computed by\n * `matrixValue()` itself (true the moment any cell is a `SymbolicNode`\n * object rather than a plain number/boolean), not something callers set\n * by hand.\n */\nexport interface MatrixData {\n\treadonly rows: number;\n\treadonly cols: number;\n\treadonly data: readonly MatrixEntry[];\n\treadonly hasSymbolic: boolean;\n}\n\n/** A first-class integer range `min:max`, both bounds inclusive. */\nexport interface RangeData {\n\treadonly min: number;\n\treadonly max: number;\n}\n\n/**\n * How a colour was authored, and therefore how it should display. It never\n * changes the channels: a colour is always stored as canonical sRGB (`r`,`g`,`b`\n * integers 0-255, `a` in 0-1), and `format` only decides whether `formatValue`\n * renders it as `#rrggbb`, `rgb(...)`, `hsl(...)` or a named keyword.\n */\nexport type ColourFormat = \"hex\" | \"rgb\" | \"rgba\" | \"hsl\" | \"hsla\" | \"named\";\n\n/**\n * A colour value. Canonical channels are sRGB (`r`,`g`,`b` are integers 0-255,\n * `a` is 0-1); HSL is never stored, it is derived on demand for display and for\n * hue/saturation/lightness operations, then re-quantised back to RGBA. A\n * `lighten` followed by an equal `darken` returns to within one rounding step of\n * the original (integer channels re-quantise each way), and does not drift on\n * repetition, rather than storing both HSL and RGB and letting them disagree.\n * `format`\n * records the authored/display form; `name` carries the CSS keyword only when\n * `format === \"named\"` (e.g. `\"rebeccapurple\"`). Lives in a {@link Value}'s\n * `value` slot exactly as {@link MatrixData}/{@link RangeData} do.\n */\nexport interface ColourData {\n\treadonly r: number;\n\treadonly g: number;\n\treadonly b: number;\n\treadonly a: number;\n\treadonly format: ColourFormat;\n\treadonly name?: string;\n}\n\n/**\n * One tier of a bill split: an amount and how many people pay it. An even\n * split is a single share; the odd-penny case is two shares (the base amount\n * most people pay, then the base plus a cent that the remaining `count` pay),\n * so the shares always add back to the exact total. `exact` carries the\n * base-ten cents of a currency share so display rounds from the decimal rather\n * than a drifted double, exactly as money does everywhere else.\n */\nexport interface SplitShare {\n\treadonly value: number;\n\treadonly exact?: DecimalData;\n\treadonly count: number;\n}\n\n/**\n * The result of a per-person bill split (`split $180 between 4`). `unit` is the\n * currency code when the amount was money, undefined for a bare number.\n * `shares` is ordered base-first: `shares[0]` is the \"each\" amount, and a\n * second share, when present, is the slightly larger amount the odd penny falls\n * on. Lives in a {@link Value}'s `value` slot exactly as {@link ColourData} and\n * {@link RangeData} do, a display-only payload the formatter renders.\n */\nexport interface SplitData {\n\treadonly unit?: string;\n\treadonly shares: readonly SplitShare[];\n}\n\n/**\n * Discriminated union tag for {@link Value} objects.\n *\n * Determines the runtime type of a Value and how its `value` field should\n * be interpreted. Used by the VM for type-aware dispatch in arithmetic,\n * comparison, and conversion operations.\n */\nexport enum ValueType {\n\t/** Plain 64-bit floating point number (IEEE 754 double) */\n\tNumber = 0,\n\tHex = 1,\n\tBigInt = 2,\n\tString = 3,\n\tDatetime = 4,\n\tPercentage = 5,\n\tUom = 6,\n\t/** General rows×cols matrix (a vector is a 1×N or N×1 matrix). Value is {@link MatrixData}. */\n\tMatrix = 7,\n\t/** A first-class integer range `min:max`, both inclusive. Value is {@link RangeData}. */\n\tRange = 8,\n\t/** A symbolic/algebraic expression tree (free-variable formula, not a concrete number). Value is a `SymbolicNode` (`@solve-js/symbolic`). */\n\tSymbolic = 9,\n\t/** Boolean true/false. Value is `boolean`. */\n\tBoolean = 10,\n\t/** Unit of measurement token (lexer only, not a runtime value). */\n\tUnit = 11,\n\t/** Async result pending resolution. Value stores the queryKey string. */\n\tPending = 12,\n\t/** Plugin-raised error propagated through the DAG. Value stores error code, unit stores message. */\n\tError = 13,\n\t/** A colour (hex/rgb/hsl/named). Value is {@link ColourData}. */\n\tColour = 14,\n\t/** A per-person bill split (`split $180 between 4`). Value is {@link SplitData}. */\n\tSplit = 15,\n}\n\n// ── ValueArena ────────────────────────────────────────────────────────────\n// Phase 5.3: Bump-allocator arena for zero-allocation Value reuse during scroll.\n// Instead of allocating new Value objects per instruction, we pre-allocate a\n// block and bump an index. A single arena.reset() per scroll frame recycles all\n// Values, no per-value release overhead, no GC pressure during 60fps scrolling.\n\n/**\n * Bump-allocator arena for zero-allocation Value reuse during scroll.\n *\n * Instead of allocating new Value objects per instruction, pre-allocates a\n * block and bumps an index. `arena.reset()` per scroll frame recycles all\n * Values, no per-value release overhead, no GC pressure during 60fps scrolling.\n *\n * Only active during Tier 2 scroll execution (ThreeTierEvaluator).\n */\nexport class ValueArena {\n\tprivate arena: Value[] = [];\n\tprivate index: number = 0;\n\t/** The block size to come back down to. Kept so {@link reset} can. */\n\tprivate readonly initialSize: number;\n\n\t/**\n\t * How much more than the last cycle needed the arena may go on holding\n\t * before it gives the difference back, and how much of it it keeps when it\n\t * does.\n\t *\n\t * A bump allocator that grows to serve one expensive line is working as\n\t * intended; one that never comes down is a leak wearing a cache's clothes.\n\t * `map(x*1, 1:100000)` is an ordinary line by every limit the engine has,\n\t * and it took the arena from 512 Values to 300,004, about 24MB that stayed\n\t * live through two forced full collections and through every later `1 + 1`,\n\t * because `acquire()` handles overflow with `push()` and `reset()` only\n\t * zeroed the bump index. The instance is module-level and survives\n\t * `disableValueArena()` on purpose, so that high-water mark was for the\n\t * life of the process.\n\t *\n\t * Keeping twice what the last cycle used, and only shrinking once holding\n\t * four times that, is what stops the release from becoming a different\n\t * performance bug: a steady scroll uses about the same number of Values\n\t * every frame, so it never meets the condition at all, and an alternating\n\t * heavy/light document degrades at worst to allocating the Values it would\n\t * have allocated with no arena in the first place.\n\t */\n\tprivate static readonly SHRINK_WHEN_HOLDING_TIMES = 4;\n\tprivate static readonly KEEP_TIMES = 2;\n\n\t/** Pre-allocate initial block. 512 Values covers ~30-line viewport comfortably. */\n\tconstructor(initialSize: number = 512) {\n\t\tthis.initialSize = initialSize;\n\t\tfor (let i = 0; i < initialSize; i++) {\n\t\t\tthis.arena.push(new Value(ValueType.Number, 0));\n\t\t}\n\t}\n\n\t/** Bump-allocate a recycled Value. Falls back to allocation only for overflow. */\n\tacquire(type: ValueType, value: number | bigint | string | boolean | MatrixData | RangeData | ColourData | SplitData | SymbolicNode, unit?: string): Value {\n\t\tif (this.index < this.arena.length) {\n\t\t\tconst v = this.arena[this.index++];\n\t\t\tv.recycle(type, value, unit);\n\t\t\treturn v;\n\t\t}\n\t\t// Arena overflow, allocate fresh (rare, only for very complex expressions)\n\t\tconst v = new Value(type, value, unit);\n\t\tthis.arena.push(v);\n\t\tthis.index++;\n\t\treturn v;\n\t}\n\n\t/**\n\t * Reset for the next scroll frame, releasing a block the last frame turned\n\t * out not to need.\n\t *\n\t * Still O(1) in the ordinary case: one comparison against what the cycle\n\t * that just ended used, and the truncation only on the frame after an\n\t * unusually expensive one. Reading the usage here rather than at\n\t * `disableValueArena()` is what makes the policy \"the first cycle that does\n\t * not need the block gives it back\", which is the first thing a host does\n\t * after the line that grew it.\n\t */\n\treset(): void {\n\t\tconst usedLastCycle = this.index;\n\t\tthis.index = 0;\n\t\tif (this.arena.length <= this.initialSize) return;\n\t\tif (this.arena.length <= usedLastCycle * ValueArena.SHRINK_WHEN_HOLDING_TIMES) return;\n\t\t// Never below the initial block, and never above what is already held,\n\t\t// so this only ever truncates.\n\t\tthis.arena.length = Math.max(this.initialSize, usedLastCycle * ValueArena.KEEP_TIMES);\n\t}\n\n\t/** Current arena utilization (for diagnostics). */\n\tget usage(): number { return this.index; }\n\tget capacity(): number { return this.arena.length; }\n}\n\n// Module-level arena toggle. Single-threaded JS, so global state is safe.\n// The arena is ONLY active during Tier 2 scroll execution, the ThreeTierEvaluator\n// enables it before evaluating visible lines and disables it after.\n//\n// The arena INSTANCE survives disable(): constructing a ValueArena allocates\n// its whole initial block (512 Values), so dropping it on every disable would\n// pay that allocation cost again on the next enable, more garbage than the\n// arena saves. Instead, an `_arenaActive` flag gates use of the long-lived\n// instance; enable() just resets the bump index.\nlet _arena: ValueArena | null = null;\nlet _arenaActive = false;\n\n/** Enable the Value arena for zero-allocation scroll execution. */\nexport function enableValueArena(size?: number): ValueArena {\n\tif (!_arena) _arena = new ValueArena(size);\n\t_arena.reset();\n\t_arenaActive = true;\n\treturn _arena;\n}\n\n/** Disable the arena (returns to normal GC-collected allocation). */\nexport function disableValueArena(): void {\n\t_arenaActive = false;\n}\n\n/** Check if arena is active (used by STORE_VAR / HALT to decide cloning). */\nexport function isArenaActive(): boolean {\n\treturn _arenaActive;\n}\n\n/**\n * Allocate a Value that persists beyond the current arena cycle.\n * Used for values stored in variables (STORE_VAR) and final expression results\n * (HALT return), these must survive arena.reset() in the next scroll frame.\n */\nexport function persistentValue(v: Value): Value {\n\tconst p = new Value(v.type, v.value, v.unit);\n\t// The exact sidecar has to survive being stored in a variable, or a\n\t// referenced money value would silently drop back to the double: \"a = $0.10,\n\t// b = $0.20, a + b\" must still be exact across the STORE_VAR round trip.\n\tif (v.exact !== undefined) p.exact = v.exact;\n\t// The rational sidecar survives the same round trip, so \"a = 1/3, a + a + a\"\n\t// is exactly 1 rather than the drifted double a stored fraction would carry.\n\tif (v.rational !== undefined) p.rational = v.rational;\n\t// The uncertainty sidecar survives too, so \"a = 12.3 +/- 0.5, a * 4\" still\n\t// propagates the tolerance across the STORE_VAR round trip.\n\tif (v.uncertainty !== undefined) p.uncertainty = v.uncertainty;\n\treturn p;\n}\n\n// ── Dev-mode immutability guard (Part II, L5, Value model hardening) ──\n//\n// Value is documented immutable by convention, not enforcement: the arena\n// mutates objects in place via recycle() (by design, for Tier-2 scroll\n// performance), so Value can never be unconditionally frozen. This guard\n// freezes a Value ONLY when it is safe to do so, i.e. NOT while the arena\n// is active, since an arena-active Value may still be recycled later in\n// the same scroll frame. It is a no-op outside development builds (matches\n// the existing `process.env.NODE_ENV === \"development\"` convention used by\n// the app-layer logger) so there is zero runtime cost in production.\nconst isDevelopmentBuild = process.env.NODE_ENV === \"development\";\n\n/**\n * Freeze a Value in development builds, catching accidental external\n * mutation of \"immutable\" results early. Safe to call unconditionally\n * it is a no-op in production and a no-op whenever the arena is active\n * (an arena-active Value may still be recycle()'d before this scroll\n * frame ends, and freezing it would make recycle() throw).\n *\n * Intended for values leaving a public evaluation boundary\n * (ExpressionEngine.evaluateLine* / evaluateExpression), not for values\n * still moving through internal VM/arena machinery.\n */\nexport function freezeIfDev<T extends Value>(value: T): T {\n\tif (isDevelopmentBuild && !isArenaActive()) {\n\t\t// toNumber() lazily memoizes _cachedNumber for bigint/string values\n\t\t// (Number/Hex are already eagerly cached by the constructor), warm\n\t\t// it now so a later toNumber() call on the frozen object doesn't\n\t\t// try to write to a frozen field.\n\t\tvalue.toNumber();\n\t\tObject.freeze(value);\n\t}\n\treturn value;\n}\n\n/**\n * Universal runtime value for the solve-js VM.\n *\n * Carries a {@link ValueType} discriminant, a polymorphic `value` payload,\n * and an optional `unit` string (for UoM values). Treated as immutable after\n * construction, the arena reuses objects internally via `recycle()`, but\n * external code should never mutate Value fields.\n *\n * A cached `_cachedNumber` avoids repeated `toNumber()` computation on\n * hot paths (ADD/SUB/MUL in the VM dispatch loop).\n */\nexport class Value {\n\t// Cached numeric representation, computed once on first toNumber() call.\n\t// Cleared on recycle() when the arena reuses this Value for a new value.\n\tprivate _cachedNumber: number | undefined;\n\n\t// Fields are NOT readonly, the arena reuses Value objects by calling\n\t// recycle() which overwrites all fields. External code should treat Values\n\t// as immutable after construction (arena handles mutation internally).\n\tpublic type: ValueType;\n\tpublic value: number | bigint | string | boolean | MatrixData | RangeData | ColourData | SplitData | SymbolicNode;\n\tpublic unit?: string;\n\t/** Set by async resolvers when a fetch timed out, the result is a fallback (typically 0). */\n\tpublic timedOut?: boolean;\n\t/**\n\t * The exact base-ten value this Value stands for, when it has one.\n\t *\n\t * A sidecar rather than a replacement for `value`: money and decimal-point\n\t * literals set it to a {@link DecimalData} so that same-currency arithmetic\n\t * and display can be exact (\"$0.10 + $0.20\" is \"$0.30\", not\n\t * \"$0.30000000000000004\"), while `value` stays the nearest double so every\n\t * existing consumer that reads `.value` or `toNumber()` is unchanged. The\n\t * plain Number-times-Number fast paths deliberately ignore it, which is why\n\t * a bare \"0.1 + 0.2\" still answers the double it always did: exactness is\n\t * carried only where a unit-bearing operand asks for it. Cleared by\n\t * {@link recycle} so a reused arena Value never inherits a stale exact.\n\t */\n\tpublic exact?: DecimalData;\n\t/**\n\t * The exact rational value this Value stands for, when it has one.\n\t *\n\t * The second sidecar, the same shape as {@link exact} and for the same\n\t * reason: a fraction has no exact base-ten form (`1/3` is not any decimal),\n\t * so exact fraction arithmetic needs a numerator/denominator pair rather\n\t * than a coefficient and a scale. Integer division seeds it (\"1/3\" carries\n\t * the {@link Rational} 1/3), and `+`, `-`, `*`, `/` between rational-bearing\n\t * numbers keep it reduced, so \"1/49 * 49\" is exactly 1 and \"5/6 - 1/6 - 1/6\n\t * - 1/6 - 1/6 - 1/6\" is exactly 0 rather than the 1.6e-16 the doubles drift\n\t * to. `value` still holds the nearest double, recomputed from the exact\n\t * rational so accumulation error never creeps in, which is why the default\n\t * display and every `.value`/`toNumber()` reader are unchanged. Only a\n\t * fraction written with \"/\" carries it, so a decimal literal (\"0.1\") and a\n\t * transcendental result (\"sqrt(2)\") stay the plain doubles they were.\n\t * Cleared by {@link recycle} alongside {@link exact}.\n\t */\n\tpublic rational?: Rational;\n\t/**\n\t * The one-sigma uncertainty (standard error) this value carries, when it\n\t * has one.\n\t *\n\t * The third sidecar, the same shape as {@link exact} and {@link rational}\n\t * and for the same reason: a measurement written `12.3 ± 0.5` is still the\n\t * number 12.3 everywhere it is read as one, so the type stays\n\t * {@link ValueType.Number} and `value` stays the center, while this non\n\t * negative field carries the tolerance. The `±` (or ASCII `+/-`) operator\n\t * seeds it, and `+`, `-`, `*`, `/` propagate it in quadrature for\n\t * independent errors (see `vm/VMConversion.ts`'s `uncertainOp`). Everything\n\t * else (a comparison, a transcendental function, a unit conversion) reads\n\t * the center through `toNumber()` and drops the tolerance, which is why a\n\t * value with no uncertainty behaves exactly as a plain number always did.\n\t * Cleared by {@link recycle} alongside the other two sidecars.\n\t */\n\tpublic uncertainty?: number;\n\t/**\n\t * The number of decimal places this value should DISPLAY at, when it has been\n\t * given an explicit precision.\n\t *\n\t * A display sidecar, not a value one: `value` is unchanged, so every\n\t * `.value`/`toNumber()` reader and all arithmetic behave exactly as before,\n\t * and a value with no `decimalPlaces` formats the way it always did (the\n\t * global two-place default with trailing zeros trimmed). It is set only by an\n\t * explicit precision request, `<x> to N dp` and `round(x, N)`, so that\n\t * `3.14159 to 4 dp` shows `3.1416` and `1.5 to 2 dp` shows `1.50` rather than\n\t * the value being rounded but then displayed at the default two places. It is\n\t * NOT propagated through arithmetic (a later `+ 1` re-decides precision),\n\t * which is why nothing that did not ask for a precision is affected. Cleared\n\t * by {@link recycle} alongside the other sidecars.\n\t */\n\tpublic decimalPlaces?: number;\n\n\tconstructor(\n\t\ttype: ValueType,\n\t\tvalue: number | bigint | string | boolean | MatrixData | RangeData | ColourData | SplitData | SymbolicNode,\n\t\tunit?: string\n\t) {\n\t\tthis.type = type;\n\t\tthis.value = value;\n\t\tthis.unit = unit;\n\t\t// Eagerly cache for Number and Hex types (the most common case).\n\t\t// This avoids a method call + type-check on first toNumber().\n\t\tif (typeof value === 'number') {\n\t\t\tthis._cachedNumber = value;\n\t\t}\n\t}\n\n\t/**\n\t * Phase 5.3: Reset all fields for arena reuse.\n\t * Called by ValueArena.acquire(), zero allocation, just field assignment.\n\t */\n\trecycle(type: ValueType, value: number | bigint | string | boolean | MatrixData | RangeData | ColourData | SplitData | SymbolicNode, unit?: string): void {\n\t\tthis.type = type;\n\t\tthis.value = value;\n\t\tthis.unit = unit;\n\t\t// Clear cache, value changed, cached number is stale.\n\t\t// Re-eager-cache for Number type (most common).\n\t\tthis._cachedNumber = typeof value === 'number' ? value : undefined;\n\t\t// Clear timeout flag, recycled Values shouldn't inherit stale metadata.\n\t\tthis.timedOut = undefined;\n\t\t// Clear the exact sidecar for the same reason: a reused Value that once\n\t\t// held money must not carry that money's decimal into a plain number.\n\t\tthis.exact = undefined;\n\t\t// The rational sidecar clears with it: a reused Value that once held a\n\t\t// fraction must not carry that fraction into a plain number.\n\t\tthis.rational = undefined;\n\t\t// The uncertainty sidecar clears the same way: a reused Value that once\n\t\t// carried a tolerance must not lend it to a plain number.\n\t\tthis.uncertainty = undefined;\n\t\t// The display-precision sidecar clears too: a reused Value that once had\n\t\t// an explicit `to N dp` must not display a plain number at that precision.\n\t\tthis.decimalPlaces = undefined;\n\t}\n\n\tisNumber(): this is Value & { value: number } {\n\t\treturn this.type === ValueType.Number;\n\t}\n\n\tisHex(): this is Value & { value: number } {\n\t\treturn this.type === ValueType.Hex;\n\t}\n\n\tisBigInt(): this is Value & { value: bigint } {\n\t\treturn this.type === ValueType.BigInt;\n\t}\n\n\tisString(): this is Value & { value: string } {\n\t\treturn this.type === ValueType.String;\n\t}\n\n\tisMatrix(): this is Value & { value: MatrixData } {\n\t\treturn this.type === ValueType.Matrix;\n\t}\n\n\t/** A Matrix shaped like a vector, 1×N (row) or N×1 (column). */\n\tisVectorShape(): boolean {\n\t\tif (this.type !== ValueType.Matrix) return false;\n\t\tconst m = this.value as MatrixData;\n\t\treturn m.rows === 1 || m.cols === 1;\n\t}\n\n\tisRange(): this is Value & { value: RangeData } {\n\t\treturn this.type === ValueType.Range;\n\t}\n\n\tisColour(): this is Value & { value: ColourData } {\n\t\treturn this.type === ValueType.Colour;\n\t}\n\n\tisSymbolic(): this is Value & { value: SymbolicNode } {\n\t\treturn this.type === ValueType.Symbolic;\n\t}\n\n\t/**\n\t * An Error value: a fault carrying a code and message, propagated through the\n\t * DAG when a plugin or opcode cannot produce a quantity.\n\t *\n\t * An Error reads as the number 0 through {@link toNumber}, so a numeric\n\t * consumer that does not check this first cannot tell the fault apart from a\n\t * real zero: exactly the silently-wrong result the engine guards against\n\t * internally with {@link faultedOperand}. A host reading a live {@link Value}\n\t * off a result should branch on this (or {@link isFault}) before trusting the\n\t * number, and read {@link errorCode}/{@link errorMessage} for the detail.\n\t */\n\tisError(): boolean {\n\t\treturn this.type === ValueType.Error;\n\t}\n\n\t/**\n\t * A Pending value: an async result that has not yet resolved, holding the\n\t * query key it is waiting on. Reads as 0 through {@link toNumber}, the same\n\t * caveat as {@link isError}: a settled value arrives on a later evaluation.\n\t */\n\tisPending(): boolean {\n\t\treturn this.type === ValueType.Pending;\n\t}\n\n\t/**\n\t * Either fault, an Error or a Pending: the single predicate to check before\n\t * trusting {@link toNumber}. It mirrors the internal {@link faultedOperand}\n\t * rule that every opcode applies to its operands, so a host reading a result\n\t * makes the same distinction the engine does rather than computing with a\n\t * zero it cannot tell from a real one.\n\t */\n\tisFault(): boolean {\n\t\treturn this.type === ValueType.Error || this.type === ValueType.Pending;\n\t}\n\n\t/**\n\t * The stable {@link ErrorFactory} code of an Error value, else `undefined`.\n\t *\n\t * The code is the machine-branchable identifier (the message is the\n\t * human-facing text, {@link errorMessage}). It reads from the same slot\n\t * {@link errorValue} writes, so it is defined for exactly the values\n\t * {@link isError} accepts and `undefined` for every other type.\n\t */\n\tget errorCode(): string | undefined {\n\t\treturn this.type === ValueType.Error ? (this.value as string) : undefined;\n\t}\n\n\t/**\n\t * The human-facing message of an Error value, else `undefined`. Paired with\n\t * {@link errorCode}, which carries the branchable identifier.\n\t */\n\tget errorMessage(): string | undefined {\n\t\treturn this.type === ValueType.Error ? this.unit : undefined;\n\t}\n\n\ttoNumber(): number {\n\t\t// Pending/Error have no numeric representation at all, 0 (established\n\t\t// convention). A genuinely multi-cell Matrix has no single numeric\n\t\t// representation either (real callers branch on `.isMatrix()` BEFORE\n\t\t// reaching this fallback. See e.g. VM.ts's MUL/comparison dispatch)\n\t\t// but a 1x1 Matrix, the shape `float(x)`'s legacy sugar produces, see\n\t\t// packages/vector/parselets/FloatParselet.ts, IS a scalar in every\n\t\t// meaningful sense, so it degrades to that single cell's numeric value\n\t\t// rather than 0 (this exact case used to work \"by accident\" pre-Matrix,\n\t\t// since `parseFloat([2].toString())` happened to yield `2`).\n\t\tif (this.type === ValueType.Pending) return 0;\n\t\tif (this.type === ValueType.Error) return 0;\n\t\tif (this.type === ValueType.Matrix) {\n\t\t\tconst m = this.value as MatrixData;\n\t\t\tif (m.rows === 1 && m.cols === 1 && typeof m.data[0] === \"number\") return m.data[0];\n\t\t\treturn 0;\n\t\t}\n\t\tif (this.type === ValueType.Range) return 0;\n\t\t// A colour is a struct of channels, not a scalar; like Matrix/Range it has\n\t\t// no single numeric reading. Callers branch on `.isColour()` first.\n\t\tif (this.type === ValueType.Colour) return 0;\n\t\t// A split is a structured multi-share result; its scalar reading is the\n\t\t// \"each\" (base) share, so a numeric consumer or the worker DTO's number\n\t\t// field still gets a sensible value where a caller does not branch first.\n\t\tif (this.type === ValueType.Split) return (this.value as SplitData).shares[0].value;\n\t\t// A symbolic expression has no single concrete numeric value by\n\t\t// definition (it's a free-variable formula), 0, matching the\n\t\t// Pending/Error/Range convention. Real callers branch on\n\t\t// `.isSymbolic()` BEFORE reaching this fallback (see\n\t\t// `VMConversion.ts`'s `binaryOp()`).\n\t\tif (this.type === ValueType.Symbolic) return 0;\n\t\t// A boolean has an obvious numeric reading and no branch used to give it\n\t\t// one, so it fell through to `parseFloat(true)` -> NaN -> 0, and BOTH\n\t\t// booleans read as zero: `true == false` answered true, and every\n\t\t// arithmetic path that mixes a boolean with a number (\"true and 5\")\n\t\t// contributed nothing. 1/0 is the reading every language with a numeric\n\t\t// boolean coercion uses, and the one `if 1 then` already implies.\n\t\tif (this.type === ValueType.Boolean) return this.value === true ? 1 : 0;\n\n\t\tif (this._cachedNumber !== undefined) return this._cachedNumber;\n\n\t\tif (typeof this.value === 'bigint') {\n\t\t\tthis._cachedNumber = Number(this.value);\n\t\t\treturn this._cachedNumber;\n\t\t}\n\t\t// Prevent silent NaN propagation from non-numeric strings\n\t\tconst result = parseFloat(this.value as string);\n\t\tthis._cachedNumber = isNaN(result) ? 0 : result;\n\t\treturn this._cachedNumber;\n\t}\n\n\tisNaN(): boolean {\n\t\tif (this.type === ValueType.Pending) return false;\n\t\tif (this.type === ValueType.Error) return false;\n\t\tif (this.type === ValueType.Matrix) {\n\t\t\tconst m = this.value as MatrixData;\n\t\t\tif (m.rows === 1 && m.cols === 1 && typeof m.data[0] === \"number\") return isNaN(m.data[0]);\n\t\t\treturn false;\n\t\t}\n\t\tif (this.type === ValueType.Range) return false;\n\t\tif (this.type === ValueType.Colour) return false;\n\t\tif (this.type === ValueType.Split) return false;\n\t\tif (this.type === ValueType.Symbolic) return false;\n\t\t// Matches toNumber()'s boolean reading above. Without this a Boolean\n\t\t// reached the string branch at the bottom and `parseFloat(true)` made\n\t\t// every boolean report itself as NaN.\n\t\tif (this.type === ValueType.Boolean) return false;\n\t\tif (typeof this.value === 'number') return isNaN(this.value);\n\t\tif (typeof this.value === 'bigint') return false;\n\t\treturn isNaN(parseFloat(this.value as string));\n\t}\n}\n\n/**\n * Create a Number-typed Value. Uses the arena when active for zero-allocation.\n * This is the most common factory, over 90% of all Value creations.\n */\nexport function numberValue(n: number): Value {\n\tif (_arenaActive && _arena) return _arena.acquire(ValueType.Number, n);\n\treturn new Value(ValueType.Number, n);\n}\n\n/**\n * A Number that also carries the exact decimal it was written as.\n *\n * The type stays {@link ValueType.Number} and `value` stays the nearest double,\n * so this Value behaves exactly like any other number everywhere it is read as\n * one. The `exact` sidecar only matters when it later meets a currency: that is\n * what lets \"$0.70 * 1.10\" be exact while \"0.1 + 0.2\" stays the double it was.\n * Decimal-point literals are compiled to this (see the PUSH_DECIMAL opcode).\n */\nexport function numberValueExact(n: number, exact: DecimalData): Value {\n\tconst v = numberValue(n);\n\tv.exact = exact;\n\treturn v;\n}\n\n/**\n * A Number that also carries the exact rational it evaluates to.\n *\n * The rational counterpart of {@link numberValueExact}: the type stays\n * {@link ValueType.Number} and `value` stays the nearest double (recomputed\n * from the rational, so a chain of fraction operations never accumulates\n * float error), so this reads as an ordinary number everywhere. The `rational`\n * sidecar is what keeps the next fraction operation and any `as fraction`\n * exact. Integer division produces this (see the DIV opcode).\n */\nexport function numberValueRational(n: number, rational: Rational): Value {\n\tconst v = numberValue(n);\n\tv.rational = rational;\n\treturn v;\n}\n\n/**\n * A Number that also carries a one-sigma uncertainty (standard error).\n *\n * The uncertainty counterpart of {@link numberValueExact}: the type stays\n * {@link ValueType.Number} and `value` stays the center, so this reads as an\n * ordinary number everywhere. The `uncertainty` sidecar is what lets `+`, `-`,\n * `*`, `/` propagate the tolerance in quadrature. The `±` operator produces\n * this (see the MAKE_UNCERTAIN opcode), as does any of those four ops when an\n * operand already carries one. The magnitude is stored as given, callers pass a\n * non-negative value (`Math.abs` at the seam, quadrature results are already\n * non-negative).\n */\nexport function numberValueUncertain(n: number, uncertainty: number): Value {\n\tconst v = numberValue(n);\n\tv.uncertainty = uncertainty;\n\treturn v;\n}\n\n/** Which base a {@link ValueType.Hex} value is displayed in. */\nexport type DisplayBase = \"hex\" | \"bin\" | \"oct\";\n\n/**\n * Create a Hex-typed Value: a **number** that displays in another base.\n *\n * The type is numeric on purpose, and that is the whole point of it. A base is\n * a way of writing a quantity, not a different kind of quantity, so `0xFF + 1`\n * has to be 256. Returning a string instead makes it 1, because a string reads\n * as zero in arithmetic, and nothing about that failure is visible at the point\n * of use.\n *\n * @param n - The number itself, in full precision. A `bigint` is accepted for\n * the same reason the type is numeric at all: `12345678901234567890n as hex`\n * has an exact answer, and forcing it through a double first rendered\n * 0xAB54A98CEB1F0800 for a value ending 0AD2.\n * @param base - How to display it, defaulting to hexadecimal. Carried in the\n * `unit` slot, which is free for this type.\n */\nexport function hexValue(n: number | bigint, base: DisplayBase = \"hex\"): Value {\n\tconst tag = base === \"hex\" ? undefined : base;\n\tif (_arenaActive && _arena) return _arena.acquire(ValueType.Hex, n, tag);\n\treturn new Value(ValueType.Hex, n, tag);\n}\n\n/** Create a BigInt-typed Value (arbitrary-precision integer). */\nexport function bigIntValue(n: bigint): Value {\n\tif (_arenaActive && _arena) return _arena.acquire(ValueType.BigInt, n);\n\treturn new Value(ValueType.BigInt, n);\n}\n\n/** Create a String-typed Value. */\nexport function stringValue(s: string): Value {\n\tif (_arenaActive && _arena) return _arena.acquire(ValueType.String, s);\n\treturn new Value(ValueType.String, s);\n}\n\n/** Create a Unit-of-Measurement Value (typed number with unit annotation). */\nexport function uomValue(n: number, unit: string): Value {\n\tif (_arenaActive && _arena) return _arena.acquire(ValueType.Uom, n, unit);\n\treturn new Value(ValueType.Uom, n, unit);\n}\n\n/**\n * A unit-of-measurement Value that also carries an exact decimal magnitude.\n *\n * This is how money keeps its precision: `value` is the nearest double (so\n * `toNumber()` and every existing Uom path are unchanged), and `exact` is the\n * decimal the amount really is. Same-currency arithmetic reads `exact` to stay\n * exact, and the formatter reads it to round a half-cent the way a ledger does\n * rather than the way `toFixed` does on a double.\n */\nexport function uomValueExact(n: number, unit: string, exact: DecimalData): Value {\n\tconst v = uomValue(n, unit);\n\tv.exact = exact;\n\treturn v;\n}\n\n// ── Rate, \"quantity per unit of something\" (SoulverCore: `$99/week`\n// `3 hours/day`, `30 fps`). Represented as a `ValueType.Uom` (no new\n// ValueType, a rate IS a unit-of-measurement, just a compound one) whose\n// `unit` string is `\"<numerator>/<denominator>\"`. The numerator is an\n// opaque label (may be a real convertible unit like \"USD\"/\"km\", or a bare\n// tag like \"frames\" that the `convert` package doesn't know about, rate\n// arithmetic never needs to convert the numerator, only compare it for\n// equality when combining two rates). The denominator MUST be a unit\n// `convertUnit()`/`getMeasure()` (uom/UomConverter.ts) recognizes, since\n// that's the part rate arithmetic actually rescales. See `vm/VM.ts`'s\n// `RATE_CONVERT`/`RATE_MUL`/`RATE_DIV` opcodes for the operations built on\n// this representation.\n\n/** Create a Rate value: `magnitude` of `numeratorUnit` per one `denominatorUnit`. */\nexport function rateValue(magnitude: number, numeratorUnit: string, denominatorUnit: string): Value {\n\treturn uomValue(magnitude, `${numeratorUnit}/${denominatorUnit}`);\n}\n\n/** Whether `unit` is a compound rate unit (`\"X/Y\"`) rather than a plain unit. */\nexport function isRateUnit(unit: string | undefined): unit is string {\n\treturn typeof unit === \"string\" && unit.includes(\"/\");\n}\n\n/**\n * Split a rate unit string into its numerator/denominator halves.\n * @throws if `unit` isn't a rate unit, check with {@link isRateUnit} first.\n */\nexport function splitRateUnit(unit: string): { numerator: string; denominator: string } {\n\tconst idx = unit.indexOf(\"/\");\n\tif (idx < 0) {\n\t\tthrow ErrorFactory.internal(\n\t\t\t\"INVALID_RATE_UNIT\",\n\t\t\t`splitRateUnit: \"${unit}\" is not a rate unit (expected \"numerator/denominator\")`,\n\t\t\t{ unit },\n\t\t);\n\t}\n\treturn { numerator: unit.slice(0, idx), denominator: unit.slice(idx + 1) };\n}\n\n/** Join a numerator/denominator pair back into a rate unit string. */\nexport function joinRateUnit(numeratorUnit: string, denominatorUnit: string): string {\n\treturn `${numeratorUnit}/${denominatorUnit}`;\n}\n\n// ── Video timecode, \"HH:MM:SS:FF at a given fps\" (SoulverCore: video\n// editing timecode literals, e.g. `01:02:03:04 at 30fps`). Represented the\n// same way Rate is above: NOT a new ValueType, just a `ValueType.Uom` whose\n// `unit` string is `\"timecode@<fps>\"` and whose numeric `value` is the\n// TOTAL FRAME COUNT since 00:00:00:00 at that fps, e.g. \"00:00:01:00 at\n// 30fps\" is `Uom(30, \"timecode@30\")`.\n//\n// Storing the total frame count (rather than four separate H/M/S/F fields)\n// means ordinary integer addition/subtraction on the numeric value is\n// ALREADY correct carry/borrow-aware arithmetic with zero extra logic\n// e.g. \"frame 29 + 2 frames\" at 30fps is just `29 + 2 = 31`, and 31 total\n// frames at 30fps IS frame 1 of the next second, with no explicit carry\n// step required. Carry/borrow only needs to be reconstructed when\n// converting a total frame count back into HH:MM:SS:FF display notation\n// see `packages/time/timecode/TimecodeMath.ts`'s `framesToTimecodeString()`.\n// See `vm/VM.ts`'s ADD/SUB dispatch for the arithmetic built on this\n// representation (timecode + frames, + duration, + timecode, - timecode).\n\nconst TIMECODE_UNIT_PREFIX = \"timecode@\";\n\n/** Build a timecode Uom unit string embedding its frame rate, e.g. `timecodeUnit(30)` -> `\"timecode@30\"`. */\nexport function timecodeUnit(fps: number): string {\n\treturn `${TIMECODE_UNIT_PREFIX}${fps}`;\n}\n\n/** Whether `unit` is a compound video-timecode unit (`\"timecode@<fps>\"`). */\nexport function isTimecodeUnit(unit: string | undefined): unit is string {\n\treturn typeof unit === \"string\" && unit.startsWith(TIMECODE_UNIT_PREFIX);\n}\n\n/**\n * Extract the fps from a timecode unit string.\n * @throws if `unit` isn't a timecode unit, check with {@link isTimecodeUnit} first.\n */\nexport function timecodeFps(unit: string): number {\n\tif (!isTimecodeUnit(unit)) {\n\t\tthrow ErrorFactory.internal(\n\t\t\t\"INVALID_TIMECODE_UNIT\",\n\t\t\t`timecodeFps: \"${unit}\" is not a timecode unit (expected \"timecode@<fps>\")`,\n\t\t\t{ unit },\n\t\t);\n\t}\n\treturn parseFloat(unit.slice(TIMECODE_UNIT_PREFIX.length));\n}\n\n/**\n * Create a Matrix value from an explicit shape + column-major data array.\n * `data.length` must equal `rows*cols`, callers building a matrix from\n * row-major source syntax (e.g. the `[1,2;3,4]` literal) must transpose\n * into column-major order before calling this; see `MatrixOps.ts`'s\n * `rowMajorToColumnMajor()`.\n */\nexport function matrixValue(rows: number, cols: number, data: readonly MatrixEntry[]): Value {\n\t// Every matrix in the engine is born here, which makes this the one place\n\t// that can charge for one without each producer having to remember to. The\n\t// charge lands after `data` exists, so it is a backstop rather than a\n\t// refusal: it cannot stop a single allocation that is already fatal (the\n\t// sites whose size is knowable in advance charge before allocating, see\n\t// `vm/VM.ts`'s matrix cases), but it does stop the second one, and it means\n\t// an opcode added later inherits the bound without being told about it.\n\t// Free in relative terms: the hasSymbolic scan just below is already O(n)\n\t// over the same cells.\n\tchargeAllocation(data.length, \"matrix cells\");\n\t// A SymbolicNode cell is the only object-typed MatrixEntry variant\n\t// (number/boolean are primitives), a cheap, always-correct way to\n\t// derive hasSymbolic without asking every caller to track it by hand.\n\t// The `\"kind\" in cell` half is a tripwire, not redundancy. MatrixEntry is\n\t// `number | boolean | SymbolicNode`, so an object cell should always be a\n\t// node; requiring the discriminant means a Rational that escaped\n\t// MatrixOps.ts's symbolicToEntry() shows up as a wrong result rather than as\n\t// a matrix that silently believes it is symbolic.\n\tconst hasSymbolic = data.some(cell => typeof cell === \"object\" && cell !== null && \"kind\" in cell);\n\tconst m: MatrixData = { rows, cols, data, hasSymbolic };\n\tif (_arenaActive && _arena) return _arena.acquire(ValueType.Matrix, m);\n\treturn new Value(ValueType.Matrix, m);\n}\n\n/** A 1×N row-vector Matrix, row-major and column-major storage are identical for a single row. */\nexport function rowVectorValue(data: readonly number[]): Value {\n\treturn matrixValue(1, data.length, data);\n}\n\n/** An N×1 column-vector Matrix, row-major and column-major storage are identical for a single column. */\nexport function colVectorValue(data: readonly number[]): Value {\n\treturn matrixValue(data.length, 1, data);\n}\n\n/** Create a Range value, a first-class integer range `min:max`, both bounds inclusive. */\nexport function rangeValue(min: number, max: number): Value {\n\tconst r: RangeData = { min, max };\n\tif (_arenaActive && _arena) return _arena.acquire(ValueType.Range, r);\n\treturn new Value(ValueType.Range, r);\n}\n\n/**\n * Create a Colour value from canonical sRGB channels plus a display format.\n * Arena-backed like the other synchronous factories; the `ColourData` struct in\n * the `value` slot is immutable, so arena recycle is safe with no extra clearing\n * (matching {@link matrixValue}/{@link rangeValue}).\n */\nexport function colourValue(c: ColourData): Value {\n\tif (_arenaActive && _arena) return _arena.acquire(ValueType.Colour, c);\n\treturn new Value(ValueType.Colour, c);\n}\n\n/**\n * Create a Split value from its structured per-share payload. Arena-backed like\n * the other synchronous factories; the {@link SplitData} struct in the `value`\n * slot is immutable, so arena recycle is safe with no extra clearing (matching\n * {@link colourValue}/{@link rangeValue}).\n */\nexport function splitValue(data: SplitData): Value {\n\tif (_arenaActive && _arena) return _arena.acquire(ValueType.Split, data);\n\treturn new Value(ValueType.Split, data);\n}\n\n/** Create a Symbolic value, a free-variable algebraic expression tree (`symbolic/SymbolicNode.ts`'s `SymbolicNode`), not a concrete number. */\nexport function symbolicValue(node: SymbolicNode): Value {\n\tif (_arenaActive && _arena) return _arena.acquire(ValueType.Symbolic, node);\n\treturn new Value(ValueType.Symbolic, node);\n}\n\n\n\n/** Create a Boolean-typed Value. */\nexport function boolValue(b: boolean): Value {\n\tif (_arenaActive && _arena) return _arena.acquire(ValueType.Boolean, b);\n\treturn new Value(ValueType.Boolean, b);\n}\n\n/** Create a Datetime-typed Value (Unix timestamp in milliseconds). */\nexport function datetimeValue(n: number): Value {\n\tif (_arenaActive && _arena) return _arena.acquire(ValueType.Datetime, n);\n\treturn new Value(ValueType.Datetime, n);\n}\n\n/** Create a Percentage-typed Value (stored as fraction, e.g. 0.5 for 50%). */\nexport function percentageValue(n: number): Value {\n\tif (_arenaActive && _arena) return _arena.acquire(ValueType.Percentage, n);\n\treturn new Value(ValueType.Percentage, n);\n}\n\n/**\n * Create a Pending value, signals that an async result is not yet resolved.\n * The value field stores the queryKey string for deduplication and diagnostics.\n * Pending values should NEVER be stored in the arena (they persist across\n * scroll frames until resolution completes).\n */\nexport function pendingValue(queryKey: string): Value {\n\treturn new Value(ValueType.Pending, queryKey);\n}\n\n/**\n * Create an Error value, propagated through the DAG when a plugin raises an error.\n * The value field stores the EngineError code, unit stores the message.\n * Downstream consumers (lines that depend on errored data) bubble this up.\n * Should NEVER be stored in the arena.\n */\nexport function errorValue(code: string, message: string): Value {\n\treturn new Value(ValueType.Error, code, message);\n}\n\n/**\n * The first operand carrying a fault rather than a quantity, if any does.\n *\n * `Error` and `Pending` both read as the number 0 through {@link Value.toNumber},\n * by a convention that only holds up as long as nothing asks. Every opcode and\n * builtin that reaches for an operand's number without asking its type first\n * therefore computes with a zero it cannot tell apart from a real one, and\n * hands back an answer dressed in whatever type it was going to produce\n * anyway. That is how `(5 kg to m) to s` came to answer `0.00 s`: the failed\n * conversion is an Error, the second conversion read it as zero, and the unit\n * the reader asked for made the result look like a conversion that worked.\n *\n * Operands are checked left to right, matching evaluation order, and the\n * faulted Value is returned AS IT IS rather than replaced with a fresh one, so\n * the original code and message (or the pending query key) reach the caller\n * unchanged. `binaryOp` (vm/VMConversion.ts) and `OpCode.EXP` already did this\n * inline; this is the same rule for every other site, in one place so a site\n * added later can adopt it in a line.\n *\n * Three operands cover every call site in the VM (`MAT_INDEX2` and `MAT_SLICE`\n * are the widest). A variadic signature would allocate an arguments array on\n * paths that run per instruction; see {@link faultedIn} for the list case.\n *\n * @returns The faulted operand, or `null` when all of them carry a value.\n */\nexport function faultedOperand(a: Value, b?: Value, c?: Value): Value | null {\n\tif (a.type === ValueType.Error || a.type === ValueType.Pending) return a;\n\tif (b !== undefined && (b.type === ValueType.Error || b.type === ValueType.Pending)) return b;\n\tif (c !== undefined && (c.type === ValueType.Error || c.type === ValueType.Pending)) return c;\n\treturn null;\n}\n\n/**\n * {@link faultedOperand} over an already-built list, for the call sites that\n * have one (a builtin's arguments, a plugin function's).\n *\n * @returns The first faulted element, or `null` when every element carries a value.\n */\nexport function faultedIn(values: readonly Value[]): Value | null {\n\tfor (let i = 0; i < values.length; i++) {\n\t\tconst v = values[i];\n\t\tif (v.type === ValueType.Error || v.type === ValueType.Pending) return v;\n\t}\n\treturn null;\n}\n"]}

package/dist/chunk-EVI6OHQH.cjs

@@ -0,0 +1,2 @@
+'use strict';var chunkSOMGSIO4_cjs=require('./chunk-SOMGSIO4.cjs');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 chunkSOMGSIO4_cjs.c.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 chunkSOMGSIO4_cjs.c.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 chunkSOMGSIO4_cjs.c.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 chunkSOMGSIO4_cjs.c.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:[]}}};exports.a=g;exports.b=l;exports.c=r;exports.d=c;//# sourceMappingURL=chunk-EVI6OHQH.cjs.map
+//# sourceMappingURL=chunk-EVI6OHQH.cjs.map

package/dist/chunk-EVI6OHQH.cjs.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":"mEAEE,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,mBAAAA,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,oBAAa,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,mBAAAA,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,mBAAAA,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-EVI6OHQH.cjs","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-FDE5HWDI.cjs

@@ -0,0 +1,2 @@
+'use strict';var chunkAXMQG5TS_cjs=require('./chunk-AXMQG5TS.cjs'),chunk4QVBSG6B_cjs=require('./chunk-4QVBSG6B.cjs'),chunk5IJD5L3O_cjs=require('./chunk-5IJD5L3O.cjs'),chunkMSYX32PF_cjs=require('./chunk-MSYX32PF.cjs'),chunkSOMGSIO4_cjs=require('./chunk-SOMGSIO4.cjs');var D=/^\d{1,3}(\.\d{3}){2,}$/,T=/^\d*\.\d*$/,n=class n{constructor(e,t=50,r="en",o){this.tokens=[];this.current=0;this.depth=0;this.currentExpression="";this.infixMinBindingPower=0;this.registry=e,this.maxDepth=t,this.localeCode=r,this.pluginFunctionIndex=o;}getLocaleCode(){return this.localeCode}setDiagnosticPipeline(e,t){this.diagnosticPipeline=e,this.currentExpression=t??"";}load(e,t){if(t===false){this.tokens=e,this.current=0,this.depth=0;return}let r=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.LPAREN),o=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.RPAREN),a=0;for(let l=0;l<e.length;l++)e[l].typeId===r?a++:e[l].typeId===o&&a--;this.tokens=a===0?e:this.balanceParens(e,a),this.current=0,this.depth=0;}balanceParens(e,t){let r=e.slice();if(t>0){let o=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.RPAREN);for(let a=0;a<t;a++){let l=e[e.length-1];r.push({type:chunk5IJD5L3O_cjs.a.RPAREN,typeId:o,value:")",text:")",offset:l?l.offset+l.text.length:0,lineBreaks:0,line:l?l.line:1,col:l?l.col+l.text.length:1});}}else if(t<0){let o=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.LPAREN);for(let a=0;a<-t;a++)r.unshift({type:chunk5IJD5L3O_cjs.a.LPAREN,typeId:o,value:"(",text:"(",offset:0,lineBreaks:0,line:1,col:1});}return r}parseExpression(e=0,t){if(t&&(this.builder=t),this.depth++,this.depth>this.maxDepth)throw this.depth--,chunkSOMGSIO4_cjs.c.parsing("NESTING_DEPTH_EXCEEDED",`Parse nesting depth ${this.depth} exceeds maximum of ${this.maxDepth}`,{maxDepth:this.maxDepth,currentDepth:this.depth});let r=this.consume();if(!r)throw this.depth--,chunkSOMGSIO4_cjs.c.parsing("UNEXPECTED_END","Unexpected end of expression");this.parsePrefix(r);let o=this.tokens,a=o.length,l=n.BP_TABLE,p=this.registry,d=this.builder,f=this.current;for(;f<a;){let u=o[f];if(!u)break;let c=l[u.typeId];if(c>0){if(c<=e)break;if(this.diagnosticPipeline){let m=p.getInfix(u.typeId);m&&this.fireParseletMatched(m,u,false,c);}this.current=++f;let I=u.typeId;if(I===n.PERCENT_ID)d.emitOpcode(10),d.emitNumber(100),d.emitOpcode(23),d.emitOpcode(74);else if(!(I===n.CARET_ID&&this.tryEmitMatrixCaretOp(d))){let m=I===n.CARET_ID?c-1:c+1;this.parseExpression(m,d),d.emitOpcode(n.INFIX_OPCODE[I]);}}else {let I=p.getInfix(u.typeId);if(!I||I.bindingPower<=e)break;this.current=++f,this.diagnosticPipeline&&this.fireParseletMatched(I,u,false,I.bindingPower),this.infixMinBindingPower=e,I.parse(this,r,u,d);}f=this.current;}this.current=f,this.depth--;}parsePrefix(e){let t=this.builder,r=e.typeId;if(this.diagnosticPipeline){let a=this.registry.getPrefix(r);a&&this.fireParseletMatched(a,e,true);}switch(r){case n.NUMBER_ID:{let a,l=null,p=e.value;if(p.startsWith("0x")||p.startsWith("0X")){if(a=parseInt(p,16),Number.isNaN(a))throw chunkSOMGSIO4_cjs.c.parsing("INVALID_NUMBER_LITERAL",`Invalid hex literal: "${p}"`,{raw:p})}else if(p.startsWith("0b")||p.startsWith("0B")){if(a=parseInt(p.slice(2),2),Number.isNaN(a))throw chunkSOMGSIO4_cjs.c.parsing("INVALID_NUMBER_LITERAL",`Invalid binary literal: "${p}"`,{raw:p})}else if(p.startsWith("0o")||p.startsWith("0O")){if(a=parseInt(p.slice(2),8),Number.isNaN(a))throw chunkSOMGSIO4_cjs.c.parsing("INVALID_NUMBER_LITERAL",`Invalid octal literal: "${p}"`,{raw:p})}else if(D.test(p))a=parseFloat(p.split(".").join(""));else {let d=chunkMSYX32PF_cjs.a(this.localeCode),f=d.display.decimalSeparator,u=d.display.thousandsSeparator,c=p;u&&(c=c.split(u).join("")),f&&f!=="."&&(c=c.replace(f,".")),a=parseFloat(c),T.test(c)&&(l=c);}if(l!==null){t.emitOpcode(16),t.emitString(l);return}t.emitOpcode(10),t.emitNumber(a);return}case n.BIGINT_ID:{t.emitOpcode(11),t.emitString(chunk4QVBSG6B_cjs.e(e.value,this.localeCode));return}case n.STRING_ID:{t.emitOpcode(13),t.emitString(e.value);return}case n.IDENT_ID:{if(this.peek()?.typeId===n.LPAREN_ID){this.parseUserFunctionDefOrCall(e,t);return}t.emitOpcode(60),t.emitString(e.value);return}case n.LPAREN_ID:{this.parseExpression(0,t);let a=1;for(;this.match(chunk5IJD5L3O_cjs.a.COMMA);)this.parseExpression(0,t),a++;this.consume(chunk5IJD5L3O_cjs.a.RPAREN),a>1&&(t.emitOpcode(152),t.emitIndex(1),t.emitIndex(a));return}case n.MINUS_ID:{this.parseExpression(chunk4QVBSG6B_cjs.a.Prefix,t),t.emitOpcode(26);return}case n.PLUS_ID:{this.parseExpression(chunk4QVBSG6B_cjs.a.Prefix,t),t.emitOpcode(27);return}case n.KEYWORD_ID:}let o=this.registry.getPrefix(r);if(!o)throw chunkSOMGSIO4_cjs.c.parsing("NO_PREFIX_PARSELET",`No prefix parselet found for token: ${e.type} ("${e.value}")`,{tokenType:e.type,tokenValue:e.value});o.parse(this,e,t);}tryEmitMatrixCaretOp(e){for(let t of n.CARET_SUFFIX_RULES)if(t.matches(this))return t.emit(this,e),true;return  false}findMatchingRParen(e){let t=0;for(let r=e;r<this.tokens.length;r++){let o=this.tokens[r];if(o.typeId===n.LPAREN_ID)t++;else if(o.typeId===n.RPAREN_ID&&(t--,t===0))return r}return null}parseUserFunctionDefOrCall(e,t){let r=this.findMatchingRParen(this.current);if(r===null){t.emitOpcode(60),t.emitString(e.value);return}this.tokens[r+1]?.type===chunk5IJD5L3O_cjs.a.EQUALS?this.parseUserFunctionDefinition(e,t):this.parseUserFunctionCall(e,t);}consumeParamName(){let e=this.peek();if(e?.type===chunk5IJD5L3O_cjs.a.IDENT||e?.type===chunk5IJD5L3O_cjs.a.UNIT)return this.consume(),e.value;throw chunkSOMGSIO4_cjs.c.parsing("USER_FUNCTION_INVALID_PARAM_NAME",`Expected a parameter name but got "${e?.type??"end of input"}"${e?` ("${e.value}")`:""}`,{actualType:e?.type})}parseUserFunctionDefinition(e,t){this.consume(chunk5IJD5L3O_cjs.a.LPAREN);let r=[];if(this.peek()?.type!==chunk5IJD5L3O_cjs.a.RPAREN)for(r.push(this.consumeParamName());this.match(chunk5IJD5L3O_cjs.a.COMMA);)r.push(this.consumeParamName());if(this.consume(chunk5IJD5L3O_cjs.a.RPAREN),this.consume(chunk5IJD5L3O_cjs.a.EQUALS),r.length===0)throw chunkSOMGSIO4_cjs.c.parsing("USER_FUNCTION_NO_PARAMS",`"${e.value}()" has no parameters -- user-defined functions need at least one (a zero-argument definition is indistinguishable from a plain function CALL with no args, which this grammar doesn't otherwise support)`,{name:e.value});let o=new chunk4QVBSG6B_cjs.d(this.pluginFunctionIndex);this.parseExpression(chunk4QVBSG6B_cjs.a.Lowest,o),this.setBuilder(t);let a=o.build();if(a.hasAsync)throw chunkSOMGSIO4_cjs.c.parsing("FUNCTION_BODY_MUST_BE_SYNCHRONOUS",`"${e.value}(...)"'s body calls an async operation (weather, stocks, currency, ...) \u2014 user-defined function bodies must be synchronous`,{name:e.value});let l=t.emitUserFunctionBody(e.value,r,a);t.emitOpcode(150),t.emitIndex(l),t.emitOpcode(13),t.emitString(`${e.value}(${r.join(", ")}) defined`);}parseUserFunctionCall(e,t){this.consume(chunk5IJD5L3O_cjs.a.LPAREN);let r=0;if(this.peek()?.type!==chunk5IJD5L3O_cjs.a.RPAREN)for(this.parseExpression(chunk4QVBSG6B_cjs.a.Lowest,t),r++;this.match(chunk5IJD5L3O_cjs.a.COMMA);)this.parseExpression(chunk4QVBSG6B_cjs.a.Lowest,t),r++;this.consume(chunk5IJD5L3O_cjs.a.RPAREN),t.emitOpcode(151),t.emitString(e.value),t.emitByte(r);}consume(e){let t=this.tokens[this.current];if(!t)throw chunkSOMGSIO4_cjs.c.parsing("UNEXPECTED_END_OF_INPUT","Unexpected end of input");if(e!==void 0){let r=chunk5IJD5L3O_cjs.c(e);if(t.typeId!==r)throw chunkSOMGSIO4_cjs.c.parsing("UNEXPECTED_TOKEN_TYPE",`Expected token type "${e}" but got "${t.type}" ("${t.value}")`,{expectedType:e,actualType:t.type,actualValue:t.value})}return this.current++,t}match(e){let t=this.peek();return t&&t.typeId===chunk5IJD5L3O_cjs.c(e)?(this.advance(),true):false}peek(){return this.tokens[this.current]}peekAt(e){return this.tokens[this.current+e]}previous(){return this.current>0?this.tokens[this.current-1]:void 0}advance(){this.current++;}setBuilder(e){this.builder=e;}fireParseletMatched(e,t,r,o){let a=this.diagnosticPipeline,l={type:chunkAXMQG5TS_cjs.c.ParseletMatched,elapsedNs:0,expression:this.currentExpression,tokenType:t.type,tokenValue:t.value,parseletCategory:e.category,parseletType:e.constructor?.name??"unknown",isPrefix:r,bindingPower:o,tokenOffset:t.offset||0};a.fireParseletMatched(l);}};n.BP_TABLE=chunk4QVBSG6B_cjs.b(),n.NUMBER_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.NUMBER),n.BIGINT_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.BIGINT),n.STRING_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.STRING),n.IDENT_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.IDENT),n.LPAREN_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.LPAREN),n.RPAREN_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.RPAREN),n.MINUS_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.MINUS),n.PLUS_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.PLUS),n.KEYWORD_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.KEYWORD),n.STAR_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.STAR),n.SLASH_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.SLASH),n.MOD_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.MOD),n.CARET_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.CARET),n.LSHIFT_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.LSHIFT),n.RSHIFT_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.RSHIFT),n.URSHIFT_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.URSHIFT),n.BIT_AND_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.BIT_AND),n.BIT_OR_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.BIT_OR),n.BIT_XOR_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.BIT_XOR),n.PERCENT_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.PERCENT),n.OF_ID=chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.OF),n.INFIX_OPCODE={[chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.PLUS)]:20,[chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.MINUS)]:21,[chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.STAR)]:22,[chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.SLASH)]:23,[chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.MOD)]:24,[chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.CARET)]:25,[chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.LSHIFT)]:30,[chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.RSHIFT)]:31,[chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.URSHIFT)]:32,[chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.BIT_AND)]:33,[chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.BIT_OR)]:34,[chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.BIT_XOR)]:35,[chunk5IJD5L3O_cjs.c(chunk5IJD5L3O_cjs.a.OF)]:22},n.CARET_SUFFIX_RULES=[{name:"transpose (^T)",matches:e=>{let t=e.peek();return t?.type===chunk5IJD5L3O_cjs.a.IDENT&&t.value==="T"},emit:(e,t)=>{e.advance(),t.emitOpcode(51),t.emitIndex(63),t.emitIndex(1);}},{name:"inverse (^-1)",matches:e=>{if(e.peek()?.typeId!==n.MINUS_ID)return  false;let r=e.peekAt(1);return r?.type===chunk5IJD5L3O_cjs.a.NUMBER&&r.value==="1"},emit:(e,t)=>{e.advance(),e.advance(),t.emitOpcode(51),t.emitIndex(65),t.emitIndex(1);}}];var v=n;var y=class{constructor(){this.prefixParselets=new Map;this.infixParselets=new Map;this.prefixById=new Map;this.infixById=new Map;}registerPrefix(e,t){let r=this.prefixParselets.get(e);r&&r!==t&&console.warn(`[ParseletRegistry] Prefix parselet for token "${e}" is already registered (category: "${r.category??"unknown"}"). Overwriting with a new parselet (category: "${t.category??"unknown"}") \u2014 the previous parselet is now unreachable. Two packages may be claiming the same token type.`),this.prefixParselets.set(e,t),this.prefixById.set(chunk5IJD5L3O_cjs.c(e),t);}registerInfix(e,t){let r=this.infixParselets.get(e);r&&r!==t&&console.warn(`[ParseletRegistry] Infix parselet for token "${e}" is already registered (category: "${r.category??"unknown"}"). Overwriting with a new parselet (category: "${t.category??"unknown"}") \u2014 the previous parselet is now unreachable. Two packages may be claiming the same token type.`),this.infixParselets.set(e,t),this.infixById.set(chunk5IJD5L3O_cjs.c(e),t);}getAllPrefix(){let e=[];for(let[t,r]of this.prefixParselets)e.push({tokenType:t,bindingPower:r.bindingPower??chunk4QVBSG6B_cjs.a.Prefix,category:r.category});return e}getAllInfix(){let e=[];for(let[t,r]of this.infixParselets){let o=r.bindingPower??0;e.push({tokenType:t,leftBindingPower:o,rightBindingPower:o+1,category:r.category});}return e}get prefixCount(){return this.prefixParselets.size}get infixCount(){return this.infixParselets.size}getPrefix(e){return typeof e=="number"?this.prefixById.get(e):this.prefixParselets.get(e)}getInfix(e){return typeof e=="number"?this.infixById.get(e):this.infixParselets.get(e)}hasPrefix(e){return this.prefixParselets.has(e)}hasInfix(e){return this.infixParselets.has(e)}clear(){this.prefixParselets.clear(),this.infixParselets.clear(),this.prefixById.clear(),this.infixById.clear();}},H=new y;exports.a=v;exports.b=y;exports.c=H;//# sourceMappingURL=chunk-FDE5HWDI.cjs.map
+//# sourceMappingURL=chunk-FDE5HWDI.cjs.map