solve-engine 2.15.0 → 2.17.0

package/dist/chunk-CUDPOWXA.js

@@ -1,2 +0,0 @@
-import {c as c$2}from'./chunk-JP4JMQOG.js';import {b,a as a$1,e,d}from'./chunk-Q3PSTNSY.js';import {c,a}from'./chunk-IJMNVBIS.js';import {a as a$2}from'./chunk-LHLW7JLS.js';import {c as c$1}from'./chunk-YAZ4DUJJ.js';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=c(a.LPAREN),o=c(a.RPAREN),a$1=0;for(let l=0;l<e.length;l++)e[l].typeId===r?a$1++:e[l].typeId===o&&a$1--;this.tokens=a$1===0?e:this.balanceParens(e,a$1),this.current=0,this.depth=0;}balanceParens(e,t){let r=e.slice();if(t>0){let o=c(a.RPAREN);for(let a$1=0;a$1<t;a$1++){let l=e[e.length-1];r.push({type: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=c(a.LPAREN);for(let a$1=0;a$1<-t;a$1++)r.unshift({type: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--,c$1.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--,c$1.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$1){let t=this.builder,r=e$1.typeId;if(this.diagnosticPipeline){let a=this.registry.getPrefix(r);a&&this.fireParseletMatched(a,e$1,true);}switch(r){case n.NUMBER_ID:{let a,l=null,p=e$1.value;if(p.startsWith("0x")||p.startsWith("0X")){if(a=parseInt(p,16),Number.isNaN(a))throw c$1.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 c$1.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 c$1.parsing("INVALID_NUMBER_LITERAL",`Invalid octal literal: "${p}"`,{raw:p})}else if(D.test(p))a=parseFloat(p.split(".").join(""));else {let d=a$2(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(e(e$1.value,this.localeCode));return}case n.STRING_ID:{t.emitOpcode(13),t.emitString(e$1.value);return}case n.IDENT_ID:{if(this.peek()?.typeId===n.LPAREN_ID){this.parseUserFunctionDefOrCall(e$1,t);return}t.emitOpcode(60),t.emitString(e$1.value);return}case n.LPAREN_ID:{this.parseExpression(0,t);let a$1=1;for(;this.match(a.COMMA);)this.parseExpression(0,t),a$1++;this.consume(a.RPAREN),a$1>1&&(t.emitOpcode(152),t.emitIndex(1),t.emitIndex(a$1));return}case n.MINUS_ID:{this.parseExpression(a$1.Prefix,t),t.emitOpcode(26);return}case n.PLUS_ID:{this.parseExpression(a$1.Prefix,t),t.emitOpcode(27);return}case n.KEYWORD_ID:}let o=this.registry.getPrefix(r);if(!o)throw c$1.parsing("NO_PREFIX_PARSELET",`No prefix parselet found for token: ${e$1.type} ("${e$1.value}")`,{tokenType:e$1.type,tokenValue:e$1.value});o.parse(this,e$1,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===a.EQUALS?this.parseUserFunctionDefinition(e,t):this.parseUserFunctionCall(e,t);}consumeParamName(){let e=this.peek();if(e?.type===a.IDENT||e?.type===a.UNIT)return this.consume(),e.value;throw c$1.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(a.LPAREN);let r=[];if(this.peek()?.type!==a.RPAREN)for(r.push(this.consumeParamName());this.match(a.COMMA);)r.push(this.consumeParamName());if(this.consume(a.RPAREN),this.consume(a.EQUALS),r.length===0)throw c$1.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 d(this.pluginFunctionIndex);this.parseExpression(a$1.Lowest,o),this.setBuilder(t);let a$2=o.build();if(a$2.hasAsync)throw c$1.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$2);t.emitOpcode(150),t.emitIndex(l),t.emitOpcode(13),t.emitString(`${e.value}(${r.join(", ")}) defined`);}parseUserFunctionCall(e,t){this.consume(a.LPAREN);let r=0;if(this.peek()?.type!==a.RPAREN)for(this.parseExpression(a$1.Lowest,t),r++;this.match(a.COMMA);)this.parseExpression(a$1.Lowest,t),r++;this.consume(a.RPAREN),t.emitOpcode(151),t.emitString(e.value),t.emitByte(r);}consume(e){let t=this.tokens[this.current];if(!t)throw c$1.parsing("UNEXPECTED_END_OF_INPUT","Unexpected end of input");if(e!==void 0){let r=c(e);if(t.typeId!==r)throw c$1.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===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:c$2.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=b(),n.NUMBER_ID=c(a.NUMBER),n.BIGINT_ID=c(a.BIGINT),n.STRING_ID=c(a.STRING),n.IDENT_ID=c(a.IDENT),n.LPAREN_ID=c(a.LPAREN),n.RPAREN_ID=c(a.RPAREN),n.MINUS_ID=c(a.MINUS),n.PLUS_ID=c(a.PLUS),n.KEYWORD_ID=c(a.KEYWORD),n.STAR_ID=c(a.STAR),n.SLASH_ID=c(a.SLASH),n.MOD_ID=c(a.MOD),n.CARET_ID=c(a.CARET),n.LSHIFT_ID=c(a.LSHIFT),n.RSHIFT_ID=c(a.RSHIFT),n.URSHIFT_ID=c(a.URSHIFT),n.BIT_AND_ID=c(a.BIT_AND),n.BIT_OR_ID=c(a.BIT_OR),n.BIT_XOR_ID=c(a.BIT_XOR),n.PERCENT_ID=c(a.PERCENT),n.OF_ID=c(a.OF),n.INFIX_OPCODE={[c(a.PLUS)]:20,[c(a.MINUS)]:21,[c(a.STAR)]:22,[c(a.SLASH)]:23,[c(a.MOD)]:24,[c(a.CARET)]:25,[c(a.LSHIFT)]:30,[c(a.RSHIFT)]:31,[c(a.URSHIFT)]:32,[c(a.BIT_AND)]:33,[c(a.BIT_OR)]:34,[c(a.BIT_XOR)]:35,[c(a.OF)]:22},n.CARET_SUFFIX_RULES=[{name:"transpose (^T)",matches:e=>{let t=e.peek();return t?.type===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===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(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(c(e),t);}getAllPrefix(){let e=[];for(let[t,r]of this.prefixParselets)e.push({tokenType:t,bindingPower:r.bindingPower??a$1.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;export{v as a,y as b,H as c};//# sourceMappingURL=chunk-CUDPOWXA.js.map
-//# sourceMappingURL=chunk-CUDPOWXA.js.map

package/dist/chunk-CUDPOWXA.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/parser/PrecedenceParser.ts","../src/parser/registry/ParseletRegistry.ts"],"names":["CHAINED_DOT_THOUSANDS_GROUPS","PLAIN_DECIMAL","_PrecedenceParser","parseletRegistry","maxDepth","localeCode","pluginFunctionIndex","pipeline","expression","tokens","hasParens","LPAREN_ID","tokenTypeId","TokenTypes","RPAREN_ID","openCount","i","result","lastToken","minBp","_builder","ErrorFactory","token","len","bpTable","registry","builder","idx","lookahead","bp","infixParselet","typeId","rightBp","parselet","v","decimalText","raw","locale","getLocale","decimalSep","thousandsSep","normalized","bigIntLiteralDigits","count","BindingPower","prefixParselet","rule","openIdx","depth","t","nameToken","closeIdx","params","bodyBuilder","BytecodeBuilder","bodyProgram","bodyIdx","argCount","expectedType","expectedId","offset","isPrefix","bindingPower","event","DiagnosticEventType","buildBindingPowerTable","p","next","afterMinus","PrecedenceParser","ParseletRegistry","tokenType","existing","left","sharedParseletRegistry"],"mappings":"wNAmBA,IAAMA,CAAAA,CAA+B,wBAAA,CAU/BC,CAAAA,CAAgB,YAAA,CAqBTC,CAAAA,CAAN,MAAMA,CAAiB,CAkF5B,WAAA,CAAYC,CAAAA,CAAoCC,CAAAA,CAAW,EAAA,CAAIC,CAAAA,CAAa,KAAMC,CAAAA,CAAmD,CAjFrI,IAAA,CAAQ,MAAA,CAAkB,EAAC,CAC3B,IAAA,CAAQ,OAAA,CAAU,CAAA,CAClB,IAAA,CAAQ,KAAA,CAAQ,CAAA,CAWhB,IAAA,CAAQ,iBAAA,CAA4B,GAWpC,IAAA,CAAA,oBAAA,CAAuB,CAAA,CA0DrB,IAAA,CAAK,QAAA,CAAWH,CAAAA,CAChB,IAAA,CAAK,QAAA,CAAWC,CAAAA,CAChB,IAAA,CAAK,UAAA,CAAaC,CAAAA,CAClB,IAAA,CAAK,mBAAA,CAAsBC,EAC7B,CAGA,aAAA,EAAwB,CACtB,OAAO,IAAA,CAAK,UACd,CAMA,qBAAA,CAAsBC,CAAAA,CAA0CC,CAAAA,CAA0B,CACxF,IAAA,CAAK,kBAAA,CAAqBD,CAAAA,CAC1B,IAAA,CAAK,iBAAA,CAAoBC,GAAc,GACzC,CAOA,IAAA,CAAKC,CAAAA,CAAiBC,CAAAA,CAA2B,CAC/C,GAAIA,CAAAA,GAAc,KAAA,CAAO,CACvB,IAAA,CAAK,MAAA,CAASD,CAAAA,CACd,IAAA,CAAK,OAAA,CAAU,CAAA,CACf,IAAA,CAAK,KAAA,CAAQ,CAAA,CACb,MACF,CAEA,IAAME,CAAAA,CAAYC,CAAAA,CAAYC,CAAAA,CAAW,MAAM,CAAA,CACzCC,CAAAA,CAAYF,CAAAA,CAAYC,CAAAA,CAAW,MAAM,CAAA,CAC3CE,GAAAA,CAAY,CAAA,CAChB,IAAA,IAASC,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIP,CAAAA,CAAO,MAAA,CAAQO,CAAAA,EAAAA,CAC7BP,CAAAA,CAAOO,CAAC,CAAA,CAAE,MAAA,GAAWL,CAAAA,CAAWI,GAAAA,EAAAA,CAC3BN,CAAAA,CAAOO,CAAC,CAAA,CAAE,MAAA,GAAWF,CAAAA,EAAWC,GAAAA,EAAAA,CAE3C,IAAA,CAAK,MAAA,CAASA,GAAAA,GAAc,CAAA,CAAIN,CAAAA,CAAS,IAAA,CAAK,aAAA,CAAcA,CAAAA,CAAQM,GAAS,CAAA,CAC7E,IAAA,CAAK,OAAA,CAAU,CAAA,CACf,IAAA,CAAK,KAAA,CAAQ,EACf,CAKQ,aAAA,CAAcN,CAAAA,CAAiBM,CAAAA,CAA4B,CACjE,IAAME,CAAAA,CAASR,CAAAA,CAAO,KAAA,EAAM,CAC5B,GAAIM,CAAAA,CAAY,CAAA,CAAG,CACjB,IAAMD,CAAAA,CAAYF,CAAAA,CAAYC,CAAAA,CAAW,MAAM,CAAA,CAC/C,IAAA,IAASG,GAAAA,CAAI,CAAA,CAAGA,IAAID,CAAAA,CAAWC,GAAAA,EAAAA,CAAK,CAClC,IAAME,CAAAA,CAAYT,CAAAA,CAAOA,CAAAA,CAAO,MAAA,CAAS,CAAC,CAAA,CAC1CQ,CAAAA,CAAO,IAAA,CAAK,CACV,IAAA,CAAMJ,CAAAA,CAAW,MAAA,CACjB,MAAA,CAAQC,CAAAA,CACR,KAAA,CAAO,GAAA,CACP,IAAA,CAAM,GAAA,CACN,MAAA,CAAQI,CAAAA,CAAYA,CAAAA,CAAU,MAAA,CAASA,CAAAA,CAAU,IAAA,CAAK,MAAA,CAAS,CAAA,CAC/D,WAAY,CAAA,CACZ,IAAA,CAAMA,CAAAA,CAAYA,CAAAA,CAAU,IAAA,CAAO,CAAA,CACnC,GAAA,CAAKA,CAAAA,CAAYA,CAAAA,CAAU,GAAA,CAAMA,CAAAA,CAAU,IAAA,CAAK,MAAA,CAAS,CAC3D,CAAU,EACZ,CACF,CAAA,KAAA,GAAWH,CAAAA,CAAY,CAAA,CAAG,CACxB,IAAMJ,CAAAA,CAAYC,CAAAA,CAAYC,CAAAA,CAAW,MAAM,CAAA,CAC/C,IAAA,IAASG,GAAAA,CAAI,CAAA,CAAGA,IAAI,CAACD,CAAAA,CAAWC,GAAAA,EAAAA,CAC9BC,CAAAA,CAAO,OAAA,CAAQ,CACb,IAAA,CAAMJ,CAAAA,CAAW,MAAA,CACjB,MAAA,CAAQF,CAAAA,CACR,KAAA,CAAO,GAAA,CACP,IAAA,CAAM,GAAA,CACN,MAAA,CAAQ,CAAA,CACR,UAAA,CAAY,CAAA,CACZ,IAAA,CAAM,CAAA,CACN,GAAA,CAAK,CACP,CAAU,EAEd,CACA,OAAOM,CACT,CAcA,eAAA,CAAgBE,EAAgB,CAAA,CAAGC,CAAAA,CAAkC,CAQnE,GAJIA,CAAAA,GACF,IAAA,CAAK,OAAA,CAAUA,CAAAA,CAAAA,CAEjB,IAAA,CAAK,KAAA,EAAA,CACD,IAAA,CAAK,KAAA,CAAQ,IAAA,CAAK,QAAA,CACpB,WAAK,KAAA,EAAA,CACCC,GAAAA,CAAa,OAAA,CACjB,wBAAA,CACA,CAAA,oBAAA,EAAuB,IAAA,CAAK,KAAK,CAAA,oBAAA,EAAuB,IAAA,CAAK,QAAQ,CAAA,CAAA,CACrE,CAAE,QAAA,CAAU,IAAA,CAAK,SAAU,YAAA,CAAc,IAAA,CAAK,KAAM,CACtD,CAAA,CAGF,IAAMC,CAAAA,CAAQ,IAAA,CAAK,OAAA,EAAQ,CAC3B,GAAI,CAACA,CAAAA,CACH,MAAA,IAAA,CAAK,KAAA,EAAA,CACCD,GAAAA,CAAa,OAAA,CAAQ,gBAAA,CAAkB,8BAA8B,CAAA,CAI7E,IAAA,CAAK,WAAA,CAAYC,CAAK,CAAA,CAGtB,IAAMb,CAAAA,CAAS,IAAA,CAAK,MAAA,CACdc,CAAAA,CAAMd,CAAAA,CAAO,OACbe,CAAAA,CAAUtB,CAAAA,CAAiB,QAAA,CAC3BuB,CAAAA,CAAW,IAAA,CAAK,QAAA,CAChBC,CAAAA,CAAU,IAAA,CAAK,OAAA,CACjBC,CAAAA,CAAM,IAAA,CAAK,OAAA,CAEf,KAAOA,CAAAA,CAAMJ,CAAAA,EAAK,CAChB,IAAMK,CAAAA,CAAYnB,CAAAA,CAAOkB,CAAG,CAAA,CAC5B,GAAI,CAACC,CAAAA,CAAW,MAEhB,IAAMC,CAAAA,CAAKL,CAAAA,CAAQI,CAAAA,CAAU,MAAM,EACnC,GAAIC,CAAAA,CAAK,CAAA,CAAG,CAEV,GAAIA,CAAAA,EAAMV,CAAAA,CAAO,MAEjB,GAAI,IAAA,CAAK,kBAAA,CAAoB,CAK3B,IAAMW,CAAAA,CAAgBL,CAAAA,CAAS,QAAA,CAASG,CAAAA,CAAU,MAAM,CAAA,CACpDE,CAAAA,EACF,IAAA,CAAK,mBAAA,CAAoBA,CAAAA,CAAeF,CAAAA,CAAW,KAAA,CAAOC,CAAE,EAEhE,CAEA,IAAA,CAAK,OAAA,CAAU,EAAEF,CAAAA,CACjB,IAAMI,CAAAA,CAASH,CAAAA,CAAU,MAAA,CAEzB,GAAIG,CAAAA,GAAW7B,CAAAA,CAAiB,UAAA,CAS9BwB,CAAAA,CAAQ,UAAA,CAAA,EAA6B,CAAA,CACrCA,CAAAA,CAAQ,UAAA,CAAW,GAAG,CAAA,CACtBA,CAAAA,CAAQ,UAAA,CAAA,EAAqB,CAAA,CAC7BA,CAAAA,CAAQ,UAAA,CAAA,EAA+B,CAAA,CAAA,KAAA,GAC9B,EAAAK,CAAAA,GAAW7B,CAAAA,CAAiB,QAAA,EAAY,IAAA,CAAK,oBAAA,CAAqBwB,CAAO,CAAA,CAAA,CAG7E,CAgBL,IAAMM,CAAAA,CAAWD,CAAAA,GAAW7B,CAAAA,CAAiB,QAAA,CAAY2B,CAAAA,CAAK,CAAA,CAAIA,CAAAA,CAAK,CAAA,CACvE,IAAA,CAAK,eAAA,CAAgBG,CAAAA,CAASN,CAAO,CAAA,CACrCA,CAAAA,CAAQ,UAAA,CAAWxB,CAAAA,CAAiB,YAAA,CAAa6B,CAAM,CAAC,EAC1D,CACF,CAAA,KAAO,CAEL,IAAMD,CAAAA,CAAgBL,CAAAA,CAAS,QAAA,CAASG,CAAAA,CAAU,MAAM,EAExD,GADI,CAACE,CAAAA,EACDA,CAAAA,CAAc,YAAA,EAAgBX,CAAAA,CAAO,MAEzC,IAAA,CAAK,OAAA,CAAU,EAAEQ,CAAAA,CAEb,IAAA,CAAK,kBAAA,EACP,IAAA,CAAK,mBAAA,CAAoBG,CAAAA,CAAeF,CAAAA,CAAW,KAAA,CAAOE,CAAAA,CAAc,YAAY,CAAA,CAMtF,IAAA,CAAK,oBAAA,CAAuBX,CAAAA,CAE5BW,CAAAA,CAAc,KAAA,CAAM,IAAA,CAAMR,CAAAA,CAAOM,CAAAA,CAAWF,CAAO,EACrD,CAEAC,CAAAA,CAAM,IAAA,CAAK,QACb,CAEA,IAAA,CAAK,OAAA,CAAUA,CAAAA,CACf,IAAA,CAAK,KAAA,GACP,CAWQ,WAAA,CAAYL,GAAAA,CAAoB,CACtC,IAAMI,CAAAA,CAAU,IAAA,CAAK,OAAA,CACfK,CAAAA,CAAST,GAAAA,CAAM,MAAA,CAErB,GAAI,IAAA,CAAK,kBAAA,CAAoB,CAK3B,IAAMW,CAAAA,CAAW,IAAA,CAAK,QAAA,CAAS,SAAA,CAAUF,CAAM,CAAA,CAC3CE,CAAAA,EACF,IAAA,CAAK,mBAAA,CAAoBA,CAAAA,CAAUX,GAAAA,CAAO,IAAI,EAElD,CAEA,OAAQS,CAAAA,EAEN,KAAK7B,CAAAA,CAAiB,UAAW,CAE/B,IAAIgC,CAAAA,CAMAC,CAAAA,CAA6B,IAAA,CAC3BC,CAAAA,CAAMd,GAAAA,CAAM,KAAA,CAClB,GAAIc,CAAAA,CAAI,UAAA,CAAW,IAAI,CAAA,EAAKA,CAAAA,CAAI,WAAW,IAAI,CAAA,CAAA,CAK7C,GAJAF,CAAAA,CAAI,QAAA,CAASE,CAAAA,CAAK,EAAE,CAAA,CAIhB,MAAA,CAAO,KAAA,CAAMF,CAAC,CAAA,CAChB,MAAMb,GAAAA,CAAa,OAAA,CAAQ,wBAAA,CAA0B,CAAA,sBAAA,EAAyBe,CAAG,CAAA,CAAA,CAAA,CAAK,CAAE,GAAA,CAAAA,CAAI,CAAC,CAAA,CAAA,KAAA,GAEtFA,CAAAA,CAAI,UAAA,CAAW,IAAI,CAAA,EAAKA,CAAAA,CAAI,UAAA,CAAW,IAAI,CAAA,CAAA,CAEpD,GADAF,CAAAA,CAAI,QAAA,CAASE,CAAAA,CAAI,KAAA,CAAM,CAAC,CAAA,CAAG,CAAC,CAAA,CACxB,MAAA,CAAO,KAAA,CAAMF,CAAC,CAAA,CAChB,MAAMb,GAAAA,CAAa,OAAA,CAAQ,wBAAA,CAA0B,CAAA,yBAAA,EAA4Be,CAAG,CAAA,CAAA,CAAA,CAAK,CAAE,GAAA,CAAAA,CAAI,CAAC,CAAA,CAAA,KAAA,GAEzFA,CAAAA,CAAI,UAAA,CAAW,IAAI,CAAA,EAAKA,EAAI,UAAA,CAAW,IAAI,CAAA,CAAA,CAEpD,GADAF,CAAAA,CAAI,QAAA,CAASE,CAAAA,CAAI,KAAA,CAAM,CAAC,CAAA,CAAG,CAAC,CAAA,CACxB,MAAA,CAAO,KAAA,CAAMF,CAAC,CAAA,CAChB,MAAMb,GAAAA,CAAa,OAAA,CAAQ,wBAAA,CAA0B,CAAA,wBAAA,EAA2Be,CAAG,CAAA,CAAA,CAAA,CAAK,CAAE,GAAA,CAAAA,CAAI,CAAC,CAAA,CAAA,KAAA,GAExFpC,CAAAA,CAA6B,IAAA,CAAKoC,CAAG,CAAA,CAe9CF,CAAAA,CAAI,UAAA,CAAWE,CAAAA,CAAI,KAAA,CAAM,GAAG,CAAA,CAAE,IAAA,CAAK,EAAE,CAAC,CAAA,CAAA,KACjC,CACL,IAAMC,CAAAA,CAASC,GAAAA,CAAU,IAAA,CAAK,UAAU,CAAA,CAClCC,CAAAA,CAAaF,CAAAA,CAAO,OAAA,CAAQ,gBAAA,CAC5BG,CAAAA,CAAeH,CAAAA,CAAO,OAAA,CAAQ,kBAAA,CAChCI,CAAAA,CAAaL,CAAAA,CAEbI,CAAAA,GACFC,CAAAA,CAAaA,EAAW,KAAA,CAAMD,CAAY,CAAA,CAAE,IAAA,CAAK,EAAE,CAAA,CAAA,CAGjDD,CAAAA,EAAcA,CAAAA,GAAe,GAAA,GAC/BE,CAAAA,CAAaA,CAAAA,CAAW,OAAA,CAAQF,CAAAA,CAAY,GAAG,CAAA,CAAA,CAEjDL,CAAAA,CAAI,UAAA,CAAWO,CAAU,CAAA,CAKrBxC,CAAAA,CAAc,IAAA,CAAKwC,CAAU,CAAA,GAAGN,CAAAA,CAAcM,CAAAA,EACpD,CACA,GAAIN,CAAAA,GAAgB,IAAA,CAAM,CACxBT,EAAQ,UAAA,CAAA,EAA8B,CAAA,CACtCA,CAAAA,CAAQ,UAAA,CAAWS,CAAW,CAAA,CAC9B,MACF,CACAT,CAAAA,CAAQ,UAAA,CAAA,EAA6B,CAAA,CACrCA,CAAAA,CAAQ,UAAA,CAAWQ,CAAC,CAAA,CACpB,MACF,CAEA,KAAKhC,CAAAA,CAAiB,SAAA,CAAW,CAK/BwB,CAAAA,CAAQ,UAAA,CAAA,EAA6B,CAAA,CACrCA,CAAAA,CAAQ,UAAA,CAAWgB,CAAAA,CAAoBpB,GAAAA,CAAM,KAAA,CAAO,IAAA,CAAK,UAAU,CAAC,CAAA,CACpE,MACF,CAEA,KAAKpB,CAAAA,CAAiB,SAAA,CAAW,CAC/BwB,CAAAA,CAAQ,UAAA,CAAA,EAA6B,CAAA,CACrCA,CAAAA,CAAQ,UAAA,CAAWJ,GAAAA,CAAM,KAAK,CAAA,CAC9B,MACF,CAGA,KAAKpB,CAAAA,CAAiB,QAAA,CAAU,CAO9B,GAAI,IAAA,CAAK,IAAA,EAAK,EAAG,MAAA,GAAWA,CAAAA,CAAiB,SAAA,CAAW,CACtD,KAAK,0BAAA,CAA2BoB,GAAAA,CAAOI,CAAO,CAAA,CAC9C,MACF,CAQAA,CAAAA,CAAQ,UAAA,CAAA,EAA0B,CAAA,CAClCA,CAAAA,CAAQ,UAAA,CAAWJ,GAAAA,CAAM,KAAK,CAAA,CAC9B,MACF,CAWA,KAAKpB,CAAAA,CAAiB,SAAA,CAAW,CAC/B,IAAA,CAAK,eAAA,CAAgB,CAAA,CAAGwB,CAAO,CAAA,CAC/B,IAAIiB,GAAAA,CAAQ,CAAA,CACZ,KAAO,IAAA,CAAK,MAAM9B,CAAAA,CAAW,KAAK,CAAA,EAChC,IAAA,CAAK,eAAA,CAAgB,CAAA,CAAGa,CAAO,CAAA,CAC/BiB,GAAAA,EAAAA,CAEF,IAAA,CAAK,OAAA,CAAQ9B,CAAAA,CAAW,MAAM,CAAA,CAC1B8B,GAAAA,CAAQ,CAAA,GAGVjB,CAAAA,CAAQ,UAAA,CAAA,GAAyB,CAAA,CACjCA,CAAAA,CAAQ,SAAA,CAAU,CAAC,CAAA,CACnBA,CAAAA,CAAQ,SAAA,CAAUiB,GAAK,CAAA,CAAA,CAEzB,MACF,CAGA,KAAKzC,EAAiB,QAAA,CAAU,CAC9B,IAAA,CAAK,eAAA,CAAgB0C,GAAAA,CAAa,MAAA,CAAQlB,CAAO,CAAA,CACjDA,CAAAA,CAAQ,UAAA,CAAA,EAAqB,CAAA,CAC7B,MACF,CAEA,KAAKxB,CAAAA,CAAiB,OAAA,CAAS,CAC7B,IAAA,CAAK,eAAA,CAAgB0C,GAAAA,CAAa,MAAA,CAAQlB,CAAO,CAAA,CACjDA,CAAAA,CAAQ,UAAA,CAAA,EAAqB,CAAA,CAC7B,MACF,CAGA,KAAKxB,CAAAA,CAAiB,WAIxB,CAGA,IAAM2C,CAAAA,CAAiB,IAAA,CAAK,QAAA,CAAS,SAAA,CAAUd,CAAM,CAAA,CACrD,GAAI,CAACc,CAAAA,CACH,MAAMxB,GAAAA,CAAa,OAAA,CACjB,oBAAA,CACA,CAAA,oCAAA,EAAuCC,GAAAA,CAAM,IAAI,CAAA,GAAA,EAAMA,GAAAA,CAAM,KAAK,CAAA,EAAA,CAAA,CAClE,CAAE,SAAA,CAAWA,GAAAA,CAAM,IAAA,CAAM,UAAA,CAAYA,GAAAA,CAAM,KAAM,CACnD,EAGFuB,CAAAA,CAAe,KAAA,CAAM,IAAA,CAAMvB,GAAAA,CAAOI,CAAO,EAC3C,CAyGQ,oBAAA,CAAqBA,CAAAA,CAAmC,CAC9D,IAAA,IAAWoB,CAAAA,IAAQ5C,CAAAA,CAAiB,kBAAA,CAClC,GAAI4C,CAAAA,CAAK,OAAA,CAAQ,IAAI,CAAA,CACnB,OAAAA,CAAAA,CAAK,IAAA,CAAK,IAAA,CAAMpB,CAAO,CAAA,CAChB,IAAA,CAGX,OAAO,MACT,CAcQ,kBAAA,CAAmBqB,EAAgC,CACzD,IAAIC,CAAAA,CAAQ,CAAA,CACZ,IAAA,IAAShC,CAAAA,CAAI+B,CAAAA,CAAS/B,CAAAA,CAAI,IAAA,CAAK,MAAA,CAAO,MAAA,CAAQA,CAAAA,EAAAA,CAAK,CACjD,IAAMiC,CAAAA,CAAI,IAAA,CAAK,MAAA,CAAOjC,CAAC,CAAA,CACvB,GAAIiC,CAAAA,CAAE,MAAA,GAAW/C,CAAAA,CAAiB,SAAA,CAAW8C,CAAAA,EAAAA,CAAAA,KAAAA,GACpCC,CAAAA,CAAE,MAAA,GAAW/C,CAAAA,CAAiB,SAAA,GACrC8C,CAAAA,EAAAA,CACIA,IAAU,CAAA,CAAA,CAAG,OAAOhC,CAE5B,CACA,OAAO,IACT,CAsBQ,0BAAA,CAA2BkC,CAAAA,CAAkBxB,CAAAA,CAAgC,CACnF,IAAMyB,CAAAA,CAAW,IAAA,CAAK,kBAAA,CAAmB,IAAA,CAAK,OAAO,CAAA,CACrD,GAAIA,CAAAA,GAAa,IAAA,CAAM,CACrBzB,CAAAA,CAAQ,UAAA,CAAA,EAA0B,CAAA,CAClCA,CAAAA,CAAQ,UAAA,CAAWwB,CAAAA,CAAU,KAAK,CAAA,CAClC,MACF,CACmB,IAAA,CAAK,MAAA,CAAOC,CAAAA,CAAW,CAAC,CAAA,EAC3B,IAAA,GAAStC,CAAAA,CAAW,MAAA,CAClC,IAAA,CAAK,2BAAA,CAA4BqC,CAAAA,CAAWxB,CAAO,CAAA,CAEnD,IAAA,CAAK,qBAAA,CAAsBwB,CAAAA,CAAWxB,CAAO,EAEjD,CAWQ,gBAAA,EAA2B,CACjC,IAAMJ,CAAAA,CAAQ,IAAA,CAAK,IAAA,EAAK,CACxB,GAAIA,CAAAA,EAAO,IAAA,GAAST,EAAW,KAAA,EAASS,CAAAA,EAAO,IAAA,GAAST,CAAAA,CAAW,IAAA,CACjE,OAAA,IAAA,CAAK,OAAA,EAAQ,CACNS,CAAAA,CAAM,KAAA,CAEf,MAAMD,GAAAA,CAAa,OAAA,CACjB,kCAAA,CACA,sCAAsCC,CAAAA,EAAO,IAAA,EAAQ,cAAc,CAAA,CAAA,EAAIA,CAAAA,CAAQ,CAAA,GAAA,EAAMA,CAAAA,CAAM,KAAK,CAAA,EAAA,CAAA,CAAO,EAAE,CAAA,CAAA,CACzG,CAAE,UAAA,CAAYA,CAAAA,EAAO,IAAK,CAC5B,CACF,CAEQ,2BAAA,CAA4B4B,CAAAA,CAAkBxB,CAAAA,CAAgC,CACpF,IAAA,CAAK,OAAA,CAAQb,CAAAA,CAAW,MAAM,CAAA,CAC9B,IAAMuC,CAAAA,CAAmB,EAAC,CAC1B,GAAI,IAAA,CAAK,IAAA,EAAK,EAAG,IAAA,GAASvC,CAAAA,CAAW,MAAA,CAEnC,IADAuC,CAAAA,CAAO,IAAA,CAAK,IAAA,CAAK,gBAAA,EAAkB,CAAA,CAC5B,KAAK,KAAA,CAAMvC,CAAAA,CAAW,KAAK,CAAA,EAChCuC,CAAAA,CAAO,IAAA,CAAK,IAAA,CAAK,gBAAA,EAAkB,CAAA,CAMvC,GAHA,IAAA,CAAK,OAAA,CAAQvC,CAAAA,CAAW,MAAM,CAAA,CAC9B,IAAA,CAAK,OAAA,CAAQA,CAAAA,CAAW,MAAM,CAAA,CAE1BuC,CAAAA,CAAO,MAAA,GAAW,CAAA,CACpB,MAAM/B,GAAAA,CAAa,OAAA,CACjB,yBAAA,CACA,CAAA,CAAA,EAAI6B,CAAAA,CAAU,KAAK,CAAA,yMAAA,CAAA,CACnB,CAAE,IAAA,CAAMA,CAAAA,CAAU,KAAM,CAC1B,CAAA,CAaF,IAAMG,CAAAA,CAAc,IAAIC,CAAAA,CAAgB,IAAA,CAAK,mBAAmB,CAAA,CAChE,IAAA,CAAK,eAAA,CAAgBV,GAAAA,CAAa,MAAA,CAAQS,CAAW,CAAA,CACrD,IAAA,CAAK,UAAA,CAAW3B,CAAO,CAAA,CAEvB,IAAM6B,GAAAA,CAAcF,CAAAA,CAAY,KAAA,EAAM,CACtC,GAAIE,IAAY,QAAA,CAUd,MAAMlC,GAAAA,CAAa,OAAA,CACjB,mCAAA,CACA,CAAA,CAAA,EAAI6B,CAAAA,CAAU,KAAK,CAAA,+HAAA,CAAA,CACnB,CAAE,IAAA,CAAMA,CAAAA,CAAU,KAAM,CAC1B,CAAA,CAGF,IAAMM,CAAAA,CAAU9B,CAAAA,CAAQ,oBAAA,CAAqBwB,CAAAA,CAAU,KAAA,CAAOE,CAAAA,CAAQG,GAAW,CAAA,CACjF7B,CAAAA,CAAQ,UAAA,CAAA,GAAsC,CAAA,CAC9CA,CAAAA,CAAQ,SAAA,CAAU8B,CAAO,EAKzB9B,CAAAA,CAAQ,UAAA,CAAA,EAA6B,CAAA,CACrCA,CAAAA,CAAQ,UAAA,CAAW,CAAA,EAAGwB,CAAAA,CAAU,KAAK,CAAA,CAAA,EAAIE,CAAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA,SAAA,CAAW,EACvE,CAEQ,qBAAA,CAAsBF,CAAAA,CAAkBxB,CAAAA,CAAgC,CAC9E,IAAA,CAAK,OAAA,CAAQb,CAAAA,CAAW,MAAM,CAAA,CAC9B,IAAI4C,CAAAA,CAAW,CAAA,CACf,GAAI,IAAA,CAAK,MAAK,EAAG,IAAA,GAAS5C,CAAAA,CAAW,MAAA,CAGnC,IAFA,IAAA,CAAK,eAAA,CAAgB+B,GAAAA,CAAa,MAAA,CAAQlB,CAAO,CAAA,CACjD+B,CAAAA,EAAAA,CACO,IAAA,CAAK,KAAA,CAAM5C,CAAAA,CAAW,KAAK,CAAA,EAChC,IAAA,CAAK,eAAA,CAAgB+B,GAAAA,CAAa,MAAA,CAAQlB,CAAO,CAAA,CACjD+B,CAAAA,EAAAA,CAGJ,IAAA,CAAK,OAAA,CAAQ5C,CAAAA,CAAW,MAAM,CAAA,CAE9Ba,CAAAA,CAAQ,cAAoC,CAAA,CAC5CA,CAAAA,CAAQ,UAAA,CAAWwB,CAAAA,CAAU,KAAK,CAAA,CAClCxB,CAAAA,CAAQ,QAAA,CAAS+B,CAAQ,EAC3B,CAMA,OAAA,CAAQC,CAAAA,CAA8B,CACpC,IAAMpC,CAAAA,CAAQ,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA,CACtC,GAAI,CAACA,CAAAA,CACH,MAAMD,GAAAA,CAAa,OAAA,CACjB,yBAAA,CACA,yBACF,CAAA,CAEF,GAAIqC,CAAAA,GAAiB,MAAA,CAAW,CAC9B,IAAMC,CAAAA,CAAa/C,CAAAA,CAAY8C,CAAY,CAAA,CAC3C,GAAIpC,CAAAA,CAAM,MAAA,GAAWqC,CAAAA,CACnB,MAAMtC,GAAAA,CAAa,OAAA,CACjB,uBAAA,CACA,CAAA,qBAAA,EAAwBqC,CAAY,CAAA,WAAA,EAAcpC,CAAAA,CAAM,IAAI,CAAA,IAAA,EAAOA,CAAAA,CAAM,KAAK,CAAA,EAAA,CAAA,CAC9E,CAAE,YAAA,CAAAoC,CAAAA,CAAc,UAAA,CAAYpC,CAAAA,CAAM,KAAM,WAAA,CAAaA,CAAAA,CAAM,KAAM,CACnE,CAEJ,CACA,OAAA,IAAA,CAAK,OAAA,EAAA,CACEA,CACT,CAEA,KAAA,CAAMoC,CAAAA,CAA+B,CACnC,IAAMpC,CAAAA,CAAQ,IAAA,CAAK,IAAA,EAAK,CACxB,OAAIA,CAAAA,EAASA,CAAAA,CAAM,MAAA,GAAWV,CAAAA,CAAY8C,CAAY,CAAA,EACpD,IAAA,CAAK,OAAA,EAAQ,CACN,IAAA,EAEF,KACT,CAEA,IAAA,EAA0B,CACxB,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,OAAO,CACjC,CASA,MAAA,CAAOE,CAAAA,CAAmC,CACxC,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,OAAA,CAAUA,CAAM,CAC1C,CAEA,QAAA,EAA8B,CAC5B,OAAO,IAAA,CAAK,OAAA,CAAU,CAAA,CAAI,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,OAAA,CAAU,CAAC,CAAA,CAAI,MAC5D,CAEQ,OAAA,EAAgB,CACtB,IAAA,CAAK,OAAA,GACP,CAOA,UAAA,CAAWlC,CAAAA,CAAgC,CACzC,IAAA,CAAK,OAAA,CAAUA,EACjB,CAMQ,mBAAA,CACNO,CAAAA,CACAX,CAAAA,CACAuC,CAAAA,CACAC,CAAAA,CACM,CACN,IAAMvD,CAAAA,CAAW,IAAA,CAAK,kBAAA,CAChBwD,CAAAA,CAAwD,CAC5D,IAAA,CAAMC,GAAAA,CAAoB,eAAA,CAC1B,UAAW,CAAA,CACX,UAAA,CAAY,IAAA,CAAK,iBAAA,CACjB,SAAA,CAAW1C,CAAAA,CAAM,IAAA,CACjB,UAAA,CAAYA,CAAAA,CAAM,KAAA,CAClB,gBAAA,CAAkBW,CAAAA,CAAS,QAAA,CAC3B,YAAA,CAAcA,CAAAA,CAAS,WAAA,EAAa,IAAA,EAAQ,SAAA,CAC5C,QAAA,CAAA4B,CAAAA,CACA,YAAA,CAAAC,CAAAA,CACA,WAAA,CAAaxC,CAAAA,CAAM,MAAA,EAAU,CAC/B,CAAA,CACAf,CAAAA,CAAS,mBAAA,CAAoBwD,CAAK,EACpC,CACF,CAAA,CAl2Ba7D,CAAAA,CA+BK,QAAA,CAAuB+D,CAAAA,EAAuB,CA/BnD/D,CAAAA,CAmCa,SAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,MAAM,CAAA,CAnCxDX,CAAAA,CAoCa,SAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,MAAM,CAAA,CApCxDX,CAAAA,CAqCa,SAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,MAAM,CAAA,CArCxDX,CAAAA,CAsCa,QAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,KAAK,CAAA,CAtCvDX,EAuCa,SAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,MAAM,CAAA,CAvCxDX,CAAAA,CAwCa,SAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,MAAM,CAAA,CAxCxDX,CAAAA,CAyCa,QAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,KAAK,CAAA,CAzCvDX,CAAAA,CA0Ca,OAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,IAAI,CAAA,CA1CtDX,CAAAA,CA2Ca,UAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,OAAO,CAAA,CA3CzDX,CAAAA,CA8Ca,QAAcU,CAAAA,CAAYC,CAAAA,CAAW,IAAI,CAAA,CA9CtDX,CAAAA,CA+Ca,QAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,KAAK,CAAA,CA/CvDX,CAAAA,CAgDa,MAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,GAAG,CAAA,CAhDrDX,CAAAA,CAiDa,QAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,KAAK,CAAA,CAjDvDX,CAAAA,CAkDa,SAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,MAAM,CAAA,CAlDxDX,CAAAA,CAmDa,SAAA,CAAcU,EAAYC,CAAAA,CAAW,MAAM,CAAA,CAnDxDX,CAAAA,CAoDa,UAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,OAAO,CAAA,CApDzDX,CAAAA,CAqDa,UAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,OAAO,EArDzDX,CAAAA,CAsDa,SAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,MAAM,CAAA,CAtDxDX,CAAAA,CAuDa,UAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,OAAO,CAAA,CAvDzDX,CAAAA,CAwDa,UAAA,CAAcU,EAAYC,CAAAA,CAAW,OAAO,CAAA,CAxDzDX,CAAAA,CAyDa,KAAA,CAAcU,CAAAA,CAAYC,CAAAA,CAAW,EAAE,CAAA,CAzDpDX,CAAAA,CA+Da,YAAA,CAAuC,CAC7D,CAACU,CAAAA,CAAYC,CAAAA,CAAW,IAAI,CAAC,EAAA,EAAA,CAC7B,CAACD,CAAAA,CAAYC,CAAAA,CAAW,KAAK,CAAC,EAAA,EAAA,CAC9B,CAACD,CAAAA,CAAYC,CAAAA,CAAW,IAAI,CAAC,EAAA,EAAA,CAC7B,CAACD,CAAAA,CAAYC,CAAAA,CAAW,KAAK,CAAC,EAAA,EAAA,CAC9B,CAACD,CAAAA,CAAYC,CAAAA,CAAW,GAAG,CAAC,EAAA,EAAA,CAC5B,CAACD,CAAAA,CAAYC,CAAAA,CAAW,KAAK,CAAC,EAAA,EAAA,CAC9B,CAACD,CAAAA,CAAYC,CAAAA,CAAW,MAAM,CAAC,EAAA,EAAA,CAC/B,CAACD,CAAAA,CAAYC,CAAAA,CAAW,MAAM,CAAC,EAAA,EAAA,CAC/B,CAACD,EAAYC,CAAAA,CAAW,OAAO,CAAC,EAAA,EAAA,CAChC,CAACD,CAAAA,CAAYC,CAAAA,CAAW,OAAO,CAAC,EAAA,EAAA,CAChC,CAACD,CAAAA,CAAYC,CAAAA,CAAW,MAAM,CAAC,EAAA,EAAA,CAC/B,CAACD,CAAAA,CAAYC,CAAAA,CAAW,OAAO,CAAC,EAAA,EAAA,CAChC,CAACD,CAAAA,CAAYC,CAAAA,CAAW,EAAE,CAAC,EAAA,EAC7B,CAAA,CA7EWX,CAAAA,CAgiBa,mBAInB,CACH,CACE,IAAA,CAAM,gBAAA,CACN,OAAA,CAAUgE,CAAAA,EAAM,CACd,IAAMC,CAAAA,CAAOD,CAAAA,CAAE,IAAA,EAAK,CACpB,OAAOC,CAAAA,EAAM,IAAA,GAAStD,CAAAA,CAAW,KAAA,EAASsD,CAAAA,CAAK,KAAA,GAAU,GAC3D,CAAA,CACA,IAAA,CAAM,CAACD,CAAAA,CAAGxC,CAAAA,GAAY,CACpBwC,CAAAA,CAAE,OAAA,EAAQ,CACVxC,CAAAA,CAAQ,aAA8B,CAAA,CACtCA,CAAAA,CAAQ,SAAA,CAAU,EAAE,CAAA,CACpBA,CAAAA,CAAQ,SAAA,CAAU,CAAC,EACrB,CACF,CAAA,CACA,CACE,IAAA,CAAM,eAAA,CACN,OAAA,CAAUwC,CAAAA,EAAM,CAEd,GADaA,CAAAA,CAAE,IAAA,EAAK,EACV,MAAA,GAAWhE,CAAAA,CAAiB,QAAA,CAAU,OAAO,MAAA,CACvD,IAAMkE,CAAAA,CAAaF,CAAAA,CAAE,MAAA,CAAO,CAAC,CAAA,CAC7B,OAAOE,CAAAA,EAAY,IAAA,GAASvD,CAAAA,CAAW,MAAA,EAAUuD,CAAAA,CAAW,KAAA,GAAU,GACxE,CAAA,CACA,IAAA,CAAM,CAACF,CAAAA,CAAGxC,CAAAA,GAAY,CACpBwC,CAAAA,CAAE,OAAA,EAAQ,CACVA,CAAAA,CAAE,OAAA,EAAQ,CACVxC,CAAAA,CAAQ,UAAA,CAAA,EAA8B,CAAA,CACtCA,CAAAA,CAAQ,SAAA,CAAU,EAAE,CAAA,CACpBA,CAAAA,CAAQ,SAAA,CAAU,CAAC,EACrB,CACF,CACF,CAAA,CAlkBK,IAAM2C,CAAAA,CAANnE,ECTA,IAAMoE,CAAAA,CAAN,KAAuB,CAAvB,WAAA,EAAA,CAEN,IAAA,CAAQ,eAAA,CAA+C,IAAI,GAAA,CAC3D,IAAA,CAAQ,cAAA,CAA6C,IAAI,GAAA,CAGzD,IAAA,CAAQ,UAAA,CAA0C,IAAI,GAAA,CACtD,IAAA,CAAQ,SAAA,CAAwC,IAAI,IAAA,CAwBpD,cAAA,CAAeC,CAAAA,CAAmBtC,EAAgC,CACjE,IAAMuC,CAAAA,CAAW,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAID,CAAS,CAAA,CAC/CC,CAAAA,EAAYA,CAAAA,GAAavC,CAAAA,EAC5B,OAAA,CAAQ,IAAA,CACP,CAAA,8CAAA,EAAiDsC,CAAS,CAAA,oCAAA,EAC3CC,CAAAA,CAAS,QAAA,EAAY,SAAS,CAAA,gDAAA,EACrBvC,CAAAA,CAAS,QAAA,EAAY,SAAS,CAAA,qGAAA,CAEvD,CAAA,CAED,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAIsC,CAAAA,CAAWtC,CAAQ,EAC5C,IAAA,CAAK,UAAA,CAAW,GAAA,CAAIrB,CAAAA,CAAY2D,CAAS,CAAA,CAAGtC,CAAQ,EACrD,CAGA,aAAA,CAAcsC,CAAAA,CAAmBtC,CAAAA,CAA+B,CAC/D,IAAMuC,CAAAA,CAAW,IAAA,CAAK,cAAA,CAAe,GAAA,CAAID,CAAS,CAAA,CAC9CC,CAAAA,EAAYA,CAAAA,GAAavC,CAAAA,EAC5B,OAAA,CAAQ,IAAA,CACP,CAAA,6CAAA,EAAgDsC,CAAS,CAAA,oCAAA,EAC1CC,CAAAA,CAAS,QAAA,EAAY,SAAS,CAAA,gDAAA,EACrBvC,CAAAA,CAAS,QAAA,EAAY,SAAS,CAAA,qGAAA,CAEvD,CAAA,CAED,IAAA,CAAK,cAAA,CAAe,GAAA,CAAIsC,CAAAA,CAAWtC,CAAQ,CAAA,CAC3C,IAAA,CAAK,SAAA,CAAU,GAAA,CAAIrB,CAAAA,CAAY2D,CAAS,CAAA,CAAGtC,CAAQ,EACpD,CAcA,YAAA,EAAsF,CACrF,IAAMhB,CAAAA,CAAgF,EAAC,CACvF,IAAA,GAAW,CAACsD,CAAAA,CAAWtC,CAAQ,CAAA,GAAK,IAAA,CAAK,eAAA,CACxChB,CAAAA,CAAO,IAAA,CAAK,CACX,SAAA,CAAAsD,CAAAA,CACA,YAAA,CAA8BtC,CAAAA,CAAU,YAAA,EAAgBW,GAAAA,CAAa,MAAA,CACrE,QAAA,CAAUX,CAAAA,CAAS,QACpB,CAAC,CAAA,CAEF,OAAOhB,CACR,CAuBA,WAAA,EAAoH,CACnH,IAAMA,CAAAA,CAA+G,EAAC,CACtH,IAAA,GAAW,CAACsD,CAAAA,CAAWtC,CAAQ,CAAA,GAAK,IAAA,CAAK,cAAA,CAAgB,CACxD,IAAMwC,CAAAA,CAAuBxC,CAAAA,CAAU,YAAA,EAAgB,CAAA,CACvDhB,CAAAA,CAAO,IAAA,CAAK,CACX,SAAA,CAAAsD,CAAAA,CACA,gBAAA,CAAkBE,CAAAA,CAClB,iBAAA,CAAmBA,CAAAA,CAAO,CAAA,CAC1B,QAAA,CAAUxC,CAAAA,CAAS,QACpB,CAAC,EACF,CACA,OAAOhB,CACR,CAGA,IAAI,WAAA,EAAsB,CAAE,OAAO,IAAA,CAAK,eAAA,CAAgB,IAAM,CAG9D,IAAI,UAAA,EAAqB,CAAE,OAAO,IAAA,CAAK,cAAA,CAAe,IAAM,CAO5D,SAAA,CAAUsD,CAAAA,CAAwD,CACjE,OAAI,OAAOA,CAAAA,EAAc,QAAA,CAAiB,IAAA,CAAK,UAAA,CAAW,GAAA,CAAIA,CAAS,CAAA,CAChE,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAIA,CAAS,CAC1C,CAMA,QAAA,CAASA,CAAAA,CAAuD,CAC/D,OAAI,OAAOA,CAAAA,EAAc,QAAA,CAAiB,IAAA,CAAK,SAAA,CAAU,GAAA,CAAIA,CAAS,CAAA,CAC/D,IAAA,CAAK,cAAA,CAAe,GAAA,CAAIA,CAAS,CACzC,CAEA,SAAA,CAAUA,CAAAA,CAA4B,CACrC,OAAO,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAIA,CAAS,CAC1C,CAEA,QAAA,CAASA,CAAAA,CAA4B,CACpC,OAAO,IAAA,CAAK,cAAA,CAAe,GAAA,CAAIA,CAAS,CACzC,CAEA,KAAA,EAAc,CACb,IAAA,CAAK,eAAA,CAAgB,KAAA,EAAM,CAC3B,IAAA,CAAK,cAAA,CAAe,KAAA,EAAM,CAC1B,IAAA,CAAK,UAAA,CAAW,KAAA,EAAM,CACtB,IAAA,CAAK,SAAA,CAAU,KAAA,GAChB,CACD,CAAA,CAUaG,CAAAA,CAAyB,IAAIJ","file":"chunk-CUDPOWXA.js","sourcesContent":["import { ParseletRegistry } from \"@solve-js/parser/registry/ParseletRegistry\";\nimport { Token, tokenTypeId, TokenTypes } from \"@solve-js/lexer/Token\";\nimport { BytecodeBuilder } from \"@solve-js/parser/BytecodeBuilder\";\nimport { ErrorFactory } from \"@solve-js/errors/UnifiedErrorFramework\";\nimport { DiagnosticPipeline, DiagnosticEventType, type DiagnosticEvent } from \"@solve-js/diagnostics\";\nimport { OpCode } from \"@solve-js/parser/OpCode\";\nimport { BindingPower, buildBindingPowerTable } from \"@solve-js/parser/BindingPower\";\nimport { getLocale } from \"@solve-js/constants/locales\";\nimport { bigIntLiteralDigits } from \"@solve-js/parser/BigIntLiteral\";\n\n/**\n * Matches a CHAINED thousands-grouped integer using \".\" as the group\n * separator (e.g. \"1.234.567\"), independent of locale. Kept in sync with\n * the identical constant in NumberParselet.ts (not imported from there\n * that file transitively re-imports PrecedenceParser via Parser.ts's\n * `export { PrecedenceParser as Parser }`, so importing the other\n * direction would create a circular dependency for the sake of one\n * regex literal). See NumberParselet.ts's copy for the full explanation.\n */\nconst CHAINED_DOT_THOUSANDS_GROUPS = /^\\d{1,3}(\\.\\d{3}){2,}$/;\n\n/**\n * A plain fractional literal: digits, exactly one dot, digits, nothing else.\n *\n * The gate for compiling to PUSH_DECIMAL. It admits \"0.10\", \"1.005\", \".5\" and\n * \"5.\" and refuses anything with an exponent (\"2.5e-3\"), which parses as an\n * ordinary double instead, since scientific notation has no exact base-ten\n * value this representation would keep.\n */\nconst PLAIN_DECIMAL = /^\\d*\\.\\d*$/;\n\n/**\n * ── Hybrid Precedence Climbing Parser ─────────────────────────────────────────\n *\n * Two-tier dispatch strategy:\n *\n *   Tier 1 (Fast Path): Inline switch on token.typeId for built-in operators.\n *     - Prefix: NUMBER, IDENT, LPAREN, MINUS, PLUS, STRING\n *     - Infix:  checked via static BP_TABLE (Uint8Array indexed by typeId)\n *     - No Map.get(), no parselet function call overhead for ~95% of tokens\n *\n *   Tier 2 (Plugin Path): ParseletRegistry fallback for custom/plugin tokens.\n *     - Prefix: Map.get(tokenTypeId) for PrefixParselet\n *     - Infix:  Map.get(tokenTypeId) for InfixParselet\n *     - Full flexibility for custom syntax\n *\n * The parser emits directly to a BytecodeBuilder, no AST intermediate.\n * Implements the same public API as the legacy Parser class so existing\n * parselets continue to work without modification.\n */\nexport class PrecedenceParser {\n  private tokens: Token[] = [];\n  private current = 0;\n  private depth = 0;\n  private maxDepth: number;\n\n  /** Cached registry reference, avoids property chain in hot loop */\n  private registry: ParseletRegistry;\n\n  /** BytecodeBuilder, set before each parseExpression call */\n  private builder!: BytecodeBuilder;\n\n  /** Diagnostic pipeline for parselet-matched events */\n  private diagnosticPipeline: DiagnosticPipeline | undefined;\n  private currentExpression: string = \"\";\n  private localeCode: string;\n\n  /**\n   * The binding power the current infix parselet is being invoked at, i.e. the\n   * `minBp` of the expression it sits inside. Set immediately before each Tier-2\n   * parselet runs. A parselet that decides whether to swallow a following\n   * loose operator (UomLiteralParselet with a trailing `in`/`to`) reads this to\n   * respect precedence it cannot otherwise see: `120 km / 2 hours in kph` must\n   * group as `(120 km / 2 hours) in kph`, not `120 km / (2 hours in kph)`.\n   */\n  infixMinBindingPower = 0;\n\n  /**\n   * Static binding power table, built once at module load, shared across all instances.\n   * Index = tokenTypeId, value = binding power (0 = not a built-in infix).\n   */\n  static readonly BP_TABLE: Uint8Array = buildBindingPowerTable();\n\n  // ── Pre-computed token type IDs for inline dispatch ────────────────────────\n  // Prefix built-ins\n  private static readonly NUMBER_ID   = tokenTypeId(TokenTypes.NUMBER);\n  private static readonly BIGINT_ID   = tokenTypeId(TokenTypes.BIGINT);\n  private static readonly STRING_ID   = tokenTypeId(TokenTypes.STRING);\n  private static readonly IDENT_ID    = tokenTypeId(TokenTypes.IDENT);\n  private static readonly LPAREN_ID   = tokenTypeId(TokenTypes.LPAREN);\n  private static readonly RPAREN_ID   = tokenTypeId(TokenTypes.RPAREN);\n  private static readonly MINUS_ID    = tokenTypeId(TokenTypes.MINUS);\n  private static readonly PLUS_ID     = tokenTypeId(TokenTypes.PLUS);\n  private static readonly KEYWORD_ID  = tokenTypeId(TokenTypes.KEYWORD);\n\n  // Infix built-ins (Tier 1, full inline emission)\n  private static readonly STAR_ID     = tokenTypeId(TokenTypes.STAR);\n  private static readonly SLASH_ID    = tokenTypeId(TokenTypes.SLASH);\n  private static readonly MOD_ID      = tokenTypeId(TokenTypes.MOD);\n  private static readonly CARET_ID    = tokenTypeId(TokenTypes.CARET);\n  private static readonly LSHIFT_ID   = tokenTypeId(TokenTypes.LSHIFT);\n  private static readonly RSHIFT_ID   = tokenTypeId(TokenTypes.RSHIFT);\n  private static readonly URSHIFT_ID  = tokenTypeId(TokenTypes.URSHIFT);\n  private static readonly BIT_AND_ID  = tokenTypeId(TokenTypes.BIT_AND);\n  private static readonly BIT_OR_ID   = tokenTypeId(TokenTypes.BIT_OR);\n  private static readonly BIT_XOR_ID  = tokenTypeId(TokenTypes.BIT_XOR);\n  private static readonly PERCENT_ID  = tokenTypeId(TokenTypes.PERCENT);\n  private static readonly OF_ID       = tokenTypeId(TokenTypes.OF);\n\n  /**\n   * Inline opcode map for Tier 1 infix operators.\n   * tokenTypeId → OpCode. PERCENT and CARET are handled specially (not in this map).\n   */\n  private static readonly INFIX_OPCODE: Record<number, OpCode> = {\n    [tokenTypeId(TokenTypes.PLUS)]:    OpCode.ADD,\n    [tokenTypeId(TokenTypes.MINUS)]:   OpCode.SUB,\n    [tokenTypeId(TokenTypes.STAR)]:    OpCode.MUL,\n    [tokenTypeId(TokenTypes.SLASH)]:   OpCode.DIV,\n    [tokenTypeId(TokenTypes.MOD)]:     OpCode.MOD,\n    [tokenTypeId(TokenTypes.CARET)]:   OpCode.EXP,\n    [tokenTypeId(TokenTypes.LSHIFT)]:  OpCode.LSHIFT,\n    [tokenTypeId(TokenTypes.RSHIFT)]:  OpCode.RSHIFT,\n    [tokenTypeId(TokenTypes.URSHIFT)]: OpCode.URSHIFT,\n    [tokenTypeId(TokenTypes.BIT_AND)]: OpCode.BIT_AND,\n    [tokenTypeId(TokenTypes.BIT_OR)]:  OpCode.BIT_OR,\n    [tokenTypeId(TokenTypes.BIT_XOR)]: OpCode.BIT_XOR,\n    [tokenTypeId(TokenTypes.OF)]:      OpCode.MUL,\n  };\n\n  /** Shared with every BytecodeBuilder so a nested-body builder resolves plugin calls by name. */\n  private pluginFunctionIndex?: ReadonlyMap<string, number>;\n\n  constructor(parseletRegistry: ParseletRegistry, maxDepth = 50, localeCode = \"en\", pluginFunctionIndex?: ReadonlyMap<string, number>) {\n    this.registry = parseletRegistry;\n    this.maxDepth = maxDepth;\n    this.localeCode = localeCode;\n    this.pluginFunctionIndex = pluginFunctionIndex;\n  }\n\n  /** Get locale code for NumberParselet to normalize separators */\n  getLocaleCode(): string {\n    return this.localeCode;\n  }\n\n  /**\n   * Set the diagnostic pipeline for parselet matching events.\n   * Cleared after each non-cached parse to avoid holding refs.\n   */\n  setDiagnosticPipeline(pipeline: DiagnosticPipeline | undefined, expression: string): void {\n    this.diagnosticPipeline = pipeline;\n    this.currentExpression = expression ?? \"\";\n  }\n\n  /**\n   * Load tokens for parsing. Identical to Parser.load().\n   *\n   * @param hasParens - if false, skips the O(n) paren balance scan (~90% of expressions)\n   */\n  load(tokens: Token[], hasParens?: boolean): void {\n    if (hasParens === false) {\n      this.tokens = tokens;\n      this.current = 0;\n      this.depth = 0;\n      return;\n    }\n    // Paren scan: count balance to skip array copy for balanced expressions.\n    const LPAREN_ID = tokenTypeId(TokenTypes.LPAREN);\n    const RPAREN_ID = tokenTypeId(TokenTypes.RPAREN);\n    let openCount = 0;\n    for (let i = 0; i < tokens.length; i++) {\n      if (tokens[i].typeId === LPAREN_ID) openCount++;\n      else if (tokens[i].typeId === RPAREN_ID) openCount--;\n    }\n    this.tokens = openCount === 0 ? tokens : this.balanceParens(tokens, openCount);\n    this.current = 0;\n    this.depth = 0;\n  }\n\n  /**\n   * Auto-balance unmatched parentheses.\n   */\n  private balanceParens(tokens: Token[], openCount: number): Token[] {\n    const result = tokens.slice();\n    if (openCount > 0) {\n      const RPAREN_ID = tokenTypeId(TokenTypes.RPAREN);\n      for (let i = 0; i < openCount; i++) {\n        const lastToken = tokens[tokens.length - 1];\n        result.push({\n          type: TokenTypes.RPAREN,\n          typeId: RPAREN_ID,\n          value: \")\",\n          text: \")\",\n          offset: lastToken ? lastToken.offset + lastToken.text.length : 0,\n          lineBreaks: 0,\n          line: lastToken ? lastToken.line : 1,\n          col: lastToken ? lastToken.col + lastToken.text.length : 1,\n        } as Token);\n      }\n    } else if (openCount < 0) {\n      const LPAREN_ID = tokenTypeId(TokenTypes.LPAREN);\n      for (let i = 0; i < -openCount; i++) {\n        result.unshift({\n          type: TokenTypes.LPAREN,\n          typeId: LPAREN_ID,\n          value: \"(\",\n          text: \"(\",\n          offset: 0,\n          lineBreaks: 0,\n          line: 1,\n          col: 1,\n        } as Token);\n      }\n    }\n    return result;\n  }\n\n  // ═══════════════════════════════════════════════════════════════════════════════\n  // Main entry point: precedence climbing parse expression\n  // ═══════════════════════════════════════════════════════════════════════════════\n\n  /**\n   * Parse a full expression starting at the current token position.\n   *\n   * @param minBp - minimum binding power (precedence climbing threshold).\n   *   For left-associative operators, the recursive call uses `bp + 1`.\n   *   For right-associative operators (^), it uses `bp - 1`.\n   * @param _builder - accepted for parselet API compatibility; always uses `this.builder`.\n   */\n  parseExpression(minBp: number = 0, _builder?: BytecodeBuilder): void {\n    // Accept builder via parameter for backward compatibility with the old Parser API.\n    // The ExpressionEngine always calls setBuilder() before parseExpression(),\n    // but tests and parselets pass builder as a parameter.\n    if (_builder) {\n      this.builder = _builder;\n    }\n    this.depth++;\n    if (this.depth > this.maxDepth) {\n      this.depth--;\n      throw ErrorFactory.parsing(\n        \"NESTING_DEPTH_EXCEEDED\",\n        `Parse nesting depth ${this.depth} exceeds maximum of ${this.maxDepth}`,\n        { maxDepth: this.maxDepth, currentDepth: this.depth }\n      );\n    }\n\n    const token = this.consume();\n    if (!token) {\n      this.depth--;\n      throw ErrorFactory.parsing(\"UNEXPECTED_END\", \"Unexpected end of expression\");\n    }\n\n    // ── Prefix ──────────────────────────────────────────────────────────────\n    this.parsePrefix(token);\n\n    // ── Infix loop (precedence climbing with inline Tier 1 dispatch) ──────────\n    const tokens = this.tokens;\n    const len = tokens.length;\n    const bpTable = PrecedenceParser.BP_TABLE;\n    const registry = this.registry;\n    const builder = this.builder;\n    let idx = this.current;\n\n    while (idx < len) {\n      const lookahead = tokens[idx];\n      if (!lookahead) break;\n\n      const bp = bpTable[lookahead.typeId];\n      if (bp > 0) {\n        // Tier 1: Built-in infix, full inline emission, zero parselet delegation\n        if (bp <= minBp) break;\n\n        if (this.diagnosticPipeline) {\n          // Fast path skips the registry, but built-ins are still registered\n          // there (for introspection/tests), look them up only in this\n          // diagnostics-only branch so the playground's \"matched parselets\"\n          // view isn't permanently blind to every arithmetic operator.\n          const infixParselet = registry.getInfix(lookahead.typeId);\n          if (infixParselet) {\n            this.fireParseletMatched(infixParselet, lookahead, false, bp);\n          }\n        }\n\n        this.current = ++idx;\n        const typeId = lookahead.typeId;\n\n        if (typeId === PrecedenceParser.PERCENT_ID) {\n          // Postfix: no right operand. \"50%\" → Percentage holding 0.5.\n          //\n          // Must stay byte-for-byte equivalent to PercentParselet, which is\n          // the Tier-2 registration of the same operator. This path is the one\n          // that actually runs for ordinary expressions, so a change made only\n          // in the parselet does nothing at all: that is exactly how the\n          // divide-by-100 here outlived its replacement and kept `200 + 10%`\n          // answering 200.10.\n          builder.emitOpcode(OpCode.PUSH_NUMBER);\n          builder.emitNumber(100);\n          builder.emitOpcode(OpCode.DIV);\n          builder.emitOpcode(OpCode.TO_PERCENTAGE);\n        } else if (typeId === PrecedenceParser.CARET_ID && this.tryEmitMatrixCaretOp(builder)) {\n          // `^T` (transpose) or `^-1` (inverse), already fully handled\n          // including consuming their own trailing tokens.\n        } else {\n          // Infix: parse right operand, then emit opcode.\n          // Right-associative for CARET (^), left-associative for all others.\n          //\n          // The threshold has to be bp - 1, not bp. The loop above breaks on\n          // `bp <= minBp`, so a right operand parsed at `bp` stops at the next\n          // `^` exactly as one parsed at `bp + 1` does: the old special case\n          // was dead code and \"2 ^ 3 ^ 2\" grouped left, answering 64. One\n          // below lets the recursive call keep consuming `^`, which is what\n          // makes it 2^(3^2) = 512, as in mathematics, Python, Ruby and\n          // JavaScript's `**`.\n          //\n          // Nothing else sits between Exponent (50) and Product (40), so\n          // 49 cannot collide with another operator's level. Unary minus is\n          // unaffected: it parses its operand at Prefix (60), above `^`\n          // either way, so \"-2 ^ 2\" is still (-2)^2 = 4.\n          const rightBp = (typeId === PrecedenceParser.CARET_ID) ? bp - 1 : bp + 1;\n          this.parseExpression(rightBp, builder);\n          builder.emitOpcode(PrecedenceParser.INFIX_OPCODE[typeId]);\n        }\n      } else {\n        // Tier 2: Plugin parselet fallback, full flexibility for custom syntax\n        const infixParselet = registry.getInfix(lookahead.typeId);\n        if (!infixParselet) break;\n        if (infixParselet.bindingPower <= minBp) break;\n\n        this.current = ++idx;\n\n        if (this.diagnosticPipeline) {\n          this.fireParseletMatched(infixParselet, lookahead, false, infixParselet.bindingPower);\n        }\n        // Expose the level this parselet is bound at, so one that peeks past its\n        // own token (a unit literal weighing whether a trailing `in`/`to` is\n        // its own or an outer operator's) can respect precedence. See\n        // infixMinBindingPower's doc comment.\n        this.infixMinBindingPower = minBp;\n        // Parselet handles its own recursion for right operand internally\n        infixParselet.parse(this, token, lookahead, builder);\n      }\n\n      idx = this.current;\n    }\n\n    this.current = idx;\n    this.depth--;\n  }\n\n  // ═══════════════════════════════════════════════════════════════════════════════\n  // Prefix dispatch: inline switch for built-ins, parselet registry for plugins\n  // ═══════════════════════════════════════════════════════════════════════════════\n\n  /**\n   * Parse a prefix token. Built-in tokens (NUMBER, IDENT, LPAREN, etc.) are\n   * handled inline with zero registry lookup. Everything else falls through\n   * to the parselet registry (Tier 2).\n   */\n  private parsePrefix(token: Token): void {\n    const builder = this.builder;\n    const typeId = token.typeId;\n\n    if (this.diagnosticPipeline) {\n      // Fast path below skips the registry for built-ins, but they're still\n      // registered there (for introspection/tests), look up here so the\n      // playground's \"matched parselets\" view isn't permanently blind to\n      // every number, identifier, paren, and unary operator.\n      const parselet = this.registry.getPrefix(typeId);\n      if (parselet) {\n        this.fireParseletMatched(parselet, token, true);\n      }\n    }\n\n    switch (typeId) {\n      // ── Numeric literals ──────────────────────────────────────────────────\n      case PrecedenceParser.NUMBER_ID: {\n        // Parse number with locale-aware separator normalization\n        let v: number;\n        // The exact dot-decimal text for a literal written with a fractional\n        // point, so it can be pushed as PUSH_DECIMAL and keep its precision\n        // where it later meets money. Stays null for every integer shape\n        // (hex/bin/oct, chained-dot grouping, plain integers), which push the\n        // ordinary PUSH_NUMBER and are unchanged.\n        let decimalText: string | null = null;\n        const raw = token.value;\n        if (raw.startsWith(\"0x\") || raw.startsWith(\"0X\")) {\n          v = parseInt(raw, 16);\n          // A prefix with no digits after it (\"0x\" alone) makes parseInt\n          // return NaN. This used to push straight through as a silent\n          // NaN Number value instead of a visible error.\n          if (Number.isNaN(v)) {\n            throw ErrorFactory.parsing(\"INVALID_NUMBER_LITERAL\", `Invalid hex literal: \"${raw}\"`, { raw });\n          }\n        } else if (raw.startsWith(\"0b\") || raw.startsWith(\"0B\")) {\n          v = parseInt(raw.slice(2), 2);\n          if (Number.isNaN(v)) {\n            throw ErrorFactory.parsing(\"INVALID_NUMBER_LITERAL\", `Invalid binary literal: \"${raw}\"`, { raw });\n          }\n        } else if (raw.startsWith(\"0o\") || raw.startsWith(\"0O\")) {\n          v = parseInt(raw.slice(2), 8);\n          if (Number.isNaN(v)) {\n            throw ErrorFactory.parsing(\"INVALID_NUMBER_LITERAL\", `Invalid octal literal: \"${raw}\"`, { raw });\n          }\n        } else if (CHAINED_DOT_THOUSANDS_GROUPS.test(raw)) {\n          // The lexer accepts \".\" as a thousands-group separator\n          // independent of locale (ExpressionLexer's number-scanning\n          // \"Thousands separators\" block), but the locale-based\n          // normalization below only strips the ACTIVE locale's own\n          // configured thousandsSeparator character, for \"en\" that's\n          // \",\", not \".\", so a chained dot-grouped literal like\n          // \"1.234.567\" fell through to parseFloat() untouched, which\n          // stops at the second \".\" and silently truncated it to 1.234\n          // (over 99% of the digits dropped, with no error). This is the\n          // REAL number-parsing path for actual evaluation, Tier 1 of\n          // the two-tier dispatch above always returns for NUMBER_ID, so\n          // NumberParselet.parse() (which has the identical fix) never\n          // actually runs except via direct unit tests / the \"matched\n          // parselets\" diagnostic display.\n          v = parseFloat(raw.split(\".\").join(\"\"));\n        } else {\n          const locale = getLocale(this.localeCode);\n          const decimalSep = locale.display.decimalSeparator;\n          const thousandsSep = locale.display.thousandsSeparator;\n          let normalized = raw;\n          // Replace thousands separator with empty string (split+join avoids per-call RegExp compilation)\n          if (thousandsSep) {\n            normalized = normalized.split(thousandsSep).join(\"\");\n          }\n          // Replace locale decimal separator with \".\" for JavaScript parsing\n          if (decimalSep && decimalSep !== \".\") {\n            normalized = normalized.replace(decimalSep, \".\");\n          }\n          v = parseFloat(normalized);\n          // A plain fractional literal (digits, one dot, digits) is what carries\n          // an exact decimal. Scientific notation like \"2.5e-3\" has a dot too\n          // but no exact base-ten form worth the trouble, so it stays a\n          // PUSH_NUMBER double, and so does any integer (grouping stripped).\n          if (PLAIN_DECIMAL.test(normalized)) decimalText = normalized;\n        }\n        if (decimalText !== null) {\n          builder.emitOpcode(OpCode.PUSH_DECIMAL);\n          builder.emitString(decimalText);\n          return;\n        }\n        builder.emitOpcode(OpCode.PUSH_NUMBER);\n        builder.emitNumber(v);\n        return;\n      }\n\n      case PrecedenceParser.BIGINT_ID: {\n        // Strips the `n` and any thousands grouping the lexer coalesced in.\n        // This used to be `raw.slice(0, -1)` and nothing else, so `1.000n`\n        // reached BigInt(\"1.000\") and threw a raw SyntaxError. See\n        // parser/BigIntLiteral.ts, which the parselet tier shares.\n        builder.emitOpcode(OpCode.PUSH_BIGINT);\n        builder.emitString(bigIntLiteralDigits(token.value, this.localeCode));\n        return;\n      }\n\n      case PrecedenceParser.STRING_ID: {\n        builder.emitOpcode(OpCode.PUSH_STRING);\n        builder.emitString(token.value);\n        return;\n      }\n\n      // ── Identifiers (variables) ────────────────────────────────────────────\n      case PrecedenceParser.IDENT_ID: {\n        // An identifier immediately followed by \"(\" may be a user-defined\n        // function DEFINITION (`f(x) = ...`) or CALL (`f(5)`). See\n        // parseUserFunctionDefOrCall's doc comment for the full\n        // disambiguation. Only the (cheap) LPAREN check runs for the\n        // overwhelmingly common case of a bare identifier with nothing\n        // following it.\n        if (this.peek()?.typeId === PrecedenceParser.LPAREN_ID) {\n          this.parseUserFunctionDefOrCall(token, builder);\n          return;\n        }\n        // IDENT tokens map to LOAD_VAR by default. The IdentifierParselet\n        // and VariableParselet add STORE_VAR for assignments, those are\n        // handled via the parselet registry below. Note this is also how a\n        // user-defined function's own PARAMETER references compile. See\n        // UserFunctionDef's doc comment in BytecodeBuilder.ts for why there\n        // is no separate parameter-load opcode: `LOAD_VAR` resolution\n        // dynamically checks the VM's innermost call frame first.\n        builder.emitOpcode(OpCode.LOAD_VAR);\n        builder.emitString(token.value);\n        return;\n      }\n\n      // ── Grouping / bare-tuple vector literal ─────────────────────────────────\n      // `(expr)` groups for precedence; `(x, y[, z[, w]])` is the bare-tuple\n      // vector literal documented as an alternative to vec2/vec3/vec4(...)\n      // (wiki: Arithmetic/Vector). This Tier-1 case is what actually runs for\n      // every LPAREN in production parsing, GroupParselet.ts mirrors this\n      // logic for registry-introspection/diagnostic-listing purposes, but a\n      // package can never override LPAREN's dispatch here (Tier 1 always\n      // wins over the ParseletRegistry fallback below), so both must be kept\n      // in sync by hand.\n      case PrecedenceParser.LPAREN_ID: {\n        this.parseExpression(0, builder);\n        let count = 1;\n        while (this.match(TokenTypes.COMMA)) {\n          this.parseExpression(0, builder);\n          count++;\n        }\n        this.consume(TokenTypes.RPAREN);\n        if (count > 1) {\n          // Legacy bare-tuple vector sugar, a 1xN row-vector Matrix (see\n          // packages/vector/parselets/VectorParselet.ts's comment).\n          builder.emitOpcode(OpCode.MAT_NEW);\n          builder.emitIndex(1);\n          builder.emitIndex(count);\n        }\n        return;\n      }\n\n      // ── Unary operators ───────────────────────────────────────────────────\n      case PrecedenceParser.MINUS_ID: {\n        this.parseExpression(BindingPower.Prefix, builder);\n        builder.emitOpcode(OpCode.NEG);\n        return;\n      }\n\n      case PrecedenceParser.PLUS_ID: {\n        this.parseExpression(BindingPower.Prefix, builder);\n        builder.emitOpcode(OpCode.POS);\n        return;\n      }\n\n      // ── Keyword constants ─────────────────────────────────────────────────\n      case PrecedenceParser.KEYWORD_ID: {\n        // Keywords are handled by parselets (pi→PI, e→E, etc.)\n        // Fall through to registry below.\n      }\n    }\n\n    // ── Tier 2: Plugin/parselet prefix path ──────────────────────────────────\n    const prefixParselet = this.registry.getPrefix(typeId);\n    if (!prefixParselet) {\n      throw ErrorFactory.parsing(\n        \"NO_PREFIX_PARSELET\",\n        `No prefix parselet found for token: ${token.type} (\"${token.value}\")`,\n        { tokenType: token.type, tokenValue: token.value }\n      );\n    }\n\n    prefixParselet.parse(this, token, builder);\n  }\n\n  // ═══════════════════════════════════════════════════════════════════════════════\n  // The \"Tier-1 shape-exception\" pattern\n  // ═══════════════════════════════════════════════════════════════════════════════\n  //\n  // Tier 1 exists purely for performance, avoid a Map lookup + parselet call\n  // on ~95% of tokens (see this file's own module doc comment above). A\n  // recurring consequence: any grammar shape tied to a Tier-1 token type can\n  // ONLY be implemented by hand-editing this switch, since a package-\n  // registered ParseletRegistry parselet for that same token type would\n  // simply never run in production (Tier 1 always wins over the registry\n  // fallback). Five confirmed instances of this tension exist in this file\n  // (plus one that had to move OUTSIDE it entirely):\n  //   1. NUMBER_ID, the full locale-aware number-literal parsing (hex/\n  //      binary/octal, chained-dot thousands grouping, decimal-separator\n  //      normalization) is inlined in parsePrefix() above; NumberParselet.ts's\n  //      own copy is dead code for real evaluation, kept registered only for\n  //      the \"matched parselets\" diagnostic view.\n  //   2. IDENT_ID, parseUserFunctionDefOrCall's lookahead (below) disambig-\n  //      uates a function DEFINITION from a CALL from a plain variable load.\n  //   3. LPAREN_ID, the bare-tuple vector-literal sugar (\"(x,y[,z[,w]])\" ->\n  //      MAT_NEW) is inlined in parsePrefix() above; GroupParselet.ts mirrors\n  //      it for introspection only and must be kept in sync by hand.\n  //   4. CARET_ID, the transpose/inverse suffix table just below.\n  //   5. PLUS_ID, the locale word \"and\" lexes as PLUS (Tier-1, fixed Sum\n  //      binding power), so a registry parselet can never intercept it the\n  //      way LogicalParselet.ts intercepts \"or\"/&&/||; unlike the other four,\n  //      there's no SHAPE to special-case on here (the token itself IS the\n  //      operator), so the workaround lives entirely outside this file, as a\n  //      runtime Boolean/Boolean type-check inside vm/VM.ts's OpCode.ADD\n  //      handler instead.\n  //\n  // Deliberate non-goal: none of this is exposed as an IEnginePackage\n  // extension point (unlike prefixParselets/infixParselets). Letting\n  // third-party packages register their own Tier-1 shape-matchers would put\n  // per-package matcher iteration on a genuinely hot path (every CARET/\n  // NUMBER/IDENT/LPAREN/PLUS token, matched or not), a materially bigger\n  // separate product decision than \"make this one table more concise,\" and\n  // not one this pattern write-up makes.\n\n  /**\n   * A single `^`-suffix shape: `matches` peeks ahead (consuming nothing) to\n   * check whether this shape starts at the current position; `emit` is only\n   * called immediately after `matches` returned true for that SAME position,\n   * and is responsible for consuming that shape's own trailing tokens and\n   * emitting its bytecode.\n   */\n  private static readonly CARET_SUFFIX_RULES: ReadonlyArray<{\n    name: string;\n    matches(parser: PrecedenceParser): boolean;\n    emit(parser: PrecedenceParser, builder: BytecodeBuilder): void;\n  }> = [\n    {\n      name: \"transpose (^T)\",\n      matches: (p) => {\n        const next = p.peek();\n        return next?.type === TokenTypes.IDENT && next.value === \"T\";\n      },\n      emit: (p, builder) => {\n        p.advance();\n        builder.emitOpcode(OpCode.CALL_BUILTIN);\n        builder.emitIndex(63); // transpose — see VMBuiltins.ts\n        builder.emitIndex(1);\n      },\n    },\n    {\n      name: \"inverse (^-1)\",\n      matches: (p) => {\n        const next = p.peek();\n        if (next?.typeId !== PrecedenceParser.MINUS_ID) return false;\n        const afterMinus = p.peekAt(1);\n        return afterMinus?.type === TokenTypes.NUMBER && afterMinus.value === \"1\";\n      },\n      emit: (p, builder) => {\n        p.advance();\n        p.advance();\n        builder.emitOpcode(OpCode.CALL_BUILTIN);\n        builder.emitIndex(65); // inv — see VMBuiltins.ts\n        builder.emitIndex(1);\n      },\n    },\n  ];\n\n  /**\n   * After a `^` token (already consumed by the Tier-1 infix loop above),\n   * checks {@link CARET_SUFFIX_RULES} in order for a shape that means\n   * something other than ordinary exponentiation: `^T` (transpose) and `^-1`\n   * (matrix inverse, LITERALLY the integer exponent `-1`; `^-2`, `^-1.5`\n   * etc. still mean ordinary exponentiation). On a match, the rule's `emit`\n   * consumes that shape's own tokens and this returns `true`. On no match,\n   * consumes NOTHING, returning `false` so the caller falls through to\n   * ordinary `EXP` parsing.\n   *\n   * Every rule dispatches purely on SHAPE, never on operand type (unknowable\n   * at parse time): `inv()`'s own handler (`VMBuiltins.ts` index 65) returns\n   * `1/x` for a plain Number, byte-identical to what `Math.pow(x, -1)`\n   * already computed for `x^-1` before this feature existed, and a real\n   * matrix inverse for a Matrix, so `5^-1` still means exactly what it always\n   * has; only a Matrix operand actually inverts.\n   *\n   * Adding a future `^`-suffix shape is a new table entry here, not a new\n   * if-block. See the \"Tier-1 shape-exception\" pattern write-up above for\n   * why this table can't instead be a package-registered parselet.\n   */\n  private tryEmitMatrixCaretOp(builder: BytecodeBuilder): boolean {\n    for (const rule of PrecedenceParser.CARET_SUFFIX_RULES) {\n      if (rule.matches(this)) {\n        rule.emit(this, builder);\n        return true;\n      }\n    }\n    return false;\n  }\n\n  // ═══════════════════════════════════════════════════════════════════════════════\n  // User-defined, parameterized, reusable functions (f(x) = 2*x + 1, then f(5))\n  // ═══════════════════════════════════════════════════════════════════════════════\n\n  /**\n   * From an LPAREN token index, scan forward tracking paren depth and\n   * return the index of the matching RPAREN, or `null` if the parens never\n   * balance before the token stream ends. No emission, no position\n   * advance. Same class of technique as {@link balanceParens}'s own\n   * pre-scan, just exposed mid-parse instead of only at `load()` time.\n   * `openIdx` must point AT the LPAREN itself.\n   */\n  private findMatchingRParen(openIdx: number): number | null {\n    let depth = 0;\n    for (let i = openIdx; i < this.tokens.length; i++) {\n      const t = this.tokens[i];\n      if (t.typeId === PrecedenceParser.LPAREN_ID) depth++;\n      else if (t.typeId === PrecedenceParser.RPAREN_ID) {\n        depth--;\n        if (depth === 0) return i;\n      }\n    }\n    return null;\n  }\n\n  /**\n   * Disambiguates a bare `IDENT` immediately followed by `(` between three\n   * things, using ONLY a bracket-depth scan (no backtracking, nothing is\n   * consumed until the shape is known):\n   * - `f(x) = expr`, a DEFINITION: the matching `)` is followed by `=`.\n   * - `f(5)`, a CALL to a (possibly not-yet-defined) function: anything\n   *   else. This was never valid syntax before this feature (a bare\n   *   `IDENT` immediately before `(` has no pre-existing \"plain variable\n   *   read + separately grouped `(...)`\" meaning to preserve, confirmed\n   *   via `BuiltinNormalizerRules.ts`'s `implicitMultiplyRule()`, which\n   *   only inserts an implicit `*` for `NUMBER/RPAREN` immediately before\n   *   `IDENT/LPAREN`, never for a bare `IDENT` immediately before\n   *   `LPAREN`). Always commits to a CALL; an unregistered name produces a\n   *   clear `UNDEFINED_FUNCTION` error at VM-execution time, the same\n   *   forward-reference philosophy `LOAD_VAR`/`UNDEFINED_VARIABLE` already\n   *   uses, rather than any parse-time registry lookup.\n   * If the parens never balance, this falls through to the ordinary\n   * `LOAD_VAR` path (a malformed expression surfaces its own parse error\n   * shortly after, from the normal expression grammar).\n   */\n  private parseUserFunctionDefOrCall(nameToken: Token, builder: BytecodeBuilder): void {\n    const closeIdx = this.findMatchingRParen(this.current);\n    if (closeIdx === null) {\n      builder.emitOpcode(OpCode.LOAD_VAR);\n      builder.emitString(nameToken.value);\n      return;\n    }\n    const afterClose = this.tokens[closeIdx + 1];\n    if (afterClose?.type === TokenTypes.EQUALS) {\n      this.parseUserFunctionDefinition(nameToken, builder);\n    } else {\n      this.parseUserFunctionCall(nameToken, builder);\n    }\n  }\n\n  /**\n   * A parameter name, accepted as either `IDENT` or `UNIT`, matches this\n   * codebase's established `:name = value` variable-name policy\n   * (`VariableParselet.ts` explicitly accepts `UNIT`-typed tokens too, e.g.\n   * `:b = 5` for the \"b\" bits unit) since common short parameter names\n   * like `h`/`l`/`b`/`t`/`s`/`m` collide with real unit abbreviations\n   * (hour, liter, bits, ton, second, meter, ...) and lex as `UNIT`, not\n   * `IDENT`.\n   */\n  private consumeParamName(): string {\n    const token = this.peek();\n    if (token?.type === TokenTypes.IDENT || token?.type === TokenTypes.UNIT) {\n      this.consume();\n      return token.value;\n    }\n    throw ErrorFactory.parsing(\n      \"USER_FUNCTION_INVALID_PARAM_NAME\",\n      `Expected a parameter name but got \"${token?.type ?? \"end of input\"}\"${token ? ` (\"${token.value}\")` : \"\"}`,\n      { actualType: token?.type },\n    );\n  }\n\n  private parseUserFunctionDefinition(nameToken: Token, builder: BytecodeBuilder): void {\n    this.consume(TokenTypes.LPAREN);\n    const params: string[] = [];\n    if (this.peek()?.type !== TokenTypes.RPAREN) {\n      params.push(this.consumeParamName());\n      while (this.match(TokenTypes.COMMA)) {\n        params.push(this.consumeParamName());\n      }\n    }\n    this.consume(TokenTypes.RPAREN);\n    this.consume(TokenTypes.EQUALS);\n\n    if (params.length === 0) {\n      throw ErrorFactory.parsing(\n        \"USER_FUNCTION_NO_PARAMS\",\n        `\"${nameToken.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)`,\n        { name: nameToken.value },\n      );\n    }\n\n    // Compile the body into its OWN independent BytecodeBuilder, reusing\n    // the SAME parser/token stream but directing emission elsewhere.\n    // `parseExpression(minBp, _builder)` sets `this.builder = _builder`\n    // with NO automatic restore, explicitly restoring via `setBuilder()`\n    // afterward (not a `finally`, since a thrown parse error here should\n    // propagate as-is; there's no further use of `this.builder` on that\n    // path before the whole parse aborts) avoids silently emitting\n    // whatever parses next (in this same expression, or, via\n    // ExpressionEngine's builder pool, a LATER, unrelated line) into a\n    // stale, already-.build()'d body builder.\n    const bodyBuilder = new BytecodeBuilder(this.pluginFunctionIndex);\n    this.parseExpression(BindingPower.Lowest, bodyBuilder);\n    this.setBuilder(builder);\n\n    const bodyProgram = bodyBuilder.build();\n    if (bodyProgram.hasAsync) {\n      // v1 scope decision: a function body calling an async plugin\n      // (weather, stocks, currency, ...) isn't supported yet, propagating\n      // a 'pending' result up through a reentrant executeBytecode() call\n      // would need the OUTER expression's own bytecode position/stack\n      // state to also be resumable later, which this first pass doesn't\n      // implement. Rejecting at DEFINITION time (not call time) gives the\n      // clearest possible error, matching this codebase's \"never silently\n      // pretend to support something it doesn't\" convention (e.g.\n      // addBusinessDays()'s own disclosed holiday-exclusion scope-down).\n      throw ErrorFactory.parsing(\n        \"FUNCTION_BODY_MUST_BE_SYNCHRONOUS\",\n        `\"${nameToken.value}(...)\"'s body calls an async operation (weather, stocks, currency, ...) — user-defined function bodies must be synchronous`,\n        { name: nameToken.value },\n      );\n    }\n\n    const bodyIdx = builder.emitUserFunctionBody(nameToken.value, params, bodyProgram);\n    builder.emitOpcode(OpCode.DEFINE_USER_FUNCTION);\n    builder.emitIndex(bodyIdx);\n\n    // A definition line has no single input value to echo back the way an\n    // assignment does, push a plain confirmation string, matching this\n    // codebase's \"never silently produce a misleading numeric 0\" principle.\n    builder.emitOpcode(OpCode.PUSH_STRING);\n    builder.emitString(`${nameToken.value}(${params.join(\", \")}) defined`);\n  }\n\n  private parseUserFunctionCall(nameToken: Token, builder: BytecodeBuilder): void {\n    this.consume(TokenTypes.LPAREN);\n    let argCount = 0;\n    if (this.peek()?.type !== TokenTypes.RPAREN) {\n      this.parseExpression(BindingPower.Lowest, builder);\n      argCount++;\n      while (this.match(TokenTypes.COMMA)) {\n        this.parseExpression(BindingPower.Lowest, builder);\n        argCount++;\n      }\n    }\n    this.consume(TokenTypes.RPAREN);\n\n    builder.emitOpcode(OpCode.CALL_USER_FUNCTION);\n    builder.emitString(nameToken.value);\n    builder.emitByte(argCount);\n  }\n\n  // ═══════════════════════════════════════════════════════════════════════════════\n  // Token stream navigation (identical API to Parser)\n  // ═══════════════════════════════════════════════════════════════════════════════\n\n  consume(expectedType?: string): Token {\n    const token = this.tokens[this.current];\n    if (!token) {\n      throw ErrorFactory.parsing(\n        \"UNEXPECTED_END_OF_INPUT\",\n        \"Unexpected end of input\"\n      );\n    }\n    if (expectedType !== undefined) {\n      const expectedId = tokenTypeId(expectedType);\n      if (token.typeId !== expectedId) {\n        throw ErrorFactory.parsing(\n          \"UNEXPECTED_TOKEN_TYPE\",\n          `Expected token type \"${expectedType}\" but got \"${token.type}\" (\"${token.value}\")`,\n          { expectedType, actualType: token.type, actualValue: token.value }\n        );\n      }\n    }\n    this.current++;\n    return token;\n  }\n\n  match(expectedType: string): boolean {\n    const token = this.peek();\n    if (token && token.typeId === tokenTypeId(expectedType)) {\n      this.advance();\n      return true;\n    }\n    return false;\n  }\n\n  peek(): Token | undefined {\n    return this.tokens[this.current];\n  }\n\n  /**\n   * Read-only lookahead `offset` tokens past the current position, without\n   * consuming anything, `peekAt(0)` is equivalent to {@link peek}.\n   * `this.tokens` is a plain in-memory array (not a stream), so this is a\n   * simple, safe index read; no rewind/checkpoint mechanism is needed since\n   * nothing is consumed.\n   */\n  peekAt(offset: number): Token | undefined {\n    return this.tokens[this.current + offset];\n  }\n\n  previous(): Token | undefined {\n    return this.current > 0 ? this.tokens[this.current - 1] : undefined;\n  }\n\n  private advance(): void {\n    this.current++;\n  }\n\n  // ═══════════════════════════════════════════════════════════════════════════════\n  // Builder access, set before parse, read by inline prefix handlers\n  // ═══════════════════════════════════════════════════════════════════════════════\n\n  /** Set the builder to use for the current parse. Called by ExpressionEngine. */\n  setBuilder(builder: BytecodeBuilder): void {\n    this.builder = builder;\n  }\n\n  // ═══════════════════════════════════════════════════════════════════════════════\n  // Diagnostics\n  // ═══════════════════════════════════════════════════════════════════════════════\n\n  private fireParseletMatched(\n    parselet: { category: string },\n    token: Token,\n    isPrefix: boolean,\n    bindingPower?: number\n  ): void {\n    const pipeline = this.diagnosticPipeline!;\n    const event: DiagnosticEvent & { type: \"parselet_matched\" } = {\n      type: DiagnosticEventType.ParseletMatched,\n      elapsedNs: 0,\n      expression: this.currentExpression,\n      tokenType: token.type,\n      tokenValue: token.value,\n      parseletCategory: parselet.category,\n      parseletType: parselet.constructor?.name ?? \"unknown\",\n      isPrefix,\n      bindingPower,\n      tokenOffset: token.offset || 0,\n    };\n    pipeline.fireParseletMatched(event);\n  }\n}\n","import { PrefixParselet, InfixParselet } from \"@solve-js/parser/Parselet\";\nimport { tokenTypeId } from \"@solve-js/lexer/Token\";\nimport { BindingPower } from \"@solve-js/parser/BindingPower\";\n\n/**\n * The one binding-power field a parselet may expose beyond what its interface\n * requires, read only for diagnostic display.\n *\n * `InfixParselet` requires `bindingPower`; `PrefixParselet` declares none, and\n * some prefix parselets carry one anyway. That single field is the whole\n * optional surface deliberately. A `leftBindingPower`/`rightBindingPower` pair\n * used to be read here as well, and reading a name off an object this way finds\n * PRIVATE fields too, since TypeScript's `private` exists only at compile time:\n * `BinaryOpParselet` holds a private `rightBindingPower` meaning \"the minimum\n * power to parse my right operand at\", which is a different quantity from \"the\n * power at which I bind to my right\" and differs from it by one. Reading it\n * silently reported that other number. So neither is read.\n *\n * `category` is not here: both interfaces already declare it.\n */\ninterface ParseletBindingPowers {\n\treadonly bindingPower?: number;\n}\n\n/** Reads the optional binding-power field off a parselet for diagnostics. */\nfunction bindingPowersOf(parselet: PrefixParselet | InfixParselet): ParseletBindingPowers {\n\treturn parselet as ParseletBindingPowers;\n}\n\n/**\n * Dual-keyed ParseletRegistry, accepts both string token types and\n * integer token type IDs for fast dispatch in the Parser hot path.\n *\n * Providers call registerPrefix(\"NUMBER\", ...) with string token types.\n * Internally, we populate both string-keyed and integer-keyed maps so\n * Parser.parseExpression() can use token.typeId (integer) for lookup\n * while diagnostics and error messages use token.type (string).\n *\n * Performance: Integer Map.get() avoids string hashing, saving ~2-5ns\n * per dispatch. With ~10-15 dispatches per expression, that's ~20-75ns.\n */\nexport class ParseletRegistry {\n\t// String-keyed maps (kept for diagnostics + backwards compat)\n\tprivate prefixParselets: Map<string, PrefixParselet> = new Map();\n\tprivate infixParselets: Map<string, InfixParselet> = new Map();\n\n\t// Integer-keyed maps for parser hot path\n\tprivate prefixById: Map<number, PrefixParselet> = new Map();\n\tprivate infixById: Map<number, InfixParselet> = new Map();\n\n\t/**\n\t * Register a prefix parselet for `tokenType`.\n\t *\n\t * If another parselet is already registered for this token type, it is\n\t * silently overwritten by default (`Map.set()` semantics), the old\n\t * parselet is simply unreachable from then on, with no error. This is\n\t * a real footgun for third-party packages: two packages independently\n\t * choosing the same custom token type will collide with zero signal\n\t * about which one \"won\". Mirrors ResolverRegistry.register()'s and\n\t * ExpressionEngine.registerPackage()'s existing \"warn and replace\"\n\t * pattern for the same class of problem at the resolver-namespace and\n\t * package-name levels.\n\t *\n\t * Note: this warns about registry-level collisions only. It does NOT\n\t * detect the separate case where `tokenType` is one of PrecedenceParser's\n\t * Tier-1 fast-path token types (NUMBER, STRING, IDENT, LPAREN, MINUS,\n\t * PLUS, and the Tier-1 infix operators), those are deliberately kept\n\t * registered here for introspection/diagnostics even though Tier-1\n\t * always intercepts them before this registry is consulted (see\n\t * PrecedenceParser.parsePrefix()'s docs), so warning there would\n\t * misfire on that intentional, already-documented pattern.\n\t */\n\tregisterPrefix(tokenType: string, parselet: PrefixParselet): void {\n\t\tconst existing = this.prefixParselets.get(tokenType);\n\t\tif (existing && existing !== parselet) {\n\t\t\tconsole.warn(\n\t\t\t\t`[ParseletRegistry] Prefix parselet for token \"${tokenType}\" is already registered ` +\n\t\t\t\t`(category: \"${existing.category ?? \"unknown\"}\"). Overwriting with a new ` +\n\t\t\t\t`parselet (category: \"${parselet.category ?? \"unknown\"}\") — the previous ` +\n\t\t\t\t`parselet is now unreachable. Two packages may be claiming the same token type.`,\n\t\t\t);\n\t\t}\n\t\tthis.prefixParselets.set(tokenType, parselet);\n\t\tthis.prefixById.set(tokenTypeId(tokenType), parselet);\n\t}\n\n\t/** Register an infix parselet for `tokenType`. See {@link registerPrefix} for the collision-warning behavior this mirrors. */\n\tregisterInfix(tokenType: string, parselet: InfixParselet): void {\n\t\tconst existing = this.infixParselets.get(tokenType);\n\t\tif (existing && existing !== parselet) {\n\t\t\tconsole.warn(\n\t\t\t\t`[ParseletRegistry] Infix parselet for token \"${tokenType}\" is already registered ` +\n\t\t\t\t`(category: \"${existing.category ?? \"unknown\"}\"). Overwriting with a new ` +\n\t\t\t\t`parselet (category: \"${parselet.category ?? \"unknown\"}\") — the previous ` +\n\t\t\t\t`parselet is now unreachable. Two packages may be claiming the same token type.`,\n\t\t\t);\n\t\t}\n\t\tthis.infixParselets.set(tokenType, parselet);\n\t\tthis.infixById.set(tokenTypeId(tokenType), parselet);\n\t}\n\n\t/**\n\t * Iterate all registered prefix parselets for diagnostic display.\n\t *\n\t * `PrefixParselet` declares no binding power, and this used to read a field\n\t * of that name and report 0 for every one of them. 0 is not a neutral\n\t * wrong answer: it is the value that means \"not an operator, stop the\n\t * expression\", so a host drawing a table from this was told none of them\n\t * bind at all. A prefix parselet in this parser has no per-parselet power\n\t * to report, they all bind at the prefix level and each chooses for itself\n\t * at what power to parse its own operand, so that level is what is\n\t * reported. A parselet that does carry its own `bindingPower` still wins.\n\t */\n\tgetAllPrefix(): Array<{ tokenType: string; bindingPower: number; category?: string }> {\n\t\tconst result: Array<{ tokenType: string; bindingPower: number; category?: string }> = [];\n\t\tfor (const [tokenType, parselet] of this.prefixParselets) {\n\t\t\tresult.push({\n\t\t\t\ttokenType,\n\t\t\t\tbindingPower: bindingPowersOf(parselet).bindingPower ?? BindingPower.Prefix,\n\t\t\t\tcategory: parselet.category,\n\t\t\t});\n\t\t}\n\t\treturn result;\n\t}\n\n\t/**\n\t * Iterate all registered infix parselets for diagnostic display.\n\t *\n\t * The field an `InfixParselet` actually declares is `bindingPower`. This\n\t * used to read `leftBindingPower` and `rightBindingPower`, which no\n\t * parselet in this codebase declares, so both reads were `undefined`, both\n\t * fell to the `?? 0` default, and the public `getParseletRegistry()`\n\t * reported a binding power of 0 for every one of the ~60 infix operators.\n\t * A host building a precedence table from it was told `*` and `+` bind\n\t * equally, and that neither binds at all.\n\t *\n\t * The left/right split: `bindingPower` is the LEFT power, and the right is\n\t * one higher. That is the standard encoding for a left-associative\n\t * operator, and it is what the parser itself does, see\n\t * `PrecedenceParser.parseExpression()`'s `bp + 1` for the right operand.\n\t * Every operator is reported that way, `^` included. Associativity is not\n\t * something a parselet declares, it is a property of how each one calls\n\t * `parseExpression`, so this API cannot report it without a new field on\n\t * the interface. See {@link ParseletBindingPowers} for why scraping a\n\t * plausible-looking one off the parselet is worse than not reporting it.\n\t */\n\tgetAllInfix(): Array<{ tokenType: string; leftBindingPower: number; rightBindingPower: number; category?: string }> {\n\t\tconst result: Array<{ tokenType: string; leftBindingPower: number; rightBindingPower: number; category?: string }> = [];\n\t\tfor (const [tokenType, parselet] of this.infixParselets) {\n\t\t\tconst left = bindingPowersOf(parselet).bindingPower ?? 0;\n\t\t\tresult.push({\n\t\t\t\ttokenType,\n\t\t\t\tleftBindingPower: left,\n\t\t\t\trightBindingPower: left + 1,\n\t\t\t\tcategory: parselet.category,\n\t\t\t});\n\t\t}\n\t\treturn result;\n\t}\n\n\t/** Number of registered prefix parselets. */\n\tget prefixCount(): number { return this.prefixParselets.size; }\n\n\t/** Number of registered infix parselets. */\n\tget infixCount(): number { return this.infixParselets.size; }\n\n\t/**\n\t * Get prefix parselet by string token type OR integer typeId.\n\t * Fast path for integer IDs (Parser hot path), fallback for strings\n\t * (diagnostics, error messages, backwards compatibility).\n\t */\n\tgetPrefix(tokenType: string | number): PrefixParselet | undefined {\n\t\tif (typeof tokenType === 'number') return this.prefixById.get(tokenType);\n\t\treturn this.prefixParselets.get(tokenType);\n\t}\n\n\t/**\n\t * Get infix parselet by string token type OR integer typeId.\n\t * Fast path for integer IDs (Parser hot path), fallback for strings.\n\t */\n\tgetInfix(tokenType: string | number): InfixParselet | undefined {\n\t\tif (typeof tokenType === 'number') return this.infixById.get(tokenType);\n\t\treturn this.infixParselets.get(tokenType);\n\t}\n\n\thasPrefix(tokenType: string): boolean {\n\t\treturn this.prefixParselets.has(tokenType);\n\t}\n\n\thasInfix(tokenType: string): boolean {\n\t\treturn this.infixParselets.has(tokenType);\n\t}\n\n\tclear(): void {\n\t\tthis.prefixParselets.clear();\n\t\tthis.infixParselets.clear();\n\t\tthis.prefixById.clear();\n\t\tthis.infixById.clear();\n\t}\n}\n\n/**\n * A process-wide parselet registry.\n *\n * @deprecated An engine builds its own registry and does not read this one, so\n * registering here reaches nothing that evaluates. Nothing writes to it now\n * that the global package-registration path is gone; it remains only so the\n * `@solve-js/parser` escape hatch keeps a stable shape.\n */\nexport const sharedParseletRegistry = new ParseletRegistry();\n"]}

package/dist/chunk-EEVUKZ5B.cjs

@@ -1,2 +0,0 @@
-'use strict';var chunkGWCBPITD_cjs=require('./chunk-GWCBPITD.cjs'),chunk2XZCLDHJ_cjs=require('./chunk-2XZCLDHJ.cjs'),chunk6U66HQKQ_cjs=require('./chunk-6U66HQKQ.cjs'),chunkBKSKZA4W_cjs=require('./chunk-BKSKZA4W.cjs'),chunk6QRHN3I6_cjs=require('./chunk-6QRHN3I6.cjs'),chunkNAZ6PGLS_cjs=require('./chunk-NAZ6PGLS.cjs');function Yt(e,t){let n=t===2?chunk2XZCLDHJ_cjs.L:chunk2XZCLDHJ_cjs.M,o=n(e.n),r=n(e.d);return o===null||r===null?null:{n:o,d:r}}function Gt(e,t){let n=chunk2XZCLDHJ_cjs.y(e),o=new Map;for(let[r,i]of n){if(i%t!==0)return null;o.set(r,i/t);}return chunk2XZCLDHJ_cjs.x(o)}function jn(e,t){let n=chunk2XZCLDHJ_cjs.y(e);for(let[o,r]of chunk2XZCLDHJ_cjs.y(t))n.set(o,(n.get(o)??0)+r);return chunk2XZCLDHJ_cjs.x(n)}function jt(e,t){let n=chunk2XZCLDHJ_cjs.y(e);for(let[o,r]of chunk2XZCLDHJ_cjs.y(t)){let i=(n.get(o)??0)-r;i<=0?n.delete(o):n.set(o,i);}return chunk2XZCLDHJ_cjs.x(n)}function Kn(e,t){let n=chunk2XZCLDHJ_cjs.y(e),o=new Map;for(let[r,i]of chunk2XZCLDHJ_cjs.y(t)){let a=n.get(r);a!==void 0&&o.set(r,Math.min(a,i));}return chunk2XZCLDHJ_cjs.x(o)}function Xn(e){let t=new Set;for(let n of e)for(let o of chunk2XZCLDHJ_cjs.y(n).keys())t.add(o);return [...t].sort()}function Q(e){let t=new Map;for(let n of e)t.set(n.key,n.coefficient);return chunk2XZCLDHJ_cjs.E({terms:t,vars:Xn(e.map(n=>n.key))})}function Ze(e){let t=e[0];for(let n=1;n<e.length;n++)t={kind:"mul",left:t,right:e[n]};return t}function Zn(e){return [...e.terms].map(([n,o])=>({key:n,coefficient:o})).sort((n,o)=>chunk2XZCLDHJ_cjs.D(n.key,o.key,e.vars))}function Zt(e){if(e.vars.length<2)return null;let t=Zn(e);return t.length===2?Hn(t[0],t[1]):t.length===3?Wn(t):t.length===4?Qn(t):null}function Hn(e,t){let n=e.coefficient.n>0n,o=t.coefficient.n>0n;if(!n)return null;let r=He(e,t,2);if(r!==null&&!o)return Ze([Q([r.a,Te(r.b)]),Q([r.a,r.b])]);let i=He(e,t,3);if(i===null)return null;let a=Q(o?[i.a,i.b]:[i.a,Te(i.b)]),u=o?Te(Oe(i.a,i.b)):Oe(i.a,i.b);return Ze([a,Q([Kt(i.a),u,Kt(i.b)])])}function He(e,t,n){let o=t.coefficient.n<0n?chunk2XZCLDHJ_cjs.j(t.coefficient):t.coefficient,r=Yt(e.coefficient,n),i=Yt(o,n);if(r===null||i===null)return null;let a=Gt(e.key,n),u=Gt(t.key,n);return a===null||u===null?null:{a:{key:a,coefficient:r},b:{key:u,coefficient:i}}}function Te(e){return {key:e.key,coefficient:chunk2XZCLDHJ_cjs.j(e.coefficient)}}function Oe(e,t){return {key:jn(e.key,t.key),coefficient:chunk2XZCLDHJ_cjs.h(e.coefficient,t.coefficient)}}function Kt(e){return Oe(e,e)}function Wn(e){let[t,n,o]=e;if(t.coefficient.n<0n||o.coefficient.n<0n)return null;let r=He(t,o,2);if(r===null)return null;let i=Oe(r.a,r.b);if(i.key!==n.key)return null;let a=chunk2XZCLDHJ_cjs.h(i.coefficient,{n:2n,d:1n}),u=n.coefficient.n<0n,l=u?chunk2XZCLDHJ_cjs.j(n.coefficient):n.coefficient;return chunk2XZCLDHJ_cjs.m(chunk2XZCLDHJ_cjs.i(l,a))?{kind:"pow",base:Q([r.a,u?Te(r.b):r.b]),exponent:chunk2XZCLDHJ_cjs.p(2)}:null}function Qn(e){let t=[[[0,1],[2,3]],[[0,2],[1,3]],[[0,3],[1,2]]];for(let n of t){let o=Xt(e[n[0][0]],e[n[0][1]]),r=Xt(e[n[1][0]],e[n[1][1]]);if(!(o===null||r===null)&&zn(o.cofactor,r.cofactor))return Ze([Q([o.common,r.common]),Q(o.cofactor)])}return null}function Xt(e,t){let n=Kn(e.key,t.key),o={key:n,coefficient:e.coefficient},r=[{key:jt(e.key,n),coefficient:{n:1n,d:1n}},{key:jt(t.key,n),coefficient:chunk2XZCLDHJ_cjs.i(t.coefficient,e.coefficient)}];return r[0].key===r[1].key?null:{common:o,cofactor:r}}function zn(e,t){return e.length!==t.length?false:e.every((n,o)=>n.key===t[o].key&&n.coefficient.n===t[o].coefficient.n&&n.coefficient.d===t[o].coefficient.d)}var Jn=12,_e=4096;function we(e,t){let n=e<0n?-e:e,o=t<0n?-t:t;for(;o!==0n;){let r=n%o;n=o,o=r;}return n}function Wt(e,t){return e===0n||t===0n?0n:e/we(e,t)*t}function Ht(e){let t=e<0n?-e:e;if(t===0n)return null;let n=[];for(let o=1n;o*o<=t;o++){if(t%o!==0n)continue;n.push(o);let r=t/o;if(r!==o&&n.push(r),n.length>_e)return null}return n}function Qt(e,t){let n=chunk2XZCLDHJ_cjs.a;for(let o of e)n=chunk2XZCLDHJ_cjs.f(chunk2XZCLDHJ_cjs.h(n,t),o);return n}function eo(e,t){let n=[e[0]];for(let o=1;o<e.length-1;o++)n.push(chunk2XZCLDHJ_cjs.f(e[o],chunk2XZCLDHJ_cjs.h(n[o-1],t)));return n}function ue(e){if(e.length<2)return [];let t=1n;for(let s of e)t=Wt(t,s.d);let n=e.map(s=>s.n*t/s.d),o=n[0],r=n[n.length-1];if(r===0n)return [];let i=Ht(r),a=Ht(o);if(i===null||a===null)throw chunkNAZ6PGLS_cjs.c.execution("SYMBOLIC_FACTOR_LIMIT_EXCEEDED","This polynomial's coefficients have too many divisors to search for rational roots.",{limit:_e});if(i.length*a.length>_e)throw chunkNAZ6PGLS_cjs.c.execution("SYMBOLIC_FACTOR_LIMIT_EXCEEDED","This polynomial has too many candidate rational roots to test.",{limit:_e});let u=[],l=new Set;for(let s of i)for(let p of a)for(let h of [1n,-1n]){let x={n:h*s/we(s,p),d:p/we(s,p)},V=`${x.n}/${x.d}`;l.has(V)||(l.add(V),chunk2XZCLDHJ_cjs.l(Qt(e,x))&&u.push(x));}return u}function to(e,t){return chunk2XZCLDHJ_cjs.l(t)?chunk2XZCLDHJ_cjs.q(e):t.n>0n?{kind:"sub",left:chunk2XZCLDHJ_cjs.q(e),right:chunk2XZCLDHJ_cjs.p(t)}:{kind:"add",left:chunk2XZCLDHJ_cjs.q(e),right:chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.j(t))}}function no(e,t){let n=e.length-1,o=new Map;return e.forEach((r,i)=>{if(chunk2XZCLDHJ_cjs.l(r))return;let a=n-i;o.set(a===0?"":a===1?t:`${t}^${a}`,r);}),chunk2XZCLDHJ_cjs.E({terms:o,vars:o.size>0?[t]:[]})}function Qe(e,t){let n=[],o=[...e],r=ue(o);for(;r.length>0&&o.length>2;){for(let a of r){let u=0;for(;o.length>1&&chunk2XZCLDHJ_cjs.l(Qt(o,a));)o=eo(o,a),u++;u>0&&n.push({base:to(t,a),power:u});}r=o.length>2?ue(o):[];}return o.length-1>=1?(n.push({base:no(o,t),power:1}),{content:chunk2XZCLDHJ_cjs.b,factors:n}):{content:o.length===1?o[0]:chunk2XZCLDHJ_cjs.b,factors:n}}function oo(e){let t=[];chunk2XZCLDHJ_cjs.m(e.content)||t.push(chunk2XZCLDHJ_cjs.p(e.content));for(let o of e.factors)t.push(o.power===1?o.base:chunk2XZCLDHJ_cjs.r(o.base,chunk2XZCLDHJ_cjs.p({n:BigInt(o.power),d:1n})));if(t.length===0)return chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.b);let n=t[0];for(let o=1;o<t.length;o++)n={kind:"mul",left:n,right:t[o]};return n}function ro(e){let t=0n,n=1n;for(let o of e.terms.values())t=we(t,o.n),n=Wt(n,o.d);return t===0n?chunk2XZCLDHJ_cjs.b:{n:t,d:n}}function io(e){let t=new Map;for(let r of e.vars){let i=1/0;for(let a of e.terms.keys()){let u=ao(a,r);u<i&&(i=u);}i>0&&i!==1/0&&t.set(r,i);}if(t.size===0)return {monomial:t,reduced:e};let n=new Map;for(let[r,i]of e.terms){let a=We(r);for(let[u,l]of t)a.set(u,(a.get(u)??0)-l);n.set(uo(a),i);}let o=new Set;for(let r of n.keys())for(let i of We(r).keys())o.add(i);return {monomial:t,reduced:{terms:n,vars:[...o].sort()}}}function ao(e,t){return We(e).get(t)??0}function We(e){let t=new Map;if(e==="")return t;for(let n of e.split("*")){let o=n.indexOf("^");o===-1?t.set(n,1):t.set(n.slice(0,o),Number(n.slice(o+1)));}return t}function uo(e){return [...e.keys()].filter(n=>(e.get(n)??0)>0).sort().map(n=>e.get(n)===1?n:`${n}^${e.get(n)}`).join("*")}function lo(e){let t=[...e.keys()].sort(),n=null;for(let o of t){let r=e.get(o),i=r===1?chunk2XZCLDHJ_cjs.q(o):chunk2XZCLDHJ_cjs.r(chunk2XZCLDHJ_cjs.q(o),chunk2XZCLDHJ_cjs.p({n:BigInt(r),d:1n}));n=n===null?i:{kind:"mul",left:n,right:i};}return n}function zt(e){let t=chunk2XZCLDHJ_cjs.C(e);if(t===null||t.terms.size===0||chunk2XZCLDHJ_cjs.z(t)>Jn||t.vars.length===0)return e;let n=ro(t),o=chunk2XZCLDHJ_cjs.m(n)?t:so(t,chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.b,n)),{monomial:r,reduced:i}=io(o),a=lo(r),u=chunk2XZCLDHJ_cjs.A(i);if(u===null){let te=Zt(i);return te!==null?co(n,a,te):mo(n,a,i)??e}let l=[...chunk2XZCLDHJ_cjs.B(i,u)].reverse(),s=Qe(l,u),p=chunk2XZCLDHJ_cjs.h(n,s.content);if(s.factors.length<=1&&(s.factors[0]?.power??1)===1&&a===null&&chunk2XZCLDHJ_cjs.m(p))return e;let x=[];chunk2XZCLDHJ_cjs.m(p)||x.push(chunk2XZCLDHJ_cjs.p(p)),a!==null&&x.push(a),x.push(oo({content:chunk2XZCLDHJ_cjs.b,factors:s.factors}));let V=x[0];for(let te=1;te<x.length;te++)V={kind:"mul",left:V,right:x[te]};return V}function so(e,t){let n=new Map;for(let[o,r]of e.terms)n.set(o,chunk2XZCLDHJ_cjs.h(r,t));return {terms:n,vars:e.vars}}function co(e,t,n){let o=[];chunk2XZCLDHJ_cjs.m(e)||o.push(chunk2XZCLDHJ_cjs.p(e)),t!==null&&o.push(t),o.push(n);let r=o[0];for(let i=1;i<o.length;i++)r={kind:"mul",left:r,right:o[i]};return r}function mo(e,t,n){if(t===null&&chunk2XZCLDHJ_cjs.m(e))return null;let o=[];chunk2XZCLDHJ_cjs.m(e)||o.push(chunk2XZCLDHJ_cjs.p(e)),t!==null&&o.push(t),o.push(chunk2XZCLDHJ_cjs.E(n));let r=o[0];for(let i=1;i<o.length;i++)r={kind:"mul",left:r,right:o[i]};return r}var k={n:2n,d:1n},B={n:3n,d:1n},be={n:4n,d:1n};function fo(e,t,n,o){let r=chunk2XZCLDHJ_cjs.j(chunk2XZCLDHJ_cjs.i(t,chunk2XZCLDHJ_cjs.h(B,e))),i=chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.g(chunk2XZCLDHJ_cjs.h(B,chunk2XZCLDHJ_cjs.h(e,n)),chunk2XZCLDHJ_cjs.h(t,t)),chunk2XZCLDHJ_cjs.h(B,chunk2XZCLDHJ_cjs.h(e,e))),a=chunk2XZCLDHJ_cjs.h(k,chunk2XZCLDHJ_cjs.h(t,chunk2XZCLDHJ_cjs.h(t,t))),u=chunk2XZCLDHJ_cjs.h({n:9n,d:1n},chunk2XZCLDHJ_cjs.h(e,chunk2XZCLDHJ_cjs.h(t,n))),l=chunk2XZCLDHJ_cjs.h({n:27n,d:1n},chunk2XZCLDHJ_cjs.h(chunk2XZCLDHJ_cjs.h(e,e),o)),s=chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.f(chunk2XZCLDHJ_cjs.g(a,u),l),chunk2XZCLDHJ_cjs.h({n:27n,d:1n},chunk2XZCLDHJ_cjs.h(e,chunk2XZCLDHJ_cjs.h(e,e))));return {p:i,q:s,shift:r}}function en(e,t,n,o){let{p:r,q:i,shift:a}=fo(e,t,n,o),u=chunk2XZCLDHJ_cjs.j(chunk2XZCLDHJ_cjs.f(chunk2XZCLDHJ_cjs.h(be,chunk2XZCLDHJ_cjs.h(r,chunk2XZCLDHJ_cjs.h(r,r))),chunk2XZCLDHJ_cjs.h({n:27n,d:1n},chunk2XZCLDHJ_cjs.h(i,i))));return chunk2XZCLDHJ_cjs.k(u,chunk2XZCLDHJ_cjs.a)>0?{exact:[],approximate:yo(r,i,a)}:chunk2XZCLDHJ_cjs.l(u)?{exact:po(r,i,a),approximate:[]}:{exact:bo(r,i,a),approximate:[]}}function po(e,t,n){if(chunk2XZCLDHJ_cjs.l(e))return [chunk2XZCLDHJ_cjs.p(n)];let o=chunk2XZCLDHJ_cjs.f(chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.h(B,t),e),n),r=chunk2XZCLDHJ_cjs.f(chunk2XZCLDHJ_cjs.j(chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.h(B,t),chunk2XZCLDHJ_cjs.h(k,e))),n);return [o,r].sort(chunk2XZCLDHJ_cjs.k).map(chunk2XZCLDHJ_cjs.p)}function bo(e,t,n){let o=chunk2XZCLDHJ_cjs.j(chunk2XZCLDHJ_cjs.i(t,k)),r=chunk2XZCLDHJ_cjs.f(chunk2XZCLDHJ_cjs.h(chunk2XZCLDHJ_cjs.i(t,k),chunk2XZCLDHJ_cjs.i(t,k)),chunk2XZCLDHJ_cjs.h(chunk2XZCLDHJ_cjs.i(e,B),chunk2XZCLDHJ_cjs.h(chunk2XZCLDHJ_cjs.i(e,B),chunk2XZCLDHJ_cjs.i(e,B)))),i=chunk2XZCLDHJ_cjs.O(r),a={kind:"call",name:"cbrt",args:[{kind:"add",left:chunk2XZCLDHJ_cjs.p(o),right:i}]},u={kind:"call",name:"cbrt",args:[{kind:"sub",left:chunk2XZCLDHJ_cjs.p(o),right:i}]},l={kind:"add",left:a,right:u},s={kind:"sub",left:a,right:u},p={kind:"add",left:chunk2XZCLDHJ_cjs.p(n),right:{kind:"div",left:{kind:"neg",operand:l},right:chunk2XZCLDHJ_cjs.p(k)}},h={kind:"mul",left:{kind:"div",left:{kind:"mul",left:s,right:chunk2XZCLDHJ_cjs.O(B)},right:chunk2XZCLDHJ_cjs.p(k)},right:chunk2XZCLDHJ_cjs.w(chunk2XZCLDHJ_cjs.n)};return [{kind:"add",left:chunk2XZCLDHJ_cjs.p(n),right:l},{kind:"sub",left:p,right:h},{kind:"add",left:p,right:h}]}function yo(e,t,n){let o=chunk2XZCLDHJ_cjs.e(e),r=chunk2XZCLDHJ_cjs.e(t),i=chunk2XZCLDHJ_cjs.e(n),a=2*Math.sqrt(-o/3),u=3*r/(2*o)*Math.sqrt(-3/o),l=Math.acos(Math.min(1,Math.max(-1,u)))/3;return [0,1,2].map(s=>a*Math.cos(l-2*Math.PI*s/3)+i).sort((s,p)=>s-p)}function ho(e,t,n,o){let r=chunk2XZCLDHJ_cjs.j(chunk2XZCLDHJ_cjs.i(e,be)),i=chunk2XZCLDHJ_cjs.h(e,e),a=chunk2XZCLDHJ_cjs.g(t,chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.h(B,i),{n:8n,d:1n})),u=chunk2XZCLDHJ_cjs.f(chunk2XZCLDHJ_cjs.g(n,chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.h(e,t),k)),chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.h(i,e),{n:8n,d:1n})),l=chunk2XZCLDHJ_cjs.g(chunk2XZCLDHJ_cjs.f(chunk2XZCLDHJ_cjs.g(o,chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.h(e,n),be)),chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.h(i,t),{n:16n,d:1n})),chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.h(B,chunk2XZCLDHJ_cjs.h(i,i)),{n:256n,d:1n}));return {p:a,q:u,r:l,shift:r}}function tn(e,t,n,o,r,i){let a=V=>chunk2XZCLDHJ_cjs.i(V,e),{p:u,q:l,r:s,shift:p}=ho(a(t),a(n),a(o),a(r)),h=chunk2XZCLDHJ_cjs.l(l)?go(u,s):Io(u,l,s,i);if(h===null)return null;let x=chunk2XZCLDHJ_cjs.l(p)?h:h.map(V=>({kind:"add",left:chunk2XZCLDHJ_cjs.p(p),right:V}));return {exact:No(x),approximate:[]}}function No(e){let t=new Set,n=[];for(let o of e){let r=chunk2XZCLDHJ_cjs.t(chunk2XZCLDHJ_cjs.Q(o));t.has(r)||(t.add(r),n.push(o));}return n}function go(e,t){let n=chunk2XZCLDHJ_cjs.g(chunk2XZCLDHJ_cjs.h(e,e),chunk2XZCLDHJ_cjs.h(be,t));if(chunk2XZCLDHJ_cjs.k(n,chunk2XZCLDHJ_cjs.a)<0)return vo(e,t);let o=chunk2XZCLDHJ_cjs.N(n);return o!==null?Ro(chunk2XZCLDHJ_cjs.j(e),o,chunk2XZCLDHJ_cjs.l(n)):xo(e,t,n)}function Ro(e,t,n){let o=n?[chunk2XZCLDHJ_cjs.i(e,k)]:[chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.f(e,t),k),chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.g(e,t),k)],r=[];for(let i of o){if(chunk2XZCLDHJ_cjs.l(i)){r.push(chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.a));continue}let a=chunk2XZCLDHJ_cjs.P(i);r.push({kind:"neg",operand:a},a);}return r}function xo(e,t,n){let o=chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.j(e)),r=chunk2XZCLDHJ_cjs.O(n),i=chunk2XZCLDHJ_cjs.k(e,chunk2XZCLDHJ_cjs.a)<=0,a=[{node:ze({kind:"add",left:o,right:r}),positive:i||chunk2XZCLDHJ_cjs.k(t,chunk2XZCLDHJ_cjs.a)<=0},{node:ze({kind:"sub",left:o,right:r}),positive:i&&chunk2XZCLDHJ_cjs.k(t,chunk2XZCLDHJ_cjs.a)>=0}],u=[];for(let{node:l,positive:s}of a){let h={kind:"call",name:"sqrt",args:[s?l:{kind:"neg",operand:l}]},x=s?h:{kind:"mul",left:h,right:chunk2XZCLDHJ_cjs.w(chunk2XZCLDHJ_cjs.n)};u.push({kind:"neg",operand:x},x);}return u}function ze(e){return {kind:"div",left:e,right:chunk2XZCLDHJ_cjs.p(k)}}function vo(e,t){let n=chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.j(e),k),o=chunk2XZCLDHJ_cjs.N(t),r=o===null?Jt(chunk2XZCLDHJ_cjs.O(t),n):chunk2XZCLDHJ_cjs.O(chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.f(o,n),k)),a={kind:"mul",left:o===null?Jt(chunk2XZCLDHJ_cjs.O(t),chunk2XZCLDHJ_cjs.j(n)):chunk2XZCLDHJ_cjs.O(chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.g(o,n),k)),right:chunk2XZCLDHJ_cjs.w(chunk2XZCLDHJ_cjs.n)},u={kind:"add",left:r,right:a},l={kind:"sub",left:r,right:a};return [{kind:"neg",operand:u},{kind:"neg",operand:l},l,u]}function Jt(e,t){let n=t.n>=0n?{kind:"add",left:e,right:chunk2XZCLDHJ_cjs.p(t)}:{kind:"sub",left:e,right:chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.j(t))};return {kind:"call",name:"sqrt",args:[ze(n)]}}function Io(e,t,n,o){let r=[{n:1n,d:1n},chunk2XZCLDHJ_cjs.h(k,e),chunk2XZCLDHJ_cjs.g(chunk2XZCLDHJ_cjs.h(e,e),chunk2XZCLDHJ_cjs.h(be,n)),chunk2XZCLDHJ_cjs.j(chunk2XZCLDHJ_cjs.h(t,t))];for(let i of ue(r)){if(chunk2XZCLDHJ_cjs.k(i,chunk2XZCLDHJ_cjs.a)<=0)continue;let a=chunk2XZCLDHJ_cjs.N(i);if(a===null)continue;let u=chunk2XZCLDHJ_cjs.f(e,i),l=chunk2XZCLDHJ_cjs.i(t,a),s=chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.g(u,l),k),p=chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.f(u,l),k),h={n:1n,d:1n};return [...o(h,a,s),...o(h,chunk2XZCLDHJ_cjs.j(a),p)]}return null}var Mo=200,So=1e-14,Eo=1e-10,Ao=1e-10,nn=1e-9,ko=1e-8,Vo=4;function ye(e,t){return {re:e.re-t.re,im:e.im-t.im}}function To(e,t){return {re:e.re*t.re-e.im*t.im,im:e.re*t.im+e.im*t.re}}function rn(e,t){if(Math.abs(t.re)>=Math.abs(t.im)){let r=t.im/t.re,i=t.re+t.im*r;return {re:(e.re+e.im*r)/i,im:(e.im-e.re*r)/i}}let n=t.re/t.im,o=t.re*n+t.im;return {re:(e.re*n+e.im)/o,im:(e.im*n-e.re)/o}}function K(e){return Math.hypot(e.re,e.im)}function De(e,t){let n=0,o=0;for(let r of e){let i=n*t.re-o*t.im+r;o=n*t.im+o*t.re,n=i;}return {re:n,im:o}}function Oo(e,t){let n=K(t),o=0;for(let r of e)o=o*n+Math.abs(r);return o}function _o(e){let t=e.length-1,n=[];for(let o=0;o<t;o++)n.push(e[o]*(t-o));return n}function wo(e){let t=[...e].reverse(),o=[...chunk2XZCLDHJ_cjs.K(t)].reverse().map(chunk2XZCLDHJ_cjs.e);return o.some(r=>!Number.isFinite(r))?null:o}function Do(e){let t=e.length-1,n=0;for(let a=1;a<e.length;a++)n=Math.max(n,Math.abs(e[a]));let o=1+n,r=-e[1]/t,i=[];for(let a=0;a<t;a++){let u=2*Math.PI*a/t+Math.PI/(2*t);i.push({re:r+o*Math.cos(u),im:o*Math.sin(u)});}return i}function Co(e){let t=e.length-1,n=Do(e);for(let o=0;o<Mo;o++){let r=0,i=1;for(let a=0;a<t;a++){let u={re:1,im:0};for(let s=0;s<t;s++)a!==s&&(u=To(u,ye(n[a],n[s])));if(u.re===0&&u.im===0){n[a]={re:n[a].re+1e-6*(a+1),im:n[a].im+1e-6};continue}let l=rn(De(e,n[a]),u);if(!Number.isFinite(l.re)||!Number.isFinite(l.im))return null;n[a]=ye(n[a],l),r=Math.max(r,K(l)),i=Math.max(i,K(n[a]));}if(r<=So*i)return n}return null}function on(e,t,n){let o=n;for(let r=0;r<Vo;r++){let i=De(t,o);if(i.re===0&&i.im===0)break;let a=ye(o,rn(De(e,o),i));if(!Number.isFinite(a.re)||!Number.isFinite(a.im))break;o=a;}return o}function Po(e,t,n){let o=Math.max(1,K(n));if(n.im!==0&&Math.abs(n.im)<=nn*o){let r=on(e,t,{re:n.re,im:0});if(Je(e,r))return {re:r.re,im:0}}if(n.re!==0&&Math.abs(n.re)<=nn*o){let r=on(e,t,{re:0,im:n.im});if(Je(e,r))return {re:0,im:r.im}}return n}function Je(e,t){return !Number.isFinite(t.re)||!Number.isFinite(t.im)?false:K(De(e,t))<=Eo*Oo(e,t)}function Lo(e){let t=[...e],n=t.map(o=>o.im===0);for(let o=0;o<t.length;o++){if(n[o])continue;let r={re:t[o].re,im:-t[o].im},i=-1,a=Number.POSITIVE_INFINITY;for(let p=o+1;p<t.length;p++){if(n[p])continue;let h=K(ye(t[p],r));h<a&&(a=h,i=p);}if(i===-1||a>ko*Math.max(1,K(t[o])))continue;let u=(t[o].re+t[i].re)/2,l=(Math.abs(t[o].im)+Math.abs(t[i].im))/2,s=t[o].im<0?-1:1;t[o]={re:u,im:s*l},t[i]={re:u,im:-s*l},n[o]=true,n[i]=true;}return t}function Fo(e){for(let t=0;t<e.length;t++)for(let n=t+1;n<e.length;n++){let o=Math.max(1,K(e[t]),K(e[n]));if(K(ye(e[t],e[n]))<=Ao*o)return  false}return  true}function an(e){let t=wo(e);if(t===null)return null;if(t.length<2)return [];let n=Co(t);if(n===null)return null;let o=_o(t),r=Lo(n).map(i=>Po(t,o,i));for(let i of r)if(!Je(t,i))return null;return Fo(r)?[...r].sort((i,a)=>i.re-a.re||i.im-a.im):null}var un=8;function Uo(e,t){let n=chunk2XZCLDHJ_cjs.a;for(let o of e)n=chunk2XZCLDHJ_cjs.f(chunk2XZCLDHJ_cjs.h(n,t),o);return n}function $o(e,t){let n=[e[0]];for(let o=1;o<e.length-1;o++)n.push(chunk2XZCLDHJ_cjs.f(e[o],chunk2XZCLDHJ_cjs.h(n[o-1],t)));return n}function ln(e,t,n){let o=chunk2XZCLDHJ_cjs.g(chunk2XZCLDHJ_cjs.h(t,t),chunk2XZCLDHJ_cjs.h(Yo(),chunk2XZCLDHJ_cjs.h(e,n))),r=chunk2XZCLDHJ_cjs.h(qo(),e);if(chunk2XZCLDHJ_cjs.k(o,chunk2XZCLDHJ_cjs.a)<0)return Bo(chunk2XZCLDHJ_cjs.j(t),o,r);if(chunk2XZCLDHJ_cjs.l(o))return [chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.j(t),r))];let i=chunk2XZCLDHJ_cjs.L(o.n),a=chunk2XZCLDHJ_cjs.L(o.d);if(i!==null&&a!==null){let h={n:i,d:a},x=chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.f(chunk2XZCLDHJ_cjs.j(t),h),r),V=chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.g(chunk2XZCLDHJ_cjs.j(t),h),r);return chunk2XZCLDHJ_cjs.k(V,x)<=0?[chunk2XZCLDHJ_cjs.p(V),chunk2XZCLDHJ_cjs.p(x)]:[chunk2XZCLDHJ_cjs.p(x),chunk2XZCLDHJ_cjs.p(V)]}let u=chunk2XZCLDHJ_cjs.O(o),l=chunk2XZCLDHJ_cjs.k(r,chunk2XZCLDHJ_cjs.a)>0,s={kind:"div",left:{kind:"sub",left:chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.j(t)),right:u},right:chunk2XZCLDHJ_cjs.p(r)},p={kind:"div",left:{kind:"add",left:chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.j(t)),right:u},right:chunk2XZCLDHJ_cjs.p(r)};return l?[s,p]:[p,s]}function Bo(e,t,n){let o=chunk2XZCLDHJ_cjs.j(t),r=chunk2XZCLDHJ_cjs.L(o.n),i=chunk2XZCLDHJ_cjs.L(o.d);if(r!==null&&i!==null){let s=chunk2XZCLDHJ_cjs.i({n:r,d:i},n),p=chunk2XZCLDHJ_cjs.i(e,n);return [chunk2XZCLDHJ_cjs.w(chunk2XZCLDHJ_cjs.o(p,chunk2XZCLDHJ_cjs.j(s))),chunk2XZCLDHJ_cjs.w(chunk2XZCLDHJ_cjs.o(p,s))]}let a=chunk2XZCLDHJ_cjs.i(e,n),u=chunk2XZCLDHJ_cjs.i(o,chunk2XZCLDHJ_cjs.h(n,n)),l={kind:"mul",left:chunk2XZCLDHJ_cjs.O(u),right:chunk2XZCLDHJ_cjs.w(chunk2XZCLDHJ_cjs.n)};return chunk2XZCLDHJ_cjs.l(a)?[{kind:"neg",operand:l},l]:[{kind:"sub",left:chunk2XZCLDHJ_cjs.p(a),right:l},{kind:"add",left:chunk2XZCLDHJ_cjs.p(a),right:l}]}function qo(){return {n:2n,d:1n}}function Yo(){return {n:4n,d:1n}}function Go(e){return {re:e,im:0}}function sn(e,t,n){let o=chunk2XZCLDHJ_cjs.C({kind:"sub",left:e,right:t});if(o===null)return {kind:"unsupported",reason:"this is not a polynomial equation (it divides by an unknown, or calls a function of one)"};let r=o.vars.filter(u=>u!==n),i=chunk2XZCLDHJ_cjs.z(o,n);if(r.length>0)return i!==1?{kind:"unsupported",reason:`solving for "${n}" needs the equation to be linear in it when other unknowns (${r.join(", ")}) are present`}:jo(o,n);if(i===0)return o.terms.size===0?{kind:"identity"}:{kind:"contradiction"};if(i>un)return {kind:"unsupported",reason:`degree ${i} is above the supported maximum of ${un}`};let a=[...chunk2XZCLDHJ_cjs.B(o,n)].reverse();return Zo(a)}function jo(e,t){let n=new Map,o=new Map;for(let[u,l]of e.terms){let s=u.split("*").filter(h=>h.length>0),p=s.indexOf(t);p===-1?o.set(u,l):(s.splice(p,1),n.set(s.join("*"),l));}let r=u=>{let l=new Set;for(let s of u.keys())for(let p of s.split("*"))p.length>0&&l.add(p.split("^")[0]);return [...l].sort()},i=chunk2XZCLDHJ_cjs.E({terms:n,vars:r(n)});return {kind:"roots",exact:[{kind:"div",left:{kind:"neg",operand:chunk2XZCLDHJ_cjs.E({terms:o,vars:r(o)})},right:i}],approximate:[]}}function Ko(e){return e.length===4?en(e[0],e[1],e[2],e[3]):e.length===5?tn(e[0],e[1],e[2],e[3],e[4],ln):null}function Xo(e){let t=[],n=[...e],o=0;for(;n.length>1&&chunk2XZCLDHJ_cjs.l(n[n.length-1]);)n=n.slice(0,-1),o++;for(o>0&&t.push(chunk2XZCLDHJ_cjs.a);n.length>1;){let r=ue(n);if(r.length===0)break;for(let i of r){let a=0;for(;n.length>1&&chunk2XZCLDHJ_cjs.l(Uo(n,i));)n=$o(n,i),a++;a>0&&t.push(i);}}return {roots:t.sort(chunk2XZCLDHJ_cjs.k),remaining:n}}function Zo(e){let{roots:t,remaining:n}=Xo(e),o=t.map(chunk2XZCLDHJ_cjs.p),r=[],i=n.length-1,a=e.length-n.length;if(i<=0)return le(o,r,a,0,"");if(i===1)return o.push(chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.i(chunk2XZCLDHJ_cjs.j(n[1]),n[0]))),le(o,r,a+1,0,"");if(i===2)return o.push(...ln(n[0],n[1],n[2])),le(o,r,a+2,0,"");let u=Ko(n);if(u!==null)return o.push(...u.exact),r.push(...u.approximate.map(Go)),le(o,r,a+i,0,"");let l=an(n);return l!==null?(r.push(...l),le(o,r,a+i,0,"")):le(o,r,a,i,`a degree-${i} factor of it has no exact solution here and the numerical method did not converge on that factor`)}function le(e,t,n,o,r){let i=e.length+t.length,a=n>=1&&(i<1||i>n);return o>0||a?{kind:"incomplete",exact:e,approximate:t,missing:a?Math.max(1,n+o-i):o,reason:a?`${i} root${i===1?"":"s"} were produced for a degree-${n+o} equation, which does not add up`:r}:{kind:"roots",exact:e,approximate:t}}var cn={0:"sqrt",1:"abs",2:"sin",3:"cos",4:"tan",5:"log",6:"ceil",7:"floor",8:"round",11:"asin",12:"acos",13:"atan",14:"atan2",15:"sinh",16:"cosh",17:"tanh",18:"asinh",19:"acosh",20:"atanh",21:"cbrt",23:"expm1",24:"exp",26:"hypot",28:"log10",29:"log1p",30:"log2",33:"sign",34:"trunc",35:"degtorad",36:"radtodeg",61:"root",62:"fact"},Ho=31,hi=new Set([67,68,69,70,71,72,73,74,75,76,77,78,79]);function O(e){if(e.type===9)return e.value;if(e.type===13||e.type===12)return null;let t=e.toNumber();return Number.isFinite(t)?chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.d(t)):null}function _(e){let t=chunk2XZCLDHJ_cjs.Q(e);return t.kind==="const"?chunk6U66HQKQ_cjs.n(chunk2XZCLDHJ_cjs.e(t.value)):chunk6U66HQKQ_cjs.K(t)}function Ce(e){return chunk6U66HQKQ_cjs.P("SYMBOLIC_UNSUPPORTED_FUNCTION",`"${e}" cannot be applied to an expression that still contains an unknown.`)}function Ni(e,t){let n=O(e),o=O(t);return n===null||o===null?Ce("^"):_(chunk2XZCLDHJ_cjs.r(n,o))}function gi(e){let t=O(e);return t===null?Ce("-"):_({kind:"neg",operand:t})}function Ri(e,t){let n=[];for(let r of t){let i=chunk6U66HQKQ_cjs.Q(r);if(i)return i;let a=O(r);if(a===null)return Ce(cn[e]??`builtin ${e}`);n.push(a);}if(e===Ho&&n.length===2)return _(chunk2XZCLDHJ_cjs.r(n[0],n[1]));let o=cn[e];return o===void 0?Ce(`builtin ${e}`):_(chunk2XZCLDHJ_cjs.s(o,n))}function Wo(e){let t=_(e);return t.type===0&&!Number.isInteger(t.toNumber())?chunk6U66HQKQ_cjs.K(e):t}function Qo(e){return e.im===0?chunk6U66HQKQ_cjs.n(e.re):chunk6U66HQKQ_cjs.K(chunk2XZCLDHJ_cjs.w(chunk2XZCLDHJ_cjs.o(chunk2XZCLDHJ_cjs.d(e.re),chunk2XZCLDHJ_cjs.d(e.im))))}function zo(e){switch(e.kind){case "identity":return chunk6U66HQKQ_cjs.t("true for every value");case "contradiction":return chunk6U66HQKQ_cjs.t("no solution");case "unsupported":return chunk6U66HQKQ_cjs.P("SYMBOLIC_SOLVE_UNSUPPORTED",`Cannot solve this equation: ${e.reason}.`);case "incomplete":{let t=e.exact.length+e.approximate.length;return chunk6U66HQKQ_cjs.P("SYMBOLIC_SOLVE_INCOMPLETE",`Only ${t} of this equation's ${t+e.missing} roots could be found: ${e.reason}.`)}case "roots":{let t=e.exact.map(Wo);for(let n of e.approximate)t.push(Qo(n));return t.length===0?chunk6U66HQKQ_cjs.t("no solution"):t.length===1?t[0]:chunk6U66HQKQ_cjs.C(1,t.length,t.map(n=>n.type===9?n.value:n.toNumber()))}}}function fn(e,t,n){let o=O(e),r=O(t);return o===null||r===null?chunk6U66HQKQ_cjs.P("SYMBOLIC_NONFINITE_OPERAND","An equation side has no exact value to solve with."):zo(sn(o,r,n))}function he(e,t){if(e.type===6&&t.type===6){if(e.unit===t.unit)return {lv:e.toNumber(),rv:t.toNumber(),unit:e.unit,sameMeasure:true};let n=chunkBKSKZA4W_cjs.c(e.unit),o=chunkBKSKZA4W_cjs.c(t.unit),r=chunkGWCBPITD_cjs.c.isCurrency(e.unit)&&chunkGWCBPITD_cjs.c.isCurrency(t.unit);if(n&&n===o){let i=chunkBKSKZA4W_cjs.e(t.toNumber(),t.unit,e.unit);return {lv:e.toNumber(),rv:i,unit:e.unit,sameMeasure:true}}if(r){let i=chunkGWCBPITD_cjs.c.convertSync(t.toNumber(),t.unit,e.unit);if(i!==null)return {lv:e.toNumber(),rv:i,unit:e.unit,sameMeasure:true}}return {lv:e.toNumber(),rv:t.toNumber(),unit:void 0,sameMeasure:false}}return e.type===6?{lv:e.toNumber(),rv:t.toNumber(),unit:e.unit,sameMeasure:true}:t.type===6?{lv:e.toNumber(),rv:t.toNumber(),unit:t.unit,sameMeasure:true}:{lv:e.toNumber(),rv:t.toNumber(),unit:void 0,sameMeasure:true}}var Jo=1e-12;function er(e,t,n){let o=0;return Number.isFinite(e)&&Math.abs(e)>o&&(o=Math.abs(e)),Number.isFinite(t)&&Math.abs(t)>o&&(o=Math.abs(t)),Number.isFinite(n)&&Math.abs(n)>o&&(o=Math.abs(n)),o}function Oi(e,t){let{lv:n,rv:o,sameMeasure:r}=he(e,t);if(!r)return {lv:n,rv:o,equal:false,sameMeasure:false};if(e.type===6&&t.type===6&&e.unit!==void 0&&e.unit===t.unit&&e.exact!==void 0&&t.exact!==void 0&&chunkGWCBPITD_cjs.c.isCurrency(e.unit))return {lv:n,rv:o,equal:chunk2XZCLDHJ_cjs.qa(e.exact,t.exact)===0,sameMeasure:true};if(n===o)return {lv:n,rv:o,equal:true,sameMeasure:true};if(!Number.isFinite(n)||!Number.isFinite(o))return {lv:n,rv:o,equal:false,sameMeasure:true};let i=er(n,o,t.toNumber());return {lv:n,rv:o,equal:Math.abs(n-o)<=i*Jo,sameMeasure:true}}var tr={time:"duration",luminousIntensity:"luminous intensity"},nr=new Set(["money","data"]),or={add:"added",sub:"subtracted",mul:"multiplied",div:"divided"};function Pe(e){if(chunkGWCBPITD_cjs.c.isCurrency(e))return "money";let t=chunkBKSKZA4W_cjs.c(e);if(t!==void 0)return tr[t]??t}function dn(e){return nr.has(e)?e:/^[aeiou]/.test(e)?`an ${e}`:`a ${e}`}function Fe(e,t,n){let o=e===void 0?void 0:Pe(e),r=t===void 0?void 0:Pe(t);if(o!==void 0&&r!==void 0&&o!==r)return `${o} and ${r} cannot be ${n}`}function rr(e){return e!==void 0?or[e]??"combined":"combined"}function _i(e,t){let n=Pe(e),o=Pe(t);if(n!==void 0&&o!==void 0&&n!==o)return `${dn(n)} cannot be converted to ${dn(o)}`}function wi(e,t){let n=e.type===6?e.unit:void 0,o=t.type===6?t.unit:void 0,r=Fe(n,o,"compared");return chunk6U66HQKQ_cjs.P("INCOMPATIBLE_UNITS",r??`Cannot compare incompatible units: ${n??"?"} and ${o??"?"}`)}function pn(e){if(e.type===2)return e.value;let t=e.toNumber();if(!Number.isInteger(t)){let n=Number.isNaN(t)?"NaN":String(t);throw chunkNAZ6PGLS_cjs.c.execution("BIGINT_INEXACT_OPERAND",`A whole-number (n) value can only be combined with another whole number, and ${n} is not one`,{operand:n})}return BigInt(t)}function Di(){return chunkNAZ6PGLS_cjs.c.execution("BIGINT_DIVISION_BY_ZERO","Division by zero: a whole-number (n) division is exact integer division, which has no answer at zero, unlike 1 / 0 which is Infinity")}function Ci(e,t){let n=bn(e),o=bn(t);return n===null||o===null?null:n<o?-1:n>o?1:0}function bn(e){if(e.type===2)return e.value;let t=e.toNumber();return Number.isInteger(t)?BigInt(t):null}function et(e,t){return Number.isFinite(t)?Math.pow(e,t):e===1||e===-1&&!Number.isNaN(t)?1:Math.pow(e,t)}function yn(e){return e.exact!==void 0?e.exact:chunk2XZCLDHJ_cjs.ha(e.toNumber())}function ir(e,t,n){let o=e.type===6&&e.unit!==void 0&&e.exact!==void 0&&chunkGWCBPITD_cjs.c.isCurrency(e.unit),r=t.type===6&&t.unit!==void 0&&t.exact!==void 0&&chunkGWCBPITD_cjs.c.isCurrency(t.unit);if(!o&&!r)return null;let i,a,u;if(o&&r){if(e.unit!==t.unit||n==="div")return null;i=e.exact,a=t.exact,u=e.unit;}else if(o&&t.type!==6)i=e.exact,u=e.unit,a=yn(t);else if(r&&e.type!==6)a=t.exact,u=t.unit,i=yn(e);else return null;if(i===null||a===null)return null;let l;switch(n){case "add":l=chunk2XZCLDHJ_cjs.ja(i,a);break;case "sub":l=chunk2XZCLDHJ_cjs.ka(i,a);break;case "mul":l=chunk2XZCLDHJ_cjs.la(i,a);break;case "div":if(chunk2XZCLDHJ_cjs.na(a))return null;l=chunk2XZCLDHJ_cjs.pa(i,a);break}return chunk6U66HQKQ_cjs.v(chunk2XZCLDHJ_cjs.ra(l),u,l)}function Le(e){return e.rational!==void 0?e.rational:(e.type===0||e.type===1)&&typeof e.value=="number"&&Number.isInteger(e.value)?chunk2XZCLDHJ_cjs.c(BigInt(e.value)):null}function Pi(e,t,n){let o=Le(e);if(o===null)return null;let r=Le(t);if(r===null||n==="div"&&chunk2XZCLDHJ_cjs.l(r))return null;let i;try{switch(n){case "add":i=chunk2XZCLDHJ_cjs.f(o,r);break;case "sub":i=chunk2XZCLDHJ_cjs.g(o,r);break;case "mul":i=chunk2XZCLDHJ_cjs.h(o,r);break;case "div":i=chunk2XZCLDHJ_cjs.i(o,r);break}}catch{return null}return chunk6U66HQKQ_cjs.p(chunk2XZCLDHJ_cjs.e(i),i)}function Li(e,t,n){if(e.type!==0||t.type!==0)return null;let o=e.value,r=t.value,i=e.uncertainty??0,a=t.uncertainty??0,u,l;switch(n){case "add":u=o+r,l=Math.hypot(i,a);break;case "sub":u=o-r,l=Math.hypot(i,a);break;case "mul":u=o*r,l=Math.hypot(r*i,o*a);break;case "div":u=o/r,l=Math.hypot(i/r,o*a/(r*r));break}return chunk6U66HQKQ_cjs.q(u,l)}function Fi(e,t){let n=Le(e);if(n===null)return null;let o=Le(t);return o===null?null:chunk2XZCLDHJ_cjs.k(n,o)}function Ui(e,t,n,o,r){if(e.type===13)return e;if(t.type===13)return t;if(e.type===12)return e;if(t.type===12)return t;if(r&&(e.type===9||t.type===9)){let i=O(e),a=O(t);return i===null||a===null?chunk6U66HQKQ_cjs.P("SYMBOLIC_NONFINITE_OPERAND","A symbolic expression cannot combine with a value that has no exact number (NaN or infinity)."):chunk6U66HQKQ_cjs.K(chunk2XZCLDHJ_cjs.Q({kind:r,left:i,right:a}))}if(e.type===0&&t.type===0)return chunk6U66HQKQ_cjs.n(n(e.value,t.value));if(e.type===2||t.type===2){let i=pn(e),a=pn(t);return o?chunk6U66HQKQ_cjs.s(o(i,a)):chunk6U66HQKQ_cjs.s(i+a)}if(e.type===6||t.type===6){if(r){let s=ir(e,t,r);if(s)return s}let{lv:i,rv:a,unit:u,sameMeasure:l}=he(e,t);if(!l){let s=e.type===6?e.unit:void 0,p=t.type===6?t.unit:void 0,h=Fe(s,p,rr(r));return chunk6U66HQKQ_cjs.P("INCOMPATIBLE_UNITS",h??`Cannot combine incompatible units: ${s??"?"} and ${p??"?"}`)}return chunk6U66HQKQ_cjs.u(n(i,a),u)}if(e.type===7&&t.type===7){let i=e.value,a=t.value;if(!chunk2XZCLDHJ_cjs.V(i,a))return chunk6U66HQKQ_cjs.P("DIMENSION_MISMATCH",`Cannot combine matrices of different shapes: ${i.rows}x${i.cols} and ${a.rows}x${a.cols}`);let u=new Array(i.data.length);for(let l=0;l<i.data.length;l++)u[l]=n(i.data[l],a.data[l]);return chunk6U66HQKQ_cjs.C(i.rows,i.cols,u)}if(e.type===7){let i=e.value,a=t.toNumber(),u=i.data.map(l=>n(l,a));return chunk6U66HQKQ_cjs.C(i.rows,i.cols,u)}if(t.type===7){let i=t.value,a=e.toNumber(),u=i.data.map(l=>n(a,l));return chunk6U66HQKQ_cjs.C(i.rows,i.cols,u)}return chunk6U66HQKQ_cjs.n(n(e.toNumber(),t.toNumber()))}var hn=254,Nn=200,Ne=class{constructor(){this.handlers=new Map;this.nextOpcode=Nn+1;}register(t){this.handlers.set(t.opcode,t.handler);}unregister(t){this.handlers.delete(t);}get(t){return this.handlers.get(t)}has(t){return this.handlers.has(t)}allocateOpcode(){if(this.nextOpcode>hn)throw chunkNAZ6PGLS_cjs.c.config("OPCODE_POOL_EXHAUSTED",`OpRegistry: dynamic opcode pool exhausted (max ${hn-Nn} allocations).`);return this.nextOpcode++}},qi=new Ne;var Rn=chunk2XZCLDHJ_cjs.ga(1);function ge(e,t){return chunkGWCBPITD_cjs.c.isCurrency(t)?e.exact??chunk2XZCLDHJ_cjs.ha(e.toNumber()):null}function tt(e){if(!Number.isFinite(e))return null;if(Number.isInteger(e))return chunk2XZCLDHJ_cjs.ga(BigInt(e));let t=String(e);return /^-?\d+\.\d+$/.test(t)?chunk2XZCLDHJ_cjs.ia(t):null}function xn(e,t,n){let o=ge(e,n),r=tt(t);if(o!==null&&r!==null){let i=chunk2XZCLDHJ_cjs.la(o,r);return chunk6U66HQKQ_cjs.v(chunk2XZCLDHJ_cjs.ra(i),n,i)}return chunk6U66HQKQ_cjs.u(e.toNumber()*t,n)}function vn(e,t,n,o){let r=ge(e,t),i=tt(n);if(r!==null&&i!==null){let a=chunk2XZCLDHJ_cjs.ja(Rn,o===1?i:chunk2XZCLDHJ_cjs.ma(i)),u=chunk2XZCLDHJ_cjs.la(r,a);return chunk6U66HQKQ_cjs.v(chunk2XZCLDHJ_cjs.ra(u),t,u)}return chunk6U66HQKQ_cjs.u(e.toNumber()*(1+o*n),t)}function In(e){let t=tt(e);return t===null?null:chunk2XZCLDHJ_cjs.ja(Rn,t)}function Mn(e,t,n){let o=ge(e,t),r=In(n);if(o===null||r===null||chunk2XZCLDHJ_cjs.na(r))return null;let i=chunk2XZCLDHJ_cjs.pa(o,r);return chunk6U66HQKQ_cjs.v(chunk2XZCLDHJ_cjs.ra(i),t,i)}function Sn(e,t,n){let o=ge(e,t),r=In(n);if(o===null||r===null||chunk2XZCLDHJ_cjs.na(r))return null;let i=chunk2XZCLDHJ_cjs.ka(o,chunk2XZCLDHJ_cjs.pa(o,r));return chunk6U66HQKQ_cjs.v(chunk2XZCLDHJ_cjs.ra(i),t,i)}function En(e,t){let n=e.unit,o=n!==void 0&&chunkGWCBPITD_cjs.c.isCurrency(n)?ar(e,n):null;if(o===null)return {unit:n,shares:[{value:e.toNumber()/t,count:t}]};let r=BigInt(t),i=o/r,a=o-i*r,u=Number(a<0n?-a:a),l=o<0n?-1n:1n,s=gn(i,t-u);return u===0?{unit:n,shares:[s]}:{unit:n,shares:[s,gn(i+l,u)]}}function gn(e,t){let n=chunk2XZCLDHJ_cjs.fa(e,2);return {value:chunk2XZCLDHJ_cjs.ra(n),exact:n,count:t}}function ar(e,t){let n=ge(e,t);return n===null?null:chunk2XZCLDHJ_cjs.oa(n,2).coef}var ur=12;function An(e,t){if(e.length===0||t.length===0)return [];let n=new Array(e.length+t.length-1).fill(chunk2XZCLDHJ_cjs.a);return e.forEach((o,r)=>{t.forEach((i,a)=>{n[r+a]=chunk2XZCLDHJ_cjs.f(n[r+a],chunk2XZCLDHJ_cjs.h(o,i));});}),n}function lr(e,t){let n=[chunk2XZCLDHJ_cjs.b];for(let o=0;o<t;o++)n=An(n,e);return n}function nt(e,t){return e.map(n=>chunk2XZCLDHJ_cjs.i(n,t))}function sr(e,t){let n=[],o=0;for(;o<e.length&&chunk2XZCLDHJ_cjs.l(e[o]);)o++;o>0&&n.push({base:[chunk2XZCLDHJ_cjs.a,chunk2XZCLDHJ_cjs.b],power:o});let r=e.slice(o);if(r.length>1){let i=Qe([...r].reverse(),t);for(let a of i.factors){let u=chunk2XZCLDHJ_cjs.C(a.base);if(u===null)return null;n.push({base:[...chunk2XZCLDHJ_cjs.B(u,t)],power:a.power});}}return n.length>0?n:null}function cr(e){let t=[];return e.forEach((n,o)=>{let r=n.base.length-1;for(let i=1;i<=n.power;i++)for(let a=0;a<r;a++)t.push({factor:o,power:i,degree:a});}),t}function mr(e,t,n){let o=lr(t[e.factor].base,e.power),{quotient:r,remainder:i}=chunk2XZCLDHJ_cjs.H(n,o);if(!chunk2XZCLDHJ_cjs.G(i))return null;let a=new Array(e.degree).fill(chunk2XZCLDHJ_cjs.a);return a.push(chunk2XZCLDHJ_cjs.b),An(r,a)}function fr(e,t){let n=t.length;for(let o=0;o<n;o++){let r=-1;for(let i=o;i<n;i++)if(!chunk2XZCLDHJ_cjs.l(e[i][o])){r=i;break}if(r===-1)return null;[e[o],e[r]]=[e[r],e[o]],[t[o],t[r]]=[t[r],t[o]];for(let i=0;i<n;i++){if(i===o||chunk2XZCLDHJ_cjs.l(e[i][o]))continue;let a=chunk2XZCLDHJ_cjs.i(e[i][o],e[o][o]);for(let u=o;u<n;u++)e[i][u]=chunk2XZCLDHJ_cjs.g(e[i][u],chunk2XZCLDHJ_cjs.h(a,e[o][u]));t[i]=chunk2XZCLDHJ_cjs.g(t[i],chunk2XZCLDHJ_cjs.h(a,t[o]));}}return t.map((o,r)=>chunk2XZCLDHJ_cjs.i(o,e[r][r]))}function ot(e,t,n){if(t.length<2||t.length-1>ur)return null;let o=chunk2XZCLDHJ_cjs.I(e,t),r=o.length>1?chunk2XZCLDHJ_cjs.H(e,o).quotient:[...e],i=o.length>1?chunk2XZCLDHJ_cjs.H(t,o).quotient:[...t];if(i.length===1)return {polynomial:nt(r,i[0]),terms:[]};if(i.length===0)return null;let a=i[i.length-1],u=nt(i,a),l=nt(r,a),{quotient:s,remainder:p}=chunk2XZCLDHJ_cjs.H(l,u);if(chunk2XZCLDHJ_cjs.G(p))return {polynomial:s,terms:[]};let h=sr(u,n);if(h===null)return null;let x=dr(h,u,p);return x===null?null:{polynomial:s,terms:x}}function dr(e,t,n){let o=cr(e),r=t.length-1;if(o.length!==r)return null;let i=[];for(let s of o){let p=mr(s,e,t);if(p===null)return null;i.push(p);}let a=[];for(let s=0;s<r;s++)a.push(i.map(p=>p[s]??chunk2XZCLDHJ_cjs.a));let u=[];for(let s=0;s<r;s++)u.push(n[s]??chunk2XZCLDHJ_cjs.a);let l=fr(a,u);return l===null?null:pr(o,l,e)}function pr(e,t,n){let o=new Map;e.forEach((i,a)=>{let u=`${i.factor}:${i.power}`,l=o.get(u)??[];l[i.degree]=t[a],o.set(u,l);});let r=[];for(let[i,a]of o){let[u,l]=i.split(":").map(Number),s=[...a].map(p=>p??chunk2XZCLDHJ_cjs.a);s.every(chunk2XZCLDHJ_cjs.l)||r.push({numerator:s,base:n[u].base,power:l});}return r}function Re(e,t){let n=new Map;return e.forEach((o,r)=>{chunk2XZCLDHJ_cjs.l(o)||n.set(r===0?"":r===1?t:`${t}^${r}`,o);}),n.size===0?chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.a):chunk2XZCLDHJ_cjs.E({terms:n,vars:e.length>1?[t]:[]})}function kn(e){let t=rt(e);if(t===null)return e;let n=ot(t.numerator,t.denominator,t.variable);if(n===null||n.terms.length===0)return e;let o=n.polynomial.length>0?Re(n.polynomial,t.variable):null;for(let r of n.terms){let i=Re(r.base,t.variable),a=r.power===1?i:chunk2XZCLDHJ_cjs.r(i,chunk2XZCLDHJ_cjs.p({n:BigInt(r.power),d:1n})),u=br(r.numerator),l=u?r.numerator.map(p=>chunk2XZCLDHJ_cjs.j(p)):r.numerator,s={kind:"div",left:Re(l,t.variable),right:a};o===null?o=u?{kind:"neg",operand:s}:s:o={kind:u?"sub":"add",left:o,right:s};}return o===null?e:chunk2XZCLDHJ_cjs.Q(o)}function br(e){return e.some(t=>t.n<0n)&&e.every(t=>t.n<=0n)}function rt(e){if(e.kind!=="div")return null;let t=chunk2XZCLDHJ_cjs.C(e.left),n=chunk2XZCLDHJ_cjs.C(e.right);if(t===null||n===null)return null;let o=chunk2XZCLDHJ_cjs.A(n);return o===null||t.vars.some(r=>r!==o)?null:{numerator:chunk2XZCLDHJ_cjs.B(t,o),denominator:chunk2XZCLDHJ_cjs.B(n,o),variable:o}}var it=16;function Vn(){return chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.a)}function X(){return chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.b)}function yr(e,t){switch(e){case "sin":return chunk2XZCLDHJ_cjs.s("cos",[t]);case "cos":return {kind:"neg",operand:chunk2XZCLDHJ_cjs.s("sin",[t])};case "tan":return {kind:"div",left:X(),right:chunk2XZCLDHJ_cjs.r(chunk2XZCLDHJ_cjs.s("cos",[t]),chunk2XZCLDHJ_cjs.p(2))};case "exp":return chunk2XZCLDHJ_cjs.s("exp",[t]);case "log":return {kind:"div",left:X(),right:t};case "sqrt":return {kind:"div",left:X(),right:{kind:"mul",left:chunk2XZCLDHJ_cjs.p(2),right:chunk2XZCLDHJ_cjs.s("sqrt",[t])}};case "asin":return {kind:"div",left:X(),right:chunk2XZCLDHJ_cjs.s("sqrt",[Tn(t)])};case "acos":return {kind:"neg",operand:{kind:"div",left:X(),right:chunk2XZCLDHJ_cjs.s("sqrt",[Tn(t)])}};case "atan":return {kind:"div",left:X(),right:hr(t)};case "sinh":return chunk2XZCLDHJ_cjs.s("cosh",[t]);case "cosh":return chunk2XZCLDHJ_cjs.s("sinh",[t]);case "tanh":return {kind:"div",left:X(),right:chunk2XZCLDHJ_cjs.r(chunk2XZCLDHJ_cjs.s("cosh",[t]),chunk2XZCLDHJ_cjs.p(2))};case "abs":return chunk2XZCLDHJ_cjs.s("sign",[t]);default:return null}}function Tn(e){return {kind:"sub",left:X(),right:chunk2XZCLDHJ_cjs.r(e,chunk2XZCLDHJ_cjs.p(2))}}function hr(e){return {kind:"add",left:X(),right:chunk2XZCLDHJ_cjs.r(e,chunk2XZCLDHJ_cjs.p(2))}}function xe(e,t,n=1){if(n<0||!Number.isInteger(n))throw chunkNAZ6PGLS_cjs.c.execution("SYMBOLIC_DERIVATIVE_ORDER_LIMIT","A derivative order must be a whole number, at least zero.");if(n>it)throw chunkNAZ6PGLS_cjs.c.execution("SYMBOLIC_DERIVATIVE_ORDER_LIMIT",`A derivative order above ${it} is not supported.`,{limit:it});let o=chunk2XZCLDHJ_cjs.Q(e);for(let r=0;r<n;r++)o=chunk2XZCLDHJ_cjs.Q(P(o,t));return o}function P(e,t){switch(e.kind){case "const":case "complex":return Vn();case "var":return e.name===t?X():Vn();case "add":return {kind:"add",left:P(e.left,t),right:P(e.right,t)};case "sub":return {kind:"sub",left:P(e.left,t),right:P(e.right,t)};case "neg":return {kind:"neg",operand:P(e.operand,t)};case "mul":return {kind:"add",left:{kind:"mul",left:P(e.left,t),right:e.right},right:{kind:"mul",left:e.left,right:P(e.right,t)}};case "div":return {kind:"div",left:{kind:"sub",left:{kind:"mul",left:P(e.left,t),right:e.right},right:{kind:"mul",left:e.left,right:P(e.right,t)}},right:chunk2XZCLDHJ_cjs.r(e.right,chunk2XZCLDHJ_cjs.p(2))};case "pow":return Nr(e,t);case "call":{if(e.args.length!==1)return at(e,t);let n=yr(e.name,e.args[0]);return n===null?at(e,t):{kind:"mul",left:n,right:P(e.args[0],t)}}}}function Nr(e,t){if(e.exponent.kind==="const"){let n=chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.g(e.exponent.value,chunk2XZCLDHJ_cjs.b));return {kind:"mul",left:{kind:"mul",left:e.exponent,right:chunk2XZCLDHJ_cjs.r(e.base,n)},right:P(e.base,t)}}return e.base.kind==="const"&&e.base.value.n>0n?{kind:"mul",left:{kind:"mul",left:e,right:chunk2XZCLDHJ_cjs.s("log",[e.base])},right:P(e.exponent,t)}:at(e,t)}function at(e,t){return chunk2XZCLDHJ_cjs.s("der",[e,chunk2XZCLDHJ_cjs.q(t)])}function On(e,t){let n=chunk2XZCLDHJ_cjs.C(e);if(n===null||n.vars.filter(u=>u!==t).length>0||chunk2XZCLDHJ_cjs.z(n,t)>1)return null;let r=chunk2XZCLDHJ_cjs.B(n,t),i=r[0]??{n:0n,d:1n},a=r[1]??{n:0n,d:1n};return chunk2XZCLDHJ_cjs.l(a)?null:{slope:a,intercept:i}}function gr(e,t){let n=chunk2XZCLDHJ_cjs.C(e);if(n===null)return null;let o=n.vars.filter(a=>a!==t);if(o.length>0)return {ok:false,reason:`it involves more than one unknown (${o.join(", ")})`};let r=chunk2XZCLDHJ_cjs.B(n,t),i=chunk2XZCLDHJ_cjs.p(0);return r.forEach((a,u)=>{if(chunk2XZCLDHJ_cjs.l(a))return;let l=u+1,s=chunk2XZCLDHJ_cjs.i(a,{n:BigInt(l),d:1n}),p={kind:"mul",left:chunk2XZCLDHJ_cjs.p(s),right:l===1?chunk2XZCLDHJ_cjs.q(t):chunk2XZCLDHJ_cjs.r(chunk2XZCLDHJ_cjs.q(t),chunk2XZCLDHJ_cjs.p(l))};i={kind:"add",left:i,right:p};}),{ok:true,value:chunk2XZCLDHJ_cjs.Q(i)}}function Rr(e,t){if(e.kind!=="call"||e.args.length!==1)return null;let n=On(e.args[0],t);if(n===null)return null;let o=e.args[0],r=i=>chunk2XZCLDHJ_cjs.Q({kind:"div",left:i,right:chunk2XZCLDHJ_cjs.p(n.slope)});switch(e.name){case "exp":return {ok:true,value:r(chunk2XZCLDHJ_cjs.s("exp",[o]))};case "sin":return {ok:true,value:r({kind:"neg",operand:chunk2XZCLDHJ_cjs.s("cos",[o])})};case "cos":return {ok:true,value:r(chunk2XZCLDHJ_cjs.s("sin",[o]))};case "log":return {ok:true,value:r({kind:"sub",left:{kind:"mul",left:o,right:chunk2XZCLDHJ_cjs.s("log",[o])},right:o})};default:return null}}function xr(e,t){if(e.kind!=="div"||e.left.kind!=="const"||!ut(e.left.value))return null;let n=On(e.right,t);if(n!==null)return {ok:true,value:chunk2XZCLDHJ_cjs.Q({kind:"div",left:chunk2XZCLDHJ_cjs.s("log",[e.right]),right:chunk2XZCLDHJ_cjs.p(n.slope)})};let o=chunk2XZCLDHJ_cjs.C(e.right);if(o!==null&&o.vars.length===1&&o.vars[0]===t){let r=chunk2XZCLDHJ_cjs.B(o,t);if(r.length===3&&ut(r[0])&&chunk2XZCLDHJ_cjs.l(r[1])&&ut(r[2]))return {ok:true,value:chunk2XZCLDHJ_cjs.s("atan",[chunk2XZCLDHJ_cjs.q(t)])}}return null}function ut(e){return e.n===1n&&e.d===1n}function vr(e,t){let n=rt(e);if(n===null||n.variable!==t)return null;let o=ot(n.numerator,n.denominator,t);if(o===null)return null;let r=o.polynomial.length>0?Sr(o.polynomial,t):chunk2XZCLDHJ_cjs.p(0);for(let i of o.terms){let a=Ir(i,t);if(a===null)return {ok:false,reason:"its denominator has a repeated irreducible quadratic factor, which needs a reduction formula this does not have"};r={kind:"add",left:r,right:a};}return {ok:true,value:chunk2XZCLDHJ_cjs.Q(r)}}function Ir(e,t){let n=e.base.length-1,o=Re(e.base,t);if(n===1){let r=e.numerator[0]??chunk2XZCLDHJ_cjs.a;if(e.power===1)return {kind:"mul",left:chunk2XZCLDHJ_cjs.p(r),right:chunk2XZCLDHJ_cjs.s("log",[o])};let i=e.power-1,a=chunk2XZCLDHJ_cjs.i(r,{n:BigInt(-i),d:1n});return {kind:"div",left:chunk2XZCLDHJ_cjs.p(a),right:chunk2XZCLDHJ_cjs.r(o,chunk2XZCLDHJ_cjs.p({n:BigInt(i),d:1n}))}}return n!==2||e.power!==1?null:Mr(e,t,o)}function Mr(e,t,n){let o=e.numerator[0]??chunk2XZCLDHJ_cjs.a,r=e.numerator[1]??chunk2XZCLDHJ_cjs.a,[i,a]=e.base,u={n:1n,d:2n},l=chunk2XZCLDHJ_cjs.h(a,u),s={kind:"mul",left:chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.h(r,u)),right:chunk2XZCLDHJ_cjs.s("log",[n])},p=chunk2XZCLDHJ_cjs.g(o,chunk2XZCLDHJ_cjs.h(r,l));if(chunk2XZCLDHJ_cjs.l(p))return s;let h=chunk2XZCLDHJ_cjs.O(chunk2XZCLDHJ_cjs.g(i,chunk2XZCLDHJ_cjs.h(l,l))),x={kind:"add",left:chunk2XZCLDHJ_cjs.q(t),right:chunk2XZCLDHJ_cjs.p(l)},V={kind:"mul",left:{kind:"div",left:chunk2XZCLDHJ_cjs.p(p),right:h},right:chunk2XZCLDHJ_cjs.s("atan",[{kind:"div",left:x,right:h}])};return chunk2XZCLDHJ_cjs.l(r)?V:{kind:"add",left:s,right:V}}function Sr(e,t){let n=chunk2XZCLDHJ_cjs.p(0);return e.forEach((o,r)=>{if(chunk2XZCLDHJ_cjs.l(o))return;let i=r+1,a=chunk2XZCLDHJ_cjs.i(o,{n:BigInt(i),d:1n}),u={kind:"mul",left:chunk2XZCLDHJ_cjs.p(a),right:i===1?chunk2XZCLDHJ_cjs.q(t):chunk2XZCLDHJ_cjs.r(chunk2XZCLDHJ_cjs.q(t),chunk2XZCLDHJ_cjs.p(i))};n={kind:"add",left:n,right:u};}),n}function ve(e,t){let n=chunk2XZCLDHJ_cjs.Q(e);if(!chunk2XZCLDHJ_cjs.u(n).has(t))return {ok:true,value:chunk2XZCLDHJ_cjs.Q({kind:"mul",left:n,right:chunk2XZCLDHJ_cjs.q(t)})};let o=gr(n,t);if(o!==null)return o;let r=Rr(n,t);if(r!==null)return r;let i=xr(n,t);if(i!==null)return i;let a=vr(n,t);if(a!==null)return a;if(n.kind==="add"||n.kind==="sub"){let u=ve(n.left,t);if(!u.ok)return u;let l=ve(n.right,t);return l.ok?{ok:true,value:chunk2XZCLDHJ_cjs.Q({kind:n.kind,left:u.value,right:l.value})}:l}if(n.kind==="mul"&&n.left.kind==="const"){let u=ve(n.right,t);return u.ok?{ok:true,value:chunk2XZCLDHJ_cjs.Q({kind:"mul",left:n.left,right:u.value})}:u}return {ok:false,reason:"no elementary antiderivative is known for this expression"}}var lt=16;function _n(e,t,n,o){if(o<0||!Number.isInteger(o)||o>lt)throw chunkNAZ6PGLS_cjs.c.execution("SYMBOLIC_TAYLOR_DEGREE_LIMIT",`A Taylor degree must be a whole number from 0 to ${lt}.`,{limit:lt});let r=chunk2XZCLDHJ_cjs.p(n),i=1n,a=chunk2XZCLDHJ_cjs.p(chunk2XZCLDHJ_cjs.a);for(let u=0;u<=o;u++){u>0&&(i*=BigInt(u));let l=xe(e,t,u),s=chunk2XZCLDHJ_cjs.Q(chunk2XZCLDHJ_cjs.v(l,t,r));if(s.kind!=="const")throw chunkNAZ6PGLS_cjs.c.execution("SYMBOLIC_TAYLOR_INEXACT",`The derivative of order ${u} does not reduce to an exact number at the expansion point, so this series cannot be computed exactly.`,{order:u});let p=chunk2XZCLDHJ_cjs.i(s.value,{n:i,d:1n});if(chunk2XZCLDHJ_cjs.l(p))continue;let h=chunk2XZCLDHJ_cjs.l(n)?chunk2XZCLDHJ_cjs.q(t):{kind:"sub",left:chunk2XZCLDHJ_cjs.q(t),right:r},x=u===0?chunk2XZCLDHJ_cjs.p(1):u===1?h:chunk2XZCLDHJ_cjs.r(h,chunk2XZCLDHJ_cjs.p(u));a={kind:"add",left:a,right:{kind:"mul",left:chunk2XZCLDHJ_cjs.p(p),right:x}};}return chunk2XZCLDHJ_cjs.Q(a)}function wn(e,t){return e.map(n=>t.map(o=>xe(n,o)))}function Er(){return {pluginFunctions:{},opRegistry:new Ne,pluginFunctionOwners:{}}}var Dn=Er();var Ar={1970:38.8,1971:40.5,1972:41.8,1973:44.4,1974:49.3,1975:53.8,1976:56.9,1977:60.6,1978:65.2,1979:72.6,1980:82.4,1981:90.9,1982:96.5,1983:99.6,1984:103.9,1985:107.6,1986:109.6,1987:113.6,1988:118.3,1989:124,1990:130.7,1991:136.2,1992:140.3,1993:144.5,1994:148.2,1995:152.4,1996:156.9,1997:160.5,1998:163,1999:166.6,2e3:172.2,2001:177.1,2002:179.9,2003:184,2004:188.9,2005:195.3,2006:201.6,2007:207.3,2008:215.3,2009:214.5,2010:218.1,2011:224.9,2012:229.6,2013:233,2014:236.7,2015:237,2016:240,2017:245.1,2018:251.1,2019:255.7,2020:258.8,2021:271,2022:292.7,2023:304.7,2024:313.7,2025:322.2,2026:332.7},Pn=1970,Ln=2026;function Cn(e){return Ar[Math.trunc(e)]}function st(e,t){let n=Cn(e),o=Cn(t);if(!(n===void 0||o===void 0||n===0))return o/n}function va(e,t,n){let o=st(t,n);if(o!==void 0)return e*o}var kr=0;function ct(e){if(e.type===6&&e.unit!==void 0){let t=chunk6QRHN3I6_cjs.a[e.unit.toLowerCase()];if(t!==void 0&&t[0]===kr)return e.toNumber()*t[1]}return e.toNumber()}function Vr(e,t){if(t===1)return e;let n=`${e}s`;return chunk6QRHN3I6_cjs.a[n.toLowerCase()]===void 0?e:n}function Fn(e,t){let n,o=false;for(let r of e){if(Number.isNaN(r.toNumber())){o=true;continue}if(n===void 0){n=r;continue}let{lv:i,rv:a,sameMeasure:u}=he(n,r);if(!u){let l=n.type===6?n.unit:void 0,s=r.type===6?r.unit:void 0,p=Fe(l,s,"compared");return chunk6U66HQKQ_cjs.P("INCOMPATIBLE_UNITS",p??`Cannot compare incompatible units: ${l??"?"} and ${s??"?"}`)}(t?a>i:a<i)&&(n=r);}return o?chunk6U66HQKQ_cjs.n(NaN):n===void 0?chunk6U66HQKQ_cjs.n(t?-1/0:1/0):n.type===6?n:chunk6U66HQKQ_cjs.n(n.toNumber())}function Ue(e,t){return e.type===6&&e.unit!==void 0?chunk6U66HQKQ_cjs.u(t,e.unit):chunk6U66HQKQ_cjs.n(t)}function Un(e,t){let n=Number.isFinite(t)?Math.min(100,Math.max(0,Math.trunc(t))):0;if(e.exact!==void 0){let a=chunk2XZCLDHJ_cjs.oa(e.exact,n);return $e(e,chunk2XZCLDHJ_cjs.ra(a),n,a)}let o=e.toNumber();if(!Number.isFinite(o))return $e(e,o,n);let r=Math.pow(10,n),i=o*r;return !Number.isFinite(i)||Math.abs(i)>Number.MAX_SAFE_INTEGER?$e(e,o,n):$e(e,Math.round(i)/r,n)}function $e(e,t,n,o){let r=e.type===6&&e.unit!==void 0?chunk6U66HQKQ_cjs.u(t,e.unit):chunk6U66HQKQ_cjs.n(t);return r.decimalPlaces=n,o!==void 0&&(r.exact=o),r}function $n(e,t,n){if(Number.isFinite(e)&&Number.isFinite(t))return null;let o=Number.isFinite(e)?t:e;return chunk6U66HQKQ_cjs.P("INVALID_INTEGER_OPERAND",`${n} needs two whole numbers, and ${Number.isNaN(o)?"one of them has no value":"one of them is infinite"}`)}function Bn(e,t){let n=e,o=t;for(;o!==0;){let r=o;o=n%o,n=r;}return n}function Tr(e){let t=e.length;if(t===0)return 0;let n=e.reduce((o,r)=>o+r,0)/t;return e.reduce((o,r)=>o+(r-n)*(r-n),0)}function Be(e,t){let n=e.length;if(n===0)return 0;let o=t?n-1:n;return o<=0?0:Tr(e)/o}var Ga={0:e=>{let t=e[0].toNumber();return t>=0?chunk6U66HQKQ_cjs.n(Math.sqrt(t)):_(chunk2XZCLDHJ_cjs.s("sqrt",[chunk2XZCLDHJ_cjs.p(t)]))},1:e=>e[0].type===7?chunk2XZCLDHJ_cjs.ca(e[0].value):Ue(e[0],Math.abs(e[0].toNumber())),2:e=>chunk6U66HQKQ_cjs.n(Math.sin(ct(e[0]))),3:e=>chunk6U66HQKQ_cjs.n(Math.cos(ct(e[0]))),4:e=>chunk6U66HQKQ_cjs.n(Math.tan(ct(e[0]))),5:e=>chunk6U66HQKQ_cjs.n(Math.log(e[0].toNumber())),6:e=>Ue(e[0],Math.ceil(e[0].toNumber())),7:e=>Ue(e[0],Math.floor(e[0].toNumber())),8:e=>e.length>=2?Un(e[0],e[1].toNumber()):Ue(e[0],Math.round(e[0].toNumber())),9:e=>Fn(e,false),10:e=>Fn(e,true),11:e=>chunk6U66HQKQ_cjs.n(Math.asin(e[0].toNumber())),12:e=>chunk6U66HQKQ_cjs.n(Math.acos(e[0].toNumber())),13:e=>chunk6U66HQKQ_cjs.n(Math.atan(e[0].toNumber())),14:e=>chunk6U66HQKQ_cjs.n(Math.atan2(e[0].toNumber(),e[1].toNumber())),15:e=>chunk6U66HQKQ_cjs.n(Math.sinh(e[0].toNumber())),16:e=>chunk6U66HQKQ_cjs.n(Math.cosh(e[0].toNumber())),17:e=>chunk6U66HQKQ_cjs.n(Math.tanh(e[0].toNumber())),18:e=>chunk6U66HQKQ_cjs.n(Math.asinh(e[0].toNumber())),19:e=>chunk6U66HQKQ_cjs.n(Math.acosh(e[0].toNumber())),20:e=>chunk6U66HQKQ_cjs.n(Math.atanh(e[0].toNumber())),21:e=>chunk6U66HQKQ_cjs.n(Math.cbrt(e[0].toNumber())),22:e=>chunk6U66HQKQ_cjs.n(Math.clz32(e[0].toNumber())),23:e=>chunk6U66HQKQ_cjs.n(Math.expm1(e[0].toNumber())),24:e=>chunk6U66HQKQ_cjs.n(Math.exp(e[0].toNumber())),25:e=>chunk6U66HQKQ_cjs.n(Math.fround(e[0].toNumber())),26:e=>chunk6U66HQKQ_cjs.n(Math.hypot(...e.map(t=>t.toNumber()))),27:e=>chunk6U66HQKQ_cjs.n(Math.imul(e[0].toNumber(),e[1].toNumber())),28:e=>chunk6U66HQKQ_cjs.n(Math.log10(e[0].toNumber())),29:e=>chunk6U66HQKQ_cjs.n(Math.log1p(e[0].toNumber())),30:e=>chunk6U66HQKQ_cjs.n(Math.log2(e[0].toNumber())),31:e=>e[0].type===7?e[1].type!==0?chunk6U66HQKQ_cjs.P("MATRIX_POWER_UNSUPPORTED",`pow: a matrix's exponent must be a whole number, as in "pow([1,2;3,4], 2)".`):chunk2XZCLDHJ_cjs.$(e[0].value,e[1].value):e[1].type===7?chunk6U66HQKQ_cjs.P("MATRIX_POWER_UNSUPPORTED",'pow: a matrix may only be the base, as in "pow([1,2;3,4], 2)".'):chunk6U66HQKQ_cjs.n(et(e[0].toNumber(),e[1].toNumber())),32:()=>chunk6U66HQKQ_cjs.n(Math.random()),33:e=>chunk6U66HQKQ_cjs.n(Math.sign(e[0].toNumber())),34:e=>chunk6U66HQKQ_cjs.n(Math.trunc(e[0].toNumber())),35:e=>chunk6U66HQKQ_cjs.n(e[0].toNumber()*Math.PI/180),36:e=>chunk6U66HQKQ_cjs.n(e[0].toNumber()*180/Math.PI),37:e=>{let t=e[0].toNumber(),n=e[1].toNumber();return t>n?chunk6U66HQKQ_cjs.P("INVALID_RANGE",`roll: invalid range, ${t} is greater than ${n}`):chunk6U66HQKQ_cjs.n(Math.floor(Math.random()*(n-t+1))+t)},38:e=>{let t=Math.trunc(Math.abs(e[0].toNumber())),n=Math.trunc(Math.abs(e[1].toNumber())),o=$n(t,n,"gcd");return o||chunk6U66HQKQ_cjs.n(Bn(t,n))},39:e=>{let t=Math.trunc(Math.abs(e[0].toNumber())),n=Math.trunc(Math.abs(e[1].toNumber())),o=$n(t,n,"lcm");return o||(t===0||n===0?chunk6U66HQKQ_cjs.n(0):chunk6U66HQKQ_cjs.n(t/Bn(t,n)*n))},40:e=>{let t=Math.trunc(e[0].toNumber()),n=Math.trunc(e[1].toNumber());if(t<0||n<0||n>t)return chunk6U66HQKQ_cjs.P("INVALID_RANGE",`permutation: invalid n=${t}, r=${n} (require 0 <= r <= n)`);let o=1;for(let r=0;r<n;r++)if(o*=t-r,!Number.isFinite(o))return chunk6U66HQKQ_cjs.P("PERMUTATION_OVERFLOW",`permutation: P(${t}, ${n}) exceeds the maximum representable double (it passed it after ${r+1} of ${n} factors)`);return chunk6U66HQKQ_cjs.n(o)},41:e=>{let t=Math.trunc(e[0].toNumber()),n=Math.trunc(e[1].toNumber());if(t<0||n<0||n>t)return chunk6U66HQKQ_cjs.P("INVALID_RANGE",`combination: invalid n=${t}, r=${n} (require 0 <= r <= n)`);let o=Math.min(n,t-n),r=1;for(let i=0;i<o;i++)if(r=r*(t-i)/(i+1),!Number.isFinite(r))return chunk6U66HQKQ_cjs.P("COMBINATION_OVERFLOW",`combination: C(${t}, ${n}) exceeds the maximum representable double (it passed it after ${i+1} of ${o} steps)`);return chunk6U66HQKQ_cjs.n(Math.round(r))},42:e=>{if(e.length===0)return chunk6U66HQKQ_cjs.n(0);let t=e.reduce((n,o)=>n+o.toNumber(),0);return chunk6U66HQKQ_cjs.n(t/e.length)},43:e=>{if(e.length===0)return chunk6U66HQKQ_cjs.n(0);let t=e.map(o=>o.toNumber()).sort((o,r)=>o-r),n=Math.floor(t.length/2);return chunk6U66HQKQ_cjs.n(t.length%2===0?(t[n-1]+t[n])/2:t[n])},44:e=>chunk6U66HQKQ_cjs.n(e.reduce((t,n)=>t+n.toNumber(),0)),45:e=>chunk6U66HQKQ_cjs.n(e.length),46:e=>{let[t,n,o]=e,{lv:r,rv:i}=he(t,n);if(r===0)return chunk6U66HQKQ_cjs.P("PROPORTION_DIVIDE_BY_ZERO",`Cannot compute proportion: "${t.value}" is zero`);let a=o.toNumber()*(i/r);return o.type===6?chunk6U66HQKQ_cjs.u(a,o.unit):chunk6U66HQKQ_cjs.n(a)},47:e=>{let t=e[0].toNumber(),n=e[1].toNumber(),o=e[2].toNumber();return n>o?chunk6U66HQKQ_cjs.P("INVALID_RANGE",`clamp: invalid range, ${n} is greater than ${o}`):chunk6U66HQKQ_cjs.n(Math.min(Math.max(t,n),o))},48:e=>chunk6U66HQKQ_cjs.r(e[0].toNumber()),49:e=>chunk6U66HQKQ_cjs.r(e[0].toNumber(),"bin"),50:e=>chunk6U66HQKQ_cjs.n(Math.trunc(e[0].toNumber())),51:e=>{let t=e[0].toNumber(),n=e[1].toNumber(),o=e[2].toNumber();if(1+n<=0)return chunk6U66HQKQ_cjs.P("INVALID_RATE",`compoundInterest: rate ${n} makes (1 + rate) non-positive`);let r=t*Math.pow(1+n,o);return e[0].type===6?chunk6U66HQKQ_cjs.u(r,e[0].unit):chunk6U66HQKQ_cjs.n(r)},52:e=>{let t=e[0].toNumber(),n=e[1].toNumber(),o=e[2].toNumber();if(1+n<=0)return chunk6U66HQKQ_cjs.P("INVALID_RATE",`interestEarned: rate ${n} makes (1 + rate) non-positive`);let r=t*(Math.pow(1+n,o)-1);return e[0].type===6?chunk6U66HQKQ_cjs.u(r,e[0].unit):chunk6U66HQKQ_cjs.n(r)},53:e=>{let t=e[0].toNumber(),n=e[1].toNumber(),o=e[2].toNumber();return t<=0||n<=0?chunk6U66HQKQ_cjs.P("INVALID_RANGE","compoundInterestRate: principal and futureValue must both be positive"):o<=0?chunk6U66HQKQ_cjs.P("INVALID_RANGE","compoundInterestRate: years must be greater than 0"):chunk6U66HQKQ_cjs.n(Math.pow(n/t,1/o)-1)},54:e=>{let t=e[0].toNumber(),n=e[1].toNumber(),o=e[2].toNumber();return t<=0||n<=0?chunk6U66HQKQ_cjs.P("INVALID_RANGE","compoundInterestYears: principal and futureValue must both be positive"):1+o<=0||o===0?chunk6U66HQKQ_cjs.P("INVALID_RATE",`compoundInterestYears: rate ${o} is not usable (must be > -1 and not 0)`):chunk6U66HQKQ_cjs.n(Math.log(n/t)/Math.log(1+o))},55:e=>{let t=e[0].toNumber(),n=e[1].toNumber(),o=e[2].toNumber(),r=e[3].toNumber();if(t<=0)return chunk6U66HQKQ_cjs.P("INVALID_RANGE","loanRepayment: principal must be positive");if(o<=0)return chunk6U66HQKQ_cjs.P("INVALID_RANGE","loanRepayment: years must be positive");if(n<0)return chunk6U66HQKQ_cjs.P("INVALID_RATE","loanRepayment: rate must not be negative");if(r<0)return chunk6U66HQKQ_cjs.P("INVALID_RANGE","loanRepayment: periodsPerYear must not be negative");let{totalRepayment:i}=dt(t,n,o),a=r===0?i:i/(o*r);return e[0].type===6?chunk6U66HQKQ_cjs.u(a,e[0].unit):chunk6U66HQKQ_cjs.n(a)},56:e=>{let t=e[0].toNumber(),n=e[1].toNumber(),o=e[2].toNumber(),r=e[3].toNumber();if(t<=0)return chunk6U66HQKQ_cjs.P("INVALID_RANGE","loanInterest: principal must be positive");if(o<=0)return chunk6U66HQKQ_cjs.P("INVALID_RANGE","loanInterest: years must be positive");if(n<0)return chunk6U66HQKQ_cjs.P("INVALID_RATE","loanInterest: rate must not be negative");if(r<0)return chunk6U66HQKQ_cjs.P("INVALID_RANGE","loanInterest: periodsPerYear must not be negative");let{totalInterest:i}=dt(t,n,o),a=r===0?i:i/(o*r);return e[0].type===6?chunk6U66HQKQ_cjs.u(a,e[0].unit):chunk6U66HQKQ_cjs.n(a)},57:e=>{let t=e[0].toNumber(),n=e[1].toNumber(),o=e[2].toNumber();if(t<=0)return chunk6U66HQKQ_cjs.P("INVALID_RANGE","monthlyPayment: principal must be positive");if(o<=0)return chunk6U66HQKQ_cjs.P("INVALID_RANGE","monthlyPayment: years must be positive");if(n<0)return chunk6U66HQKQ_cjs.P("INVALID_RATE","monthlyPayment: rate must not be negative");let{monthlyPayment:r}=dt(t,n,o);return e[0].type===6?chunk6U66HQKQ_cjs.u(r,e[0].unit):chunk6U66HQKQ_cjs.n(r)},58:e=>{let t=e[0].toNumber(),n=e[1].toNumber();return e[0].type===6?vn(e[0],e[0].unit,n,1):chunk6U66HQKQ_cjs.n(t*(1+n))},59:e=>{let t=e[0].toNumber(),n=e[1].toNumber();return 1+n<=0?chunk6U66HQKQ_cjs.P("INVALID_RATE",`taxRemove: rate ${n} makes (1 + rate) non-positive`):e[0].type===6?Mn(e[0],e[0].unit,n)??chunk6U66HQKQ_cjs.u(t/(1+n),e[0].unit):chunk6U66HQKQ_cjs.n(t/(1+n))},60:e=>{let t=e[0].toNumber(),n=e[1].toNumber(),o=e[2].toNumber(),r=st(n,o);if(r===void 0)return chunk6U66HQKQ_cjs.P("INFLATION_YEAR_OUT_OF_RANGE",`inflationAdjust: fromYear ${n} or toYear ${o} is outside the bundled CPI table's range (${Pn}-${Ln})`);let i=t*r;return e[0].type===6?chunk6U66HQKQ_cjs.u(i,e[0].unit):chunk6U66HQKQ_cjs.n(i)},61:e=>{let t=e[0].toNumber(),n=e[1].toNumber();return chunk6U66HQKQ_cjs.n(et(n,1/t))},62:e=>{let t=e[0].toNumber();if(!Number.isInteger(t)||t<0)return chunk6U66HQKQ_cjs.P("INVALID_FACTORIAL_INPUT",`fact: ${t} is not a non-negative integer`);if(t>170)return chunk6U66HQKQ_cjs.P("FACTORIAL_OVERFLOW",`fact: ${t}! exceeds the maximum representable double (170! is the largest finite factorial)`);let n=1;for(let o=2;o<=t;o++)n*=o;return chunk6U66HQKQ_cjs.n(n)},63:e=>e[0].type===7?chunk2XZCLDHJ_cjs.ba(e[0].value):e[0],64:e=>e[0].type===7?chunk2XZCLDHJ_cjs.ca(e[0].value):chunk6U66HQKQ_cjs.n(e[0].toNumber()),65:e=>e[0].type===7?chunk2XZCLDHJ_cjs.da(e[0].value):chunk6U66HQKQ_cjs.n(1/e[0].toNumber()),66:e=>{let[t,n]=e;if(t.type===0&&n.type===0)return chunk6U66HQKQ_cjs.n(t.toNumber()*n.toNumber());let o=r=>r.type===7?r.value:{rows:1,cols:1,data:[r.toNumber()],hasSymbolic:false};return chunk2XZCLDHJ_cjs._(o(t),o(n))},67:e=>{let[t]=e;return t.type!==9?t:_(chunk2XZCLDHJ_cjs.F(t.value))},68:e=>{let[t]=e;return t.type!==9?t:_(zt(t.value))},69:e=>{let[t,n,o]=e;return o?.type!==3?chunk6U66HQKQ_cjs.P("SOLVE_REQUIRES_VARIABLE_NAME","solve's second argument must be the name of the unknown."):fn(t,n,o.value)},70:e=>{let[t,n,o]=e,r=ft(n,"der");if(typeof r!="string")return r;let i=O(t);return i===null?chunk6U66HQKQ_cjs.P("SYMBOLIC_NONFINITE_OPERAND","der needs an expression with an exact value."):_(xe(i,r,o?.toNumber()??1))},71:e=>{let[t,n]=e,o=ft(n,"integral");if(typeof o!="string")return o;let r=O(t);if(r===null)return chunk6U66HQKQ_cjs.P("SYMBOLIC_NONFINITE_OPERAND","integral needs an expression with an exact value.");let i=ve(r,o);return i.ok?_(i.value):chunk6U66HQKQ_cjs.P("SYMBOLIC_INTEGRAL_UNSUPPORTED",`Cannot integrate this: ${i.reason}.`)},72:e=>{let[t,n,o,r]=e,i=ft(n,"taylor");if(typeof i!="string")return i;let a=O(t),u=O(o);return a===null||u===null||u.kind!=="const"?chunk6U66HQKQ_cjs.P("SYMBOLIC_NONFINITE_OPERAND","taylor needs an expression and an exact expansion point."):_(_n(a,i,u.value,r.toNumber()))},73:e=>{let t=[];for(let a of e){let u=O(a);if(u===null)return chunk6U66HQKQ_cjs.P("SYMBOLIC_NONFINITE_OPERAND","jacobian needs expressions with exact values.");t.push(u);}let n=new Set;for(let a of t)for(let u of chunk2XZCLDHJ_cjs.u(a))n.add(u);let o=[...n].sort();if(o.length===0)return chunk6U66HQKQ_cjs.P("SYMBOLIC_JACOBIAN_NO_VARIABLES","jacobian needs at least one unknown to differentiate against.");let r=wn(t,o),i=[];for(let a of r)for(let u of a)i.push(chunk2XZCLDHJ_cjs.W(u));return chunk6U66HQKQ_cjs.C(r.length,o.length,chunk2XZCLDHJ_cjs.Y(r.length,o.length,i))},74:e=>_(chunk2XZCLDHJ_cjs.w(chunk2XZCLDHJ_cjs.o(chunk2XZCLDHJ_cjs.a,chunk2XZCLDHJ_cjs.d(e[0].toNumber())))),75:e=>mt("conj",e[0]),76:e=>mt("re",e[0]),77:e=>mt("im",e[0]),78:e=>{let t=e[0];return t.type!==9?t:_(chunk2XZCLDHJ_cjs.J(t.value))},79:e=>{let t=e[0];return t.type!==9?t:_(kn(t.value))},85:e=>{let t=e[0].toNumber(),n=e[1].toNumber();if(1+n<=0)return chunk6U66HQKQ_cjs.P("INVALID_RATE",`taxIn: rate ${n} makes (1 + rate) non-positive`);let o=t-t/(1+n);return e[0].type===6?Sn(e[0],e[0].unit,n)??chunk6U66HQKQ_cjs.u(o,e[0].unit):chunk6U66HQKQ_cjs.n(o)},86:e=>{let t=e[0].toNumber(),n=e[1].toNumber();return e[0].type===6?xn(e[0],n,e[0].unit):chunk6U66HQKQ_cjs.n(t*n)},87:e=>chunk6U66HQKQ_cjs.n(Math.sin(e[0].toNumber()*Math.PI/180)),88:e=>chunk6U66HQKQ_cjs.n(Math.cos(e[0].toNumber()*Math.PI/180)),89:e=>chunk6U66HQKQ_cjs.n(Math.tan(e[0].toNumber()*Math.PI/180)),90:e=>chunk6U66HQKQ_cjs.n(Math.asin(e[0].toNumber())*180/Math.PI),91:e=>chunk6U66HQKQ_cjs.n(Math.acos(e[0].toNumber())*180/Math.PI),92:e=>chunk6U66HQKQ_cjs.n(Math.atan(e[0].toNumber())*180/Math.PI),93:e=>chunk6U66HQKQ_cjs.u(e[0].toNumber(),"days"),94:e=>{let t=typeof e[1]?.value=="string"?e[1].value:void 0,n=typeof e[2]?.value=="string"?e[2].value:void 0;if(t===void 0||n===void 0)return chunk6U66HQKQ_cjs.P("UNKNOWN_UNIT",'both units have to be named, as in "12.5 minutes in minutes and seconds"');let o=chunk6QRHN3I6_cjs.a[t.toLowerCase()],r=chunk6QRHN3I6_cjs.a[n.toLowerCase()];if(o===void 0||r===void 0)return chunk6U66HQKQ_cjs.P("UNKNOWN_UNIT",`${t} and ${n}: one of these is not a unit`);if(o[0]!==r[0])return chunk6U66HQKQ_cjs.P("INCOMPATIBLE_UNITS",`${t} and ${n} measure different things`);if(r[1]>=o[1])return chunk6U66HQKQ_cjs.P("INCOMPATIBLE_UNITS",`${t} and ${n}: name the larger unit first`);let i=e[0],a=i.type===6&&i.unit!==void 0?chunk6QRHN3I6_cjs.a[i.unit.toLowerCase()]:void 0,u=i.toNumber()*(a?.[1]??o[1]),l=Math.floor(u/o[1]),s=Math.round((u-l*o[1])/r[1]*1e3)/1e3;return chunk6U66HQKQ_cjs.t(`${l} ${t} ${s} ${n}`)},95:e=>{let t=e[0],n=String(e[1].value),o=t.type===6&&t.unit!==void 0?t.unit:"";return o.includes("/")?chunk6U66HQKQ_cjs.P("INVALID_RATE_UNIT",`${o}/${n}: that is already a rate`):chunk6U66HQKQ_cjs.u(t.toNumber(),`${o}/${n}`)},96:e=>{let t=e[0],n=e[1];if(n.type!==6||n.unit===void 0||!n.unit.includes("/"))return chunk6U66HQKQ_cjs.P("INVALID_RATE",'at: the right-hand side has to be a rate, as in "$30/hour"');let o=n.unit.indexOf("/"),r=n.unit.slice(0,o),i=n.unit.slice(o+1),a=t.type===6?t.unit:void 0,u=chunk6QRHN3I6_cjs.a[i.toLowerCase()],l=a===void 0?void 0:chunk6QRHN3I6_cjs.a[a.toLowerCase()];if(l!==void 0&&u!==void 0&&l[0]===u[0]){let p=t.toNumber()*l[1]/u[1]*n.toNumber();return r===""?chunk6U66HQKQ_cjs.n(p):chunk6U66HQKQ_cjs.u(p,r)}if(a!==void 0&&a===r){let s=t.toNumber()/n.toNumber();return chunk6U66HQKQ_cjs.u(s,Vr(i,s))}if(a===void 0){let s=t.toNumber()*n.toNumber();return r===""?chunk6U66HQKQ_cjs.n(s):chunk6U66HQKQ_cjs.u(s,r)}return chunk6U66HQKQ_cjs.P("INCOMPATIBLE_UNITS",`at: ${a} matches neither side of ${n.unit}`)},80:e=>{let t=e[0].toNumber(),n=e[1].toNumber(),o=e[2].toNumber(),r=e[3].toNumber();if(r<=0)return chunk6U66HQKQ_cjs.P("INVALID_RATE",`compounding: ${r} periods per year is not a period`);if(1+n/r<=0)return chunk6U66HQKQ_cjs.P("INVALID_RATE",`compounding: rate ${n} makes each period non-positive`);let i=t*Math.pow(1+n/r,r*o);return e[0].type===6?chunk6U66HQKQ_cjs.u(i,e[0].unit):chunk6U66HQKQ_cjs.n(i)},81:e=>{let t=e[0].toNumber(),n=e[1].toNumber(),o=e[2].toNumber(),r=e[3].toNumber();if(r<=0||1+n/r<=0)return chunk6U66HQKQ_cjs.P("INVALID_RATE",`compounding: rate ${n} over ${r} periods per year is not usable`);let i=t*(Math.pow(1+n/r,r*o)-1);return e[0].type===6?chunk6U66HQKQ_cjs.u(i,e[0].unit):chunk6U66HQKQ_cjs.n(i)},82:e=>{let t=e[0].toNumber(),n=e[1].toNumber(),o=e[2].toNumber();if(1+n<=0)return chunk6U66HQKQ_cjs.P("INVALID_RATE",`presentValue: rate ${n} makes (1 + rate) non-positive`);let r=t/Math.pow(1+n,o);return e[0].type===6?chunk6U66HQKQ_cjs.u(r,e[0].unit):chunk6U66HQKQ_cjs.n(r)},83:e=>{let t=e[0].toNumber(),n=e[1].toNumber();return t===0?chunk6U66HQKQ_cjs.P("INVALID_RATE","roi: nothing was invested, so there is no return on it"):chunk6U66HQKQ_cjs.n((n-t)/t)},84:e=>{let t=e[0].toNumber(),n=e[1].toNumber(),o=e[2].toNumber();return t<=0?chunk6U66HQKQ_cjs.P("INVALID_RATE","annual return: the amount invested must be positive"):o<=0?chunk6U66HQKQ_cjs.P("INVALID_RATE","annual return: the period must be longer than zero"):n<=0?chunk6U66HQKQ_cjs.P("INVALID_RATE","annual return: nothing was returned, so there is no annual rate"):chunk6U66HQKQ_cjs.N(Math.pow(n/t,1/o)-1)},97:e=>Un(e[0],e[1].toNumber()),98:e=>{let t=e[1].toNumber();return !Number.isInteger(t)||t<1?chunk6U66HQKQ_cjs.P("INVALID_RANGE",`split: the number of shares must be a whole number of at least 1, not ${e[1].toNumber()}.`):chunk6U66HQKQ_cjs.H(En(e[0],t))},99:e=>{let t=e[0].toNumber(),n=Or(e[1]),o=e[2].toNumber();if(n===null)return chunk6U66HQKQ_cjs.P("INVALID_RANGE",'savings goal: the duration must be in months or years, e.g. "in 2 years".');if(t<=0)return chunk6U66HQKQ_cjs.P("INVALID_RANGE","savings goal: the target must be positive.");if(n<=0)return chunk6U66HQKQ_cjs.P("INVALID_RANGE","savings goal: the duration must be positive.");if(o<0)return chunk6U66HQKQ_cjs.P("INVALID_RATE","savings goal: the rate must not be negative.");let r=_r(t,o/12,n);return e[0].type===6?chunk6U66HQKQ_cjs.u(r,e[0].unit):chunk6U66HQKQ_cjs.n(r)},100:e=>{let t=e[0].toNumber(),n=e[1].toNumber(),o=e[2].toNumber(),r=e[3].toNumber(),i=typeof e[4]?.value=="string"?e[4].value:"periods";if(t<=0)return chunk6U66HQKQ_cjs.P("INVALID_RANGE","savings goal: the target must be positive.");if(n<=0)return chunk6U66HQKQ_cjs.P("INVALID_RANGE","savings goal: the contribution must be positive.");if(r<0)return chunk6U66HQKQ_cjs.P("INVALID_RATE","savings goal: the rate must not be negative.");let a=wr(t,n,r/o);return chunk6U66HQKQ_cjs.u(a,i)},101:e=>chunk6U66HQKQ_cjs.n(Math.sqrt(Be(e.map(t=>t.toNumber()),false))),102:e=>chunk6U66HQKQ_cjs.n(Math.sqrt(Be(e.map(t=>t.toNumber()),true))),103:e=>chunk6U66HQKQ_cjs.n(Be(e.map(t=>t.toNumber()),false)),104:e=>chunk6U66HQKQ_cjs.n(Be(e.map(t=>t.toNumber()),true)),105:e=>{if(e.length===0)return chunk6U66HQKQ_cjs.n(0);let t=e.map(n=>n.toNumber());return chunk6U66HQKQ_cjs.n(Math.max(...t)-Math.min(...t))},106:e=>{if(e.length===0)return chunk6U66HQKQ_cjs.n(0);let t=new Map,n=e[0].toNumber(),o=0;for(let r of e){let i=r.toNumber(),a=(t.get(i)??0)+1;t.set(i,a),a>o&&(o=a,n=i);}return chunk6U66HQKQ_cjs.n(n)},107:e=>{let t=0,n=0;for(let o=0;o+1<e.length;o+=2){let r=e[o].toNumber(),i=e[o+1].toNumber();t+=r*i,n+=i;}return n===0?chunk6U66HQKQ_cjs.P("WEIGHTED_AVERAGE_ZERO_WEIGHT","weighted average: the weights sum to zero, so there is nothing to divide by"):chunk6U66HQKQ_cjs.n(t/n)}};function Or(e){if(e.type!==6)return null;let t=e.unit;return t==="months"||t==="month"?e.toNumber():t==="years"||t==="year"?e.toNumber()*12:null}function _r(e,t,n){return t===0?e/n:e*t/(Math.pow(1+t,n)-1)}function wr(e,t,n){let o=n===0?e/t:Math.log(1+e*n/t)/Math.log(1+n);return Math.ceil(o-1e-9)}function mt(e,t){let n=O(t);return n===null?chunk6U66HQKQ_cjs.P("SYMBOLIC_NONFINITE_OPERAND",e+" needs a value with an exact number."):_(chunk2XZCLDHJ_cjs.s(e,[n]))}function ft(e,t){return e?.type!==3?chunk6U66HQKQ_cjs.P("SYMBOLIC_REQUIRES_VARIABLE_NAME",`${t} needs the name of an unknown.`):e.value}function dt(e,t,n){let o=n*12,r=t/12,i=r===0?e/o:e*r/(1-Math.pow(1+r,-o)),a=i*o,u=a-e;return {monthlyPayment:i,totalRepayment:a,totalInterest:u}}var ja=Dn.pluginFunctions,qn=65535,Yn=0;function Dr(){if(Yn>qn)throw chunkNAZ6PGLS_cjs.c.config("PLUGIN_FUNCTION_INDEX_POOL_EXHAUSTED",`allocatePluginFunctionIndex: pool exhausted (max ${qn+1} allocations).`);return Yn++}var Gn=new Map;function Ka(e){let t=Gn.get(e);return t===void 0&&(t=Dr(),Gn.set(e,t)),t}var pt=new Map;function Xa(e,t){let n=e.toLowerCase(),o=pt.get(n);o&&o!==t&&console.warn(`[asConverterRegistry] Converter name "${n}" is already registered \u2014 overwriting.`),pt.set(n,t);}function Za(e){pt.delete(e.toLowerCase());}var qe=class qe{constructor(){this.values=new Map;this.listeners=new Set;this.notifyDepth=0;}get(t){return this.values.get(t)}has(t){return this.values.has(t)}set(t,n){let o=this.values.get(t);this.values.set(t,n),!(o!==void 0&&Cr(o,n))&&this.notify(t,n);}notify(t,n){if(!(this.notifyDepth>=qe.MAX_NOTIFY_DEPTH)){this.notifyDepth++;try{for(let o of this.listeners)o(t,n);}finally{this.notifyDepth--;}}}subscribe(t){return this.listeners.add(t),()=>{this.listeners.delete(t);}}clear(){this.values.clear(),this.listeners.clear(),this.notifyDepth=0;}};qe.MAX_NOTIFY_DEPTH=64;var bt=qe;function Cr(e,t){if(e.type!==t.type||e.unit!==t.unit||(e.timedOut??false)!==(t.timedOut??false))return  false;let n=e.value,o=t.value;if(Array.isArray(n)||Array.isArray(o)){if(!Array.isArray(n)||!Array.isArray(o)||n.length!==o.length)return  false;for(let r=0;r<n.length;r++)if(!Object.is(n[r],o[r]))return  false;return  true}return Object.is(n,o)}var Wa=new bt;function Qa(e){return `global:${e}`}exports.A=Ln;exports.B=va;exports.C=Ga;exports.D=ja;exports.E=Dr;exports.F=Ka;exports.G=pt;exports.H=Xa;exports.I=Za;exports.J=Wa;exports.K=Qa;exports.a=ge;exports.b=xn;exports.c=vn;exports.d=sn;exports.e=hi;exports.f=Ni;exports.g=gi;exports.h=Ri;exports.i=fn;exports.j=he;exports.k=Oi;exports.l=_i;exports.m=wi;exports.n=pn;exports.o=Di;exports.p=Ci;exports.q=et;exports.r=Pi;exports.s=Li;exports.t=Fi;exports.u=Ui;exports.v=Ne;exports.w=qi;exports.x=Er;exports.y=Dn;exports.z=Pn;//# sourceMappingURL=chunk-EEVUKZ5B.cjs.map
-//# sourceMappingURL=chunk-EEVUKZ5B.cjs.map