toilscript 0.1.4 → 0.1.6

package/dist/cli.js

@@ -4,8 +4,8 @@
  * Copyright 2026 Daniel Wirtz / The ToilScript Authors
  * SPDX-License-Identifier: Apache-2.0
  */
-var se=Object.defineProperty;var Ne=Object.getOwnPropertyDescriptor;var Me=Object.getOwnPropertyNames;var Ue=Object.prototype.hasOwnProperty;var fn=(e,t)=>()=>(e&&(t=e(e=0)),t);var Q=(e,t)=>{for(var n in t)se(e,n,{get:t[n],enumerable:!0})},ae=(e,t,n,a)=>{if(t&&typeof t=="object"||typeof t=="function")for(let s of Me(t))!Ue.call(e,s)&&s!==n&&se(e,s,{get:()=>t[s],enumerable:!(a=Ne(t,s))||a.enumerable});return e},Dn=(e,t,n)=>(ae(e,t,"default"),n&&ae(n,t,"default"));var le={};Q(le,{promises:()=>Pe});var Pe,ue=fn(()=>{"use strict";Pe={}});var fe={};Q(fe,{createRequire:()=>Ve});function Ve(){return function(t){throw new Error(`Cannot find module: '${t}'`)}}var ce=fn(()=>{"use strict"});var On={};Q(On,{argv:()=>Xe,cwd:()=>In,exit:()=>He,hrtime:()=>qe,platform:()=>je,umask:()=>Ge});function In(){return"."}function Ge(){return 0}function He(e=0){throw Error(`exit ${e}`)}function qe(e){var t=Ke.call(de),n=Math.floor(t*.001),a=Math.floor(t*1e6-n*1e9);return e&&(n-=e[0],a-=e[1],a<0&&(n--,a+=1e9)),[n,a]}var je,Xe,de,Ke,Ln=fn(()=>{"use strict";je="linux";Xe=[];de=globalThis.performance||{},Ke=de.now||function(){return new Date().getTime()}});var kn={};Q(kn,{basename:()=>Qe,delimiter:()=>it,dirname:()=>Je,extname:()=>nt,format:()=>et,isAbsolute:()=>Ye,join:()=>Ze,normalize:()=>pe,parse:()=>tt,relative:()=>$e,resolve:()=>cn,sep:()=>Rn,win32:()=>rt});function V(e){if(typeof e!="string")throw new TypeError("Path must be a string. Received "+JSON.stringify(e))}function xe(e,t){for(var n="",a=0,s=-1,r=0,u,f=0;f<=e.length;++f){if(f<e.length)u=e.charCodeAt(f);else{if(u===47)break;u=47}if(u===47){if(!(s===f-1||r===1))if(s!==f-1&&r===2){if(n.length<2||a!==2||n.charCodeAt(n.length-1)!==46||n.charCodeAt(n.length-2)!==46){if(n.length>2){var p=n.lastIndexOf("/");if(p!==n.length-1){p===-1?(n="",a=0):(n=n.slice(0,p),a=n.length-1-n.lastIndexOf("/")),s=f,r=0;continue}}else if(n.length===2||n.length===1){n="",a=0,s=f,r=0;continue}}t&&(n.length>0?n+="/..":n="..",a=2)}else n.length>0?n+="/"+e.slice(s+1,f):n=e.slice(s+1,f),a=f-s-1;s=f,r=0}else u===46&&r!==-1?++r:r=-1}return n}function We(e,t){var n=t.dir||t.root,a=t.base||(t.name||"")+(t.ext||"");return n?n===t.root?n+a:n+e+a:a}function cn(){for(var e="",t=!1,n,a=arguments.length-1;a>=-1&&!t;a--){var s;a>=0?s=arguments[a]:(n===void 0&&(n=In()),s=n),V(s),s.length!==0&&(e=s+"/"+e,t=s.charCodeAt(0)===47)}return e=xe(e,!t),t?e.length>0?"/"+e:"/":e.length>0?e:"."}function pe(e){if(V(e),e.length===0)return".";var t=e.charCodeAt(0)===47,n=e.charCodeAt(e.length-1)===47;return e=xe(e,!t),e.length===0&&!t&&(e="."),e.length>0&&n&&(e+="/"),t?"/"+e:e}function Ye(e){return V(e),e.length>0&&e.charCodeAt(0)===47}function Ze(){if(arguments.length===0)return".";for(var e,t=0;t<arguments.length;++t){var n=arguments[t];V(n),n.length>0&&(e===void 0?e=n:e+="/"+n)}return e===void 0?".":pe(e)}function $e(e,t){if(V(e),V(t),e===t||(e=cn(e),t=cn(t),e===t))return"";if(e===".")return t;for(var n=1;n<e.length&&e.charCodeAt(n)===47;++n);for(var a=e.length,s=a-n,r=1;r<t.length&&t.charCodeAt(r)===47;++r);for(var u=t.length,f=u-r,p=s<f?s:f,b=-1,d=0;d<=p;++d){if(d===p){if(f>p){if(t.charCodeAt(r+d)===47)return t.slice(r+d+1);if(d===0)return t.slice(r+d)}else s>p&&(e.charCodeAt(n+d)===47?b=d:d===0&&(b=0));break}var g=e.charCodeAt(n+d),y=t.charCodeAt(r+d);if(g!==y)break;g===47&&(b=d)}var m="";for(d=n+b+1;d<=a;++d)(d===a||e.charCodeAt(d)===47)&&(m.length===0?m+="..":m+="/..");return m.length>0?m+t.slice(r+b):(r+=b,t.charCodeAt(r)===47&&++r,t.slice(r))}function Je(e){if(V(e),e.length===0)return".";for(var t=e.charCodeAt(0),n=t===47,a=-1,s=!0,r=e.length-1;r>=1;--r)if(t=e.charCodeAt(r),t===47){if(!s){a=r;break}}else s=!1;return a===-1?n?"/":".":n&&a===1?"//":e.slice(0,a)}function Qe(e,t){if(t!==void 0&&typeof t!="string")throw new TypeError('"ext" argument must be a string');V(e);var n=0,a=-1,s=!0,r;if(t!==void 0&&t.length>0&&t.length<=e.length){if(t.length===e.length&&t===e)return"";var u=t.length-1,f=-1;for(r=e.length-1;r>=0;--r){var p=e.charCodeAt(r);if(p===47){if(!s){n=r+1;break}}else f===-1&&(s=!1,f=r+1),u>=0&&(p===t.charCodeAt(u)?--u===-1&&(a=r):(u=-1,a=f))}return n===a?a=f:a===-1&&(a=e.length),e.slice(n,a)}else{for(r=e.length-1;r>=0;--r)if(e.charCodeAt(r)===47){if(!s){n=r+1;break}}else a===-1&&(s=!1,a=r+1);return a===-1?"":e.slice(n,a)}}function nt(e){V(e);for(var t=-1,n=0,a=-1,s=!0,r=0,u=e.length-1;u>=0;--u){var f=e.charCodeAt(u);if(f===47){if(!s){n=u+1;break}continue}a===-1&&(s=!1,a=u+1),f===46?t===-1?t=u:r!==1&&(r=1):t!==-1&&(r=-1)}return t===-1||a===-1||r===0||r===1&&t===a-1&&t===n+1?"":e.slice(t,a)}function et(e){if(e===null||typeof e!="object")throw new TypeError('The "pathObject" argument must be of type Object. Received type '+typeof e);return We("/",e)}function tt(e){V(e);var t={root:"",dir:"",base:"",ext:"",name:""};if(e.length===0)return t;var n=e.charCodeAt(0),a=n===47,s;a?(t.root="/",s=1):s=0;for(var r=-1,u=0,f=-1,p=!0,b=e.length-1,d=0;b>=s;--b){if(n=e.charCodeAt(b),n===47){if(!p){u=b+1;break}continue}f===-1&&(p=!1,f=b+1),n===46?r===-1?r=b:d!==1&&(d=1):r!==-1&&(d=-1)}return r===-1||f===-1||d===0||d===1&&r===f-1&&r===u+1?f!==-1&&(u===0&&a?t.base=t.name=e.slice(1,f):t.base=t.name=e.slice(u,f)):(u===0&&a?(t.name=e.slice(1,r),t.base=e.slice(1,f)):(t.name=e.slice(u,r),t.base=e.slice(u,f)),t.ext=e.slice(r,f)),u>0?t.dir=e.slice(0,u-1):a&&(t.dir="/"),t}var Rn,it,rt,Nn=fn(()=>{"use strict";Ln();Rn="/",it=":",rt=null});var he={};Q(he,{pathToFileURL:()=>at});function ot(e){return e.replace(/%/g,"%25").replace(/\\/g,"%5C").replace(/\n/g,"%0A").replace(/\r/g,"%0D").replace(/\t/g,"%09")}function at(e){let t=cn(e);e.charCodeAt(e.length-1)===47&&t[t.length-1]!==Rn&&(t+="/");let n=new URL("file://");return n.pathname=ot(t),n}var ge=fn(()=>{"use strict";Nn()});var Wn={};Q(Wn,{Stats:()=>Cn,checkDiagnostics:()=>gn,compileString:()=>St,configToArguments:()=>qn,createMemoryStream:()=>Hn,default:()=>Wn,defaultOptimizeLevel:()=>Be,defaultShrinkLevel:()=>Se,definitionFiles:()=>Bt,libraryFiles:()=>X,libraryPrefix:()=>P,main:()=>we,options:()=>zt,tscOptions:()=>wt,version:()=>Xn});var st=Object.prototype.toString.call(typeof globalThis.process<"u"?globalThis.process:0)==="[object process]",G,sn,v,U,dn;st?(G=await import("fs"),sn=await import("module"),v=await import("path"),U=globalThis.process,dn=await import("url")):(G=await Promise.resolve().then(()=>(ue(),le)),sn=await Promise.resolve().then(()=>(ce(),fe)),v=await Promise.resolve().then(()=>(Nn(),kn)),U=await Promise.resolve().then(()=>(Ln(),On)),dn=await Promise.resolve().then(()=>(ge(),he)));var An=typeof process<"u"&&process||{},lt=An.env&&"CI"in An.env,ut="\x1B[90m",ft="\x1B[91m",ct="\x1B[92m",dt="\x1B[93m",xt="\x1B[94m",pt="\x1B[95m",ht="\x1B[96m",gt="\x1B[97m",W="\x1B[0m",nn=class{constructor(t){this.stream=t,this.enabled=!!(this.stream&&this.stream.isTTY||lt)}gray(t){return this.enabled?ut+t+W:t}red(t){return this.enabled?ft+t+W:t}green(t){return this.enabled?ct+t+W:t}yellow(t){return this.enabled?dt+t+W:t}blue(t){return this.enabled?xt+t+W:t}magenta(t){return this.enabled?pt+t+W:t}cyan(t){return this.enabled?ht+t+W:t}white(t){return this.enabled?gt+t+W:t}},_n=new nn(An.stdout),Ot=new nn(An.stderr);function mt(e){for(var t=0,n=0,a=e.length;n<a;++n){let s=e.charCodeAt(n);s<128?t+=1:s<2048?t+=2:(s&64512)===55296&&n+1<a&&(e.charCodeAt(n+1)&64512)===56320?(++n,t+=4):t+=3}return t}function bt(e,t,n){var a=n-t;if(a<1)return"";for(var s=null,r=[],u=0,f;t<n;)f=e[t++],f<128?r[u++]=f:f>191&&f<224?r[u++]=(f&31)<<6|e[t++]&63:f>239&&f<365?(f=((f&7)<<18|(e[t++]&63)<<12|(e[t++]&63)<<6|e[t++]&63)-65536,r[u++]=55296+(f>>10),r[u++]=56320+(f&1023)):r[u++]=(f&15)<<12|(e[t++]&63)<<6|e[t++]&63,u>=8192&&((s||(s=[])).push(String.fromCharCode(...r)),u=0);return s?(u&&s.push(String.fromCharCode(...r.slice(0,u))),s.join("")):String.fromCharCode(...r.slice(0,u))}function yt(e,t,n){for(var a=n,s=0,r=e.length;s<r;++s){let u=e.charCodeAt(s),f;u<128?t[n++]=u:u<2048?(t[n++]=u>>6|192,t[n++]=u&63|128):(u&64512)===55296&&s+1<r&&((f=e.charCodeAt(s+1))&64512)===56320?(u=65536+((u&1023)<<10)+(f&1023),++s,t[n++]=u>>18|240,t[n++]=u>>12&63|128,t[n++]=u>>6&63|128,t[n++]=u&63|128):(t[n++]=u>>12|224,t[n++]=u>>6&63|128,t[n++]=u&63|128)}return n-a}var Tn={length:mt,read:bt,write:yt};var me=sn.createRequire(import.meta.url);function ye(e,t,n=!0){var a={},s=[],r=[],u=[],f={};Object.keys(t).forEach(d=>{if(!d.startsWith(" ")){var g=t[d];g.alias!=null&&(typeof g.alias=="string"?f[g.alias]=d:Array.isArray(g.alias)&&g.alias.forEach(y=>f[y]=d)),n&&g.default!=null&&(a[d]=g.default)}});for(var p=0,b=(e=e.slice()).length;p<b;++p){let d=e[p];if(d=="--"){++p;break}let g=/^(?:(-\w)(?:=(.*))?|(--\w{2,})(?:=(.*))?)$/.exec(d),y,m;if(g)t[d]?y=t[m=d]:g[1]!=null?(y=t[m=f[g[1].substring(1)]],y&&g[2]!=null&&(e[p--]=g[2])):g[3]!=null&&(y=t[m=g[3].substring(2)],y&&g[4]!=null&&(e[p--]=g[4]));else if(d.charCodeAt(0)==45)y=t[m=d];else{r.push(d);continue}if(y)if(y.value)Object.keys(y.value).forEach(i=>a[i]=y.value[i]);else if(y.type==null||y.type==="b")a[m]=!0;else if(p+1<e.length&&e[p+1].charCodeAt(0)!=45)switch(y.type){case"i":a[m]=parseInt(e[++p],10);break;case"I":a[m]=(a[m]||[]).concat(parseInt(e[++p],10));break;case"f":a[m]=parseFloat(e[++p]);break;case"F":a[m]=(a[m]||[]).concat(parseFloat(e[++p]));break;case"s":a[m]=String(e[++p]);break;case"S":a[m]=(a[m]||[]).concat(e[++p].split(","));break;default:s.push(d),--p}else switch(y.type){case"i":case"f":a[m]=y.default||0;break;case"s":a[m]=y.default||"";break;case"I":case"F":case"S":a[m]=y.default||[];break;default:s.push(d)}else s.push(d)}for(;p<b;)u.push(e[p++]);return n&&Un(t,a),{options:a,unknown:s,arguments:r,trailing:u}}function Fe(e,t){t||(t={});var n=t.indent||2,a=t.padding||24,s=t.eol||`
-`,r={},u=[];Object.keys(e).forEach(b=>{var d=e[b];if(d.description!=null){for(var g="";g.length<n;)g+=" ";for(g+="--"+b,d.alias&&(g+=", -"+d.alias);g.length<a;)g+=" ";var y;!t.noCategories&&d.category?(y=r[d.category])||(r[d.category]=y=[]):y=u,Array.isArray(d.description)?y.push(g+d.description[0]+d.description.slice(1).map(m=>{for(let i=0;i<a;++i)m=" "+m;return s+m}).join("")):y.push(g+d.description)}});var f=[],p=!1;return Object.keys(r).forEach(b=>{p=!0,f.push(s+" "+_n.gray(b)+s),f.push(r[b].join(s))}),p&&u.length&&f.push(s+" "+_n.gray("Other")+s),f.push(u.join(s)),f.join(s)}function be(e,t){if(e!=null)switch(t){case void 0:case"b":return!!e;case"i":return Math.trunc(e)||0;case"f":return Number(e)||0;case"s":return e===!0?"":e===!1?null:String(e);case"I":return Array.isArray(e)||(e=[e]),e.map(n=>Math.trunc(n)||0);case"F":return Array.isArray(e)||(e=[e]),e.map(n=>Number(n)||0);case"S":return Array.isArray(e)||(e=[e]),e.map(String)}}function Mn(e,t,n,a){let s={};for(let[r,{type:u,mutuallyExclusive:f,isPath:p,useNodeResolution:b,cliOnly:d}]of Object.entries(e)){let g=be(t[r],u),y=be(n[r],u);if(g==null){if(y!=null){if(d)continue;if(Array.isArray(y)){let m;p&&(y=y.map(i=>en(i,a,b))),f!=null&&(m=t[f])?s[r]=y.filter(i=>!m.includes(i)):s[r]=y.slice()}else p&&(y=en(y,a,b)),s[r]=y}}else if(y==null)Array.isArray(g)?s[r]=g.slice():s[r]=g;else if(Array.isArray(g)){if(d){s[r]=g.slice();continue}let m;p&&(y=y.map(i=>en(i,a,b))),f!=null&&(m=t[f])?s[r]=[...g,...y.filter(i=>!g.includes(i)&&!m.includes(i))]:s[r]=[...g,...y.filter(i=>!g.includes(i))]}else s[r]=g}return s}function Ft(e){let t=v.parse(e);return t.root||(t.root="./"),v.format(t)}function en(e,t,n=!1){return v.isAbsolute(e)?e:n&&!e.startsWith(".")&&me.resolve?me.resolve(e,{paths:[t]}):Ft(v.join(t,e))}function Un(e,t){for(let[n,{default:a}]of Object.entries(e))t[n]==null&&a!=null&&(t[n]=a)}var ve="0.1.4",Y={version:{category:"General",description:"Prints just the compiler's version and exits.",type:"b",alias:"v"},help:{category:"General",description:"Prints this message and exits.",type:"b",alias:"h"},config:{category:"General",description:"Configuration file to apply. CLI arguments take precedence.",type:"s",cliOnly:!0},target:{category:"General",description:"Configuration file target to use. Defaults to 'release'.",type:"s",cliOnly:!0},optimize:{category:"Optimization",description:["Optimizes the module. Typical shorthands are:",""," Default optimizations   -O"," Make a release build    -O --noAssert"," Make a debug build      --debug"," Optimize for speed      -Ospeed"," Optimize for size       -Osize",""],type:"b",alias:"O"},optimizeLevel:{category:"Optimization",description:"How much to focus on optimizing code. [0-3]",type:"i"},shrinkLevel:{category:"Optimization",description:"How much to focus on shrinking code size. [0-2, s=1, z=2]",type:"i"},converge:{category:"Optimization",description:"Re-optimizes until no further improvements can be made.",type:"b",default:!1},noAssert:{category:"Optimization",description:"Replaces assertions with just their value without trapping.",type:"b",default:!1},outFile:{category:"Output",description:"Specifies the WebAssembly output file (.wasm).",type:"s",alias:"o",isPath:!0},textFile:{category:"Output",description:"Specifies the WebAssembly text output file (.wat).",type:"s",alias:"t",isPath:!0},bindings:{category:"Output",description:["Specifies the bindings to generate (.js + .d.ts).","","  esm  JavaScript bindings & typings for ESM integration.","  raw  Like esm, but exports just the instantiate function.","       Useful where modules are meant to be instantiated","       multiple times or non-ESM imports must be provided."],type:"S",alias:"b"},sourceMap:{category:"Debugging",description:["Enables source map generation. Optionally takes the URL","used to reference the source map from the binary file."],type:"s"},uncheckedBehavior:{category:"Debugging",description:["Changes the behavior of unchecked() expressions.","Using this option can potentially cause breakage.","","  default  The default behavior: unchecked operations are","           only used inside of unchecked().","  never    Unchecked operations are never used, even when","           inside of unchecked().","  always   Unchecked operations are always used if possible,","           whether or not unchecked() is used."],type:"s",default:"default"},debug:{category:"Debugging",description:"Enables debug information in emitted binaries.",type:"b",default:!1},importMemory:{category:"Features",description:"Imports the memory from 'env.memory'.",type:"b",default:!1},noExportMemory:{category:"Features",description:"Does not export the memory as 'memory'.",type:"b",default:!1},initialMemory:{category:"Features",description:"Sets the initial memory size in pages.",type:"i",default:0},maximumMemory:{category:"Features",description:"Sets the maximum memory size in pages.",type:"i",default:0},sharedMemory:{category:"Features",description:"Declare memory as shared. Requires maximumMemory.",type:"b",default:!1},zeroFilledMemory:{category:"Features",description:"Assume imported memory is zeroed. Requires importMemory.",type:"b",default:!1},importTable:{category:"Features",description:"Imports the function table from 'env.table'.",type:"b",default:!1},exportTable:{category:"Features",description:"Exports the function table as 'table'.",type:"b",default:!1},exportStart:{category:"Features",description:["Exports the start function using the specified name instead","of calling it implicitly. Useful to obtain the exported memory","before executing any code accessing it."],type:"s"},runtime:{category:"Features",description:["Specifies the runtime variant to include in the program.",""," incremental  TLSF + incremental GC (default)"," minimal      TLSF + lightweight GC invoked externally"," stub         Minimal runtime stub (never frees)"," ...          Path to a custom runtime implementation",""],type:"s",default:"incremental"},exportRuntime:{category:"Features",description:["Always exports the runtime helpers (__new, __collect, __pin etc.).","Automatically determined when generation of --bindings is enabled."],type:"b",default:!1},stackSize:{category:"Features",description:["Overrides the stack size. Only relevant for incremental GC","or when using a custom runtime that requires stack space.","Defaults to 0 without and to 32768 with incremental GC."],default:0,type:"i"},enable:{category:"Features",description:["Enables WebAssembly features being disabled by default.",""," threads             Threading and atomic operations."," simd                SIMD types and operations."," reference-types     Reference types and operations."," gc                  Garbage collection (WIP)."," stringref           String reference types."," relaxed-simd        Relaxed SIMD operations.",""],TODO_doesNothingYet:[" exception-handling  Exception handling."," tail-calls          Tail call operations."," multi-value         Multi value types."," memory64            Memory64 operations."," extended-const      Extended const expressions."],type:"S",mutuallyExclusive:"disable"},disable:{category:"Features",description:["Disables WebAssembly features being enabled by default.",""," mutable-globals     Mutable global imports and exports."," sign-extension      Sign-extension operations"," nontrapping-f2i     Non-trapping float to integer ops."," bulk-memory         Bulk memory operations.",""],type:"S",mutuallyExclusive:"enable"},use:{category:"Features",description:["Aliases a global object under another name, e.g., to switch","the default 'Math' implementation used: --use Math=JSMath","Can also be used to introduce an integer constant."],type:"S",alias:"u"},lowMemoryLimit:{category:"Features",description:"Enforces very low (<64k) memory constraints.",default:0,type:"i"},memoryBase:{category:"Linking",description:"Sets the start offset of emitted memory segments.",type:"i",default:0},tableBase:{category:"Linking",description:"Sets the start offset of emitted table elements.",type:"i",default:0},transform:{category:"API",description:"Specifies the path to a custom transform to load.",type:"S",isPath:!0,useNodeResolution:!0},trapMode:{category:"Binaryen",description:["Sets the trap mode to use.",""," allow  Allow trapping operations. This is the default."," clamp  Replace trapping operations with clamping semantics."," js     Replace trapping operations with JS semantics.",""],type:"s",default:"allow"},runPasses:{category:"Binaryen",description:["Specifies additional Binaryen passes to run after other","optimizations, if any. See: Binaryen/src/passes/pass.cpp"],type:"s"},noValidate:{category:"Binaryen",description:"Skips validating the module using Binaryen.",type:"b",default:!1},baseDir:{description:"Specifies the base directory of input and output files.",type:"s",default:"."},noColors:{description:"Disables terminal colors.",type:"b",default:!1},noUnsafe:{description:["Disallows the use of unsafe features in user code.","Does not affect library files and external modules."],type:"b",default:!1},disableWarning:{description:["Disables warnings matching the given diagnostic code.","If no diagnostic code is given, all warnings are disabled."],type:"I"},noEmit:{description:"Performs compilation as usual but does not emit code.",type:"b",default:!1},showConfig:{description:"Print computed compiler options and exit.",type:"b",default:!1},stats:{description:"Prints statistics on I/O and compile times.",type:"b",default:!1},pedantic:{description:"Make yourself sad for no good reason.",type:"b",default:!1},lib:{description:["Adds one or multiple paths to custom library components and","uses exports of all top-level files at this path as globals."],type:"S",isPath:!0},path:{description:["Adds one or multiple paths to package resolution, similar","to node_modules. Prefers an 'ascMain' entry in a package's","package.json and falls back to an inner 'assembly/' folder."],type:"S",isPath:!0},wasm:{description:"Uses the specified Wasm binary of the compiler.",type:"s"}," ...":{description:"Specifies node.js options (CLI only). See: node --help"},"-Os":{value:{optimizeLevel:0,shrinkLevel:1}},"-Oz":{value:{optimizeLevel:0,shrinkLevel:2}},"-O0":{value:{optimizeLevel:0,shrinkLevel:0}},"-O1":{value:{optimizeLevel:1,shrinkLevel:0}},"-O2":{value:{optimizeLevel:2,shrinkLevel:0}},"-O3":{value:{optimizeLevel:3,shrinkLevel:0}},"-O0s":{value:{optimizeLevel:0,shrinkLevel:1}},"-O1s":{value:{optimizeLevel:1,shrinkLevel:1}},"-O2s":{value:{optimizeLevel:2,shrinkLevel:1}},"-O3s":{value:{optimizeLevel:3,shrinkLevel:1}},"-O0z":{value:{optimizeLevel:0,shrinkLevel:2}},"-O1z":{value:{optimizeLevel:1,shrinkLevel:2}},"-O2z":{value:{optimizeLevel:2,shrinkLevel:2}},"-O3z":{value:{optimizeLevel:3,shrinkLevel:2}},"-Ospeed":{value:{optimizeLevel:3,shrinkLevel:0}},"-Osize":{value:{optimizeLevel:0,shrinkLevel:2,converge:!0}},"--measure":{value:{stats:!0}}},Ee="~lib/",Ae={array:`/// <reference path="./rt/index.d.ts" />
+var se=Object.defineProperty;var Ne=Object.getOwnPropertyDescriptor;var Ue=Object.getOwnPropertyNames;var Me=Object.prototype.hasOwnProperty;var fn=(e,t)=>()=>(e&&(t=e(e=0)),t);var Q=(e,t)=>{for(var n in t)se(e,n,{get:t[n],enumerable:!0})},ae=(e,t,n,a)=>{if(t&&typeof t=="object"||typeof t=="function")for(let s of Ue(t))!Me.call(e,s)&&s!==n&&se(e,s,{get:()=>t[s],enumerable:!(a=Ne(t,s))||a.enumerable});return e},Dn=(e,t,n)=>(ae(e,t,"default"),n&&ae(n,t,"default"));var le={};Q(le,{promises:()=>Pe});var Pe,ue=fn(()=>{"use strict";Pe={}});var fe={};Q(fe,{createRequire:()=>Ve});function Ve(){return function(t){throw new Error(`Cannot find module: '${t}'`)}}var ce=fn(()=>{"use strict"});var On={};Q(On,{argv:()=>Xe,cwd:()=>In,exit:()=>He,hrtime:()=>qe,platform:()=>je,umask:()=>Ge});function In(){return"."}function Ge(){return 0}function He(e=0){throw Error(`exit ${e}`)}function qe(e){var t=Ke.call(de),n=Math.floor(t*.001),a=Math.floor(t*1e6-n*1e9);return e&&(n-=e[0],a-=e[1],a<0&&(n--,a+=1e9)),[n,a]}var je,Xe,de,Ke,Ln=fn(()=>{"use strict";je="linux";Xe=[];de=globalThis.performance||{},Ke=de.now||function(){return new Date().getTime()}});var Rn={};Q(Rn,{basename:()=>Qe,delimiter:()=>it,dirname:()=>Je,extname:()=>nt,format:()=>et,isAbsolute:()=>Ye,join:()=>Ze,normalize:()=>pe,parse:()=>tt,relative:()=>$e,resolve:()=>cn,sep:()=>kn,win32:()=>rt});function V(e){if(typeof e!="string")throw new TypeError("Path must be a string. Received "+JSON.stringify(e))}function xe(e,t){for(var n="",a=0,s=-1,r=0,u,f=0;f<=e.length;++f){if(f<e.length)u=e.charCodeAt(f);else{if(u===47)break;u=47}if(u===47){if(!(s===f-1||r===1))if(s!==f-1&&r===2){if(n.length<2||a!==2||n.charCodeAt(n.length-1)!==46||n.charCodeAt(n.length-2)!==46){if(n.length>2){var p=n.lastIndexOf("/");if(p!==n.length-1){p===-1?(n="",a=0):(n=n.slice(0,p),a=n.length-1-n.lastIndexOf("/")),s=f,r=0;continue}}else if(n.length===2||n.length===1){n="",a=0,s=f,r=0;continue}}t&&(n.length>0?n+="/..":n="..",a=2)}else n.length>0?n+="/"+e.slice(s+1,f):n=e.slice(s+1,f),a=f-s-1;s=f,r=0}else u===46&&r!==-1?++r:r=-1}return n}function We(e,t){var n=t.dir||t.root,a=t.base||(t.name||"")+(t.ext||"");return n?n===t.root?n+a:n+e+a:a}function cn(){for(var e="",t=!1,n,a=arguments.length-1;a>=-1&&!t;a--){var s;a>=0?s=arguments[a]:(n===void 0&&(n=In()),s=n),V(s),s.length!==0&&(e=s+"/"+e,t=s.charCodeAt(0)===47)}return e=xe(e,!t),t?e.length>0?"/"+e:"/":e.length>0?e:"."}function pe(e){if(V(e),e.length===0)return".";var t=e.charCodeAt(0)===47,n=e.charCodeAt(e.length-1)===47;return e=xe(e,!t),e.length===0&&!t&&(e="."),e.length>0&&n&&(e+="/"),t?"/"+e:e}function Ye(e){return V(e),e.length>0&&e.charCodeAt(0)===47}function Ze(){if(arguments.length===0)return".";for(var e,t=0;t<arguments.length;++t){var n=arguments[t];V(n),n.length>0&&(e===void 0?e=n:e+="/"+n)}return e===void 0?".":pe(e)}function $e(e,t){if(V(e),V(t),e===t||(e=cn(e),t=cn(t),e===t))return"";if(e===".")return t;for(var n=1;n<e.length&&e.charCodeAt(n)===47;++n);for(var a=e.length,s=a-n,r=1;r<t.length&&t.charCodeAt(r)===47;++r);for(var u=t.length,f=u-r,p=s<f?s:f,b=-1,d=0;d<=p;++d){if(d===p){if(f>p){if(t.charCodeAt(r+d)===47)return t.slice(r+d+1);if(d===0)return t.slice(r+d)}else s>p&&(e.charCodeAt(n+d)===47?b=d:d===0&&(b=0));break}var g=e.charCodeAt(n+d),y=t.charCodeAt(r+d);if(g!==y)break;g===47&&(b=d)}var m="";for(d=n+b+1;d<=a;++d)(d===a||e.charCodeAt(d)===47)&&(m.length===0?m+="..":m+="/..");return m.length>0?m+t.slice(r+b):(r+=b,t.charCodeAt(r)===47&&++r,t.slice(r))}function Je(e){if(V(e),e.length===0)return".";for(var t=e.charCodeAt(0),n=t===47,a=-1,s=!0,r=e.length-1;r>=1;--r)if(t=e.charCodeAt(r),t===47){if(!s){a=r;break}}else s=!1;return a===-1?n?"/":".":n&&a===1?"//":e.slice(0,a)}function Qe(e,t){if(t!==void 0&&typeof t!="string")throw new TypeError('"ext" argument must be a string');V(e);var n=0,a=-1,s=!0,r;if(t!==void 0&&t.length>0&&t.length<=e.length){if(t.length===e.length&&t===e)return"";var u=t.length-1,f=-1;for(r=e.length-1;r>=0;--r){var p=e.charCodeAt(r);if(p===47){if(!s){n=r+1;break}}else f===-1&&(s=!1,f=r+1),u>=0&&(p===t.charCodeAt(u)?--u===-1&&(a=r):(u=-1,a=f))}return n===a?a=f:a===-1&&(a=e.length),e.slice(n,a)}else{for(r=e.length-1;r>=0;--r)if(e.charCodeAt(r)===47){if(!s){n=r+1;break}}else a===-1&&(s=!1,a=r+1);return a===-1?"":e.slice(n,a)}}function nt(e){V(e);for(var t=-1,n=0,a=-1,s=!0,r=0,u=e.length-1;u>=0;--u){var f=e.charCodeAt(u);if(f===47){if(!s){n=u+1;break}continue}a===-1&&(s=!1,a=u+1),f===46?t===-1?t=u:r!==1&&(r=1):t!==-1&&(r=-1)}return t===-1||a===-1||r===0||r===1&&t===a-1&&t===n+1?"":e.slice(t,a)}function et(e){if(e===null||typeof e!="object")throw new TypeError('The "pathObject" argument must be of type Object. Received type '+typeof e);return We("/",e)}function tt(e){V(e);var t={root:"",dir:"",base:"",ext:"",name:""};if(e.length===0)return t;var n=e.charCodeAt(0),a=n===47,s;a?(t.root="/",s=1):s=0;for(var r=-1,u=0,f=-1,p=!0,b=e.length-1,d=0;b>=s;--b){if(n=e.charCodeAt(b),n===47){if(!p){u=b+1;break}continue}f===-1&&(p=!1,f=b+1),n===46?r===-1?r=b:d!==1&&(d=1):r!==-1&&(d=-1)}return r===-1||f===-1||d===0||d===1&&r===f-1&&r===u+1?f!==-1&&(u===0&&a?t.base=t.name=e.slice(1,f):t.base=t.name=e.slice(u,f)):(u===0&&a?(t.name=e.slice(1,r),t.base=e.slice(1,f)):(t.name=e.slice(u,r),t.base=e.slice(u,f)),t.ext=e.slice(r,f)),u>0?t.dir=e.slice(0,u-1):a&&(t.dir="/"),t}var kn,it,rt,Nn=fn(()=>{"use strict";Ln();kn="/",it=":",rt=null});var he={};Q(he,{pathToFileURL:()=>at});function ot(e){return e.replace(/%/g,"%25").replace(/\\/g,"%5C").replace(/\n/g,"%0A").replace(/\r/g,"%0D").replace(/\t/g,"%09")}function at(e){let t=cn(e);e.charCodeAt(e.length-1)===47&&t[t.length-1]!==kn&&(t+="/");let n=new URL("file://");return n.pathname=ot(t),n}var ge=fn(()=>{"use strict";Nn()});var Wn={};Q(Wn,{Stats:()=>Cn,checkDiagnostics:()=>gn,compileString:()=>wt,configToArguments:()=>qn,createMemoryStream:()=>Hn,default:()=>Wn,defaultOptimizeLevel:()=>Be,defaultShrinkLevel:()=>we,definitionFiles:()=>Bt,libraryFiles:()=>X,libraryPrefix:()=>P,main:()=>Se,options:()=>zt,tscOptions:()=>St,version:()=>Xn});var st=Object.prototype.toString.call(typeof globalThis.process<"u"?globalThis.process:0)==="[object process]",G,sn,v,M,dn;st?(G=await import("fs"),sn=await import("module"),v=await import("path"),M=globalThis.process,dn=await import("url")):(G=await Promise.resolve().then(()=>(ue(),le)),sn=await Promise.resolve().then(()=>(ce(),fe)),v=await Promise.resolve().then(()=>(Nn(),Rn)),M=await Promise.resolve().then(()=>(Ln(),On)),dn=await Promise.resolve().then(()=>(ge(),he)));var An=typeof process<"u"&&process||{},lt=An.env&&"CI"in An.env,ut="\x1B[90m",ft="\x1B[91m",ct="\x1B[92m",dt="\x1B[93m",xt="\x1B[94m",pt="\x1B[95m",ht="\x1B[96m",gt="\x1B[97m",W="\x1B[0m",nn=class{constructor(t){this.stream=t,this.enabled=!!(this.stream&&this.stream.isTTY||lt)}gray(t){return this.enabled?ut+t+W:t}red(t){return this.enabled?ft+t+W:t}green(t){return this.enabled?ct+t+W:t}yellow(t){return this.enabled?dt+t+W:t}blue(t){return this.enabled?xt+t+W:t}magenta(t){return this.enabled?pt+t+W:t}cyan(t){return this.enabled?ht+t+W:t}white(t){return this.enabled?gt+t+W:t}},_n=new nn(An.stdout),Ot=new nn(An.stderr);function mt(e){for(var t=0,n=0,a=e.length;n<a;++n){let s=e.charCodeAt(n);s<128?t+=1:s<2048?t+=2:(s&64512)===55296&&n+1<a&&(e.charCodeAt(n+1)&64512)===56320?(++n,t+=4):t+=3}return t}function bt(e,t,n){var a=n-t;if(a<1)return"";for(var s=null,r=[],u=0,f;t<n;)f=e[t++],f<128?r[u++]=f:f>191&&f<224?r[u++]=(f&31)<<6|e[t++]&63:f>239&&f<365?(f=((f&7)<<18|(e[t++]&63)<<12|(e[t++]&63)<<6|e[t++]&63)-65536,r[u++]=55296+(f>>10),r[u++]=56320+(f&1023)):r[u++]=(f&15)<<12|(e[t++]&63)<<6|e[t++]&63,u>=8192&&((s||(s=[])).push(String.fromCharCode(...r)),u=0);return s?(u&&s.push(String.fromCharCode(...r.slice(0,u))),s.join("")):String.fromCharCode(...r.slice(0,u))}function yt(e,t,n){for(var a=n,s=0,r=e.length;s<r;++s){let u=e.charCodeAt(s),f;u<128?t[n++]=u:u<2048?(t[n++]=u>>6|192,t[n++]=u&63|128):(u&64512)===55296&&s+1<r&&((f=e.charCodeAt(s+1))&64512)===56320?(u=65536+((u&1023)<<10)+(f&1023),++s,t[n++]=u>>18|240,t[n++]=u>>12&63|128,t[n++]=u>>6&63|128,t[n++]=u&63|128):(t[n++]=u>>12|224,t[n++]=u>>6&63|128,t[n++]=u&63|128)}return n-a}var Tn={length:mt,read:bt,write:yt};var me=sn.createRequire(import.meta.url);function ye(e,t,n=!0){var a={},s=[],r=[],u=[],f={};Object.keys(t).forEach(d=>{if(!d.startsWith(" ")){var g=t[d];g.alias!=null&&(typeof g.alias=="string"?f[g.alias]=d:Array.isArray(g.alias)&&g.alias.forEach(y=>f[y]=d)),n&&g.default!=null&&(a[d]=g.default)}});for(var p=0,b=(e=e.slice()).length;p<b;++p){let d=e[p];if(d=="--"){++p;break}let g=/^(?:(-\w)(?:=(.*))?|(--\w{2,})(?:=(.*))?)$/.exec(d),y,m;if(g)t[d]?y=t[m=d]:g[1]!=null?(y=t[m=f[g[1].substring(1)]],y&&g[2]!=null&&(e[p--]=g[2])):g[3]!=null&&(y=t[m=g[3].substring(2)],y&&g[4]!=null&&(e[p--]=g[4]));else if(d.charCodeAt(0)==45)y=t[m=d];else{r.push(d);continue}if(y)if(y.value)Object.keys(y.value).forEach(i=>a[i]=y.value[i]);else if(y.type==null||y.type==="b")a[m]=!0;else if(p+1<e.length&&e[p+1].charCodeAt(0)!=45)switch(y.type){case"i":a[m]=parseInt(e[++p],10);break;case"I":a[m]=(a[m]||[]).concat(parseInt(e[++p],10));break;case"f":a[m]=parseFloat(e[++p]);break;case"F":a[m]=(a[m]||[]).concat(parseFloat(e[++p]));break;case"s":a[m]=String(e[++p]);break;case"S":a[m]=(a[m]||[]).concat(e[++p].split(","));break;default:s.push(d),--p}else switch(y.type){case"i":case"f":a[m]=y.default||0;break;case"s":a[m]=y.default||"";break;case"I":case"F":case"S":a[m]=y.default||[];break;default:s.push(d)}else s.push(d)}for(;p<b;)u.push(e[p++]);return n&&Mn(t,a),{options:a,unknown:s,arguments:r,trailing:u}}function Fe(e,t){t||(t={});var n=t.indent||2,a=t.padding||24,s=t.eol||`
+`,r={},u=[];Object.keys(e).forEach(b=>{var d=e[b];if(d.description!=null){for(var g="";g.length<n;)g+=" ";for(g+="--"+b,d.alias&&(g+=", -"+d.alias);g.length<a;)g+=" ";var y;!t.noCategories&&d.category?(y=r[d.category])||(r[d.category]=y=[]):y=u,Array.isArray(d.description)?y.push(g+d.description[0]+d.description.slice(1).map(m=>{for(let i=0;i<a;++i)m=" "+m;return s+m}).join("")):y.push(g+d.description)}});var f=[],p=!1;return Object.keys(r).forEach(b=>{p=!0,f.push(s+" "+_n.gray(b)+s),f.push(r[b].join(s))}),p&&u.length&&f.push(s+" "+_n.gray("Other")+s),f.push(u.join(s)),f.join(s)}function be(e,t){if(e!=null)switch(t){case void 0:case"b":return!!e;case"i":return Math.trunc(e)||0;case"f":return Number(e)||0;case"s":return e===!0?"":e===!1?null:String(e);case"I":return Array.isArray(e)||(e=[e]),e.map(n=>Math.trunc(n)||0);case"F":return Array.isArray(e)||(e=[e]),e.map(n=>Number(n)||0);case"S":return Array.isArray(e)||(e=[e]),e.map(String)}}function Un(e,t,n,a){let s={};for(let[r,{type:u,mutuallyExclusive:f,isPath:p,useNodeResolution:b,cliOnly:d}]of Object.entries(e)){let g=be(t[r],u),y=be(n[r],u);if(g==null){if(y!=null){if(d)continue;if(Array.isArray(y)){let m;p&&(y=y.map(i=>en(i,a,b))),f!=null&&(m=t[f])?s[r]=y.filter(i=>!m.includes(i)):s[r]=y.slice()}else p&&(y=en(y,a,b)),s[r]=y}}else if(y==null)Array.isArray(g)?s[r]=g.slice():s[r]=g;else if(Array.isArray(g)){if(d){s[r]=g.slice();continue}let m;p&&(y=y.map(i=>en(i,a,b))),f!=null&&(m=t[f])?s[r]=[...g,...y.filter(i=>!g.includes(i)&&!m.includes(i))]:s[r]=[...g,...y.filter(i=>!g.includes(i))]}else s[r]=g}return s}function Ft(e){let t=v.parse(e);return t.root||(t.root="./"),v.format(t)}function en(e,t,n=!1){return v.isAbsolute(e)?e:n&&!e.startsWith(".")&&me.resolve?me.resolve(e,{paths:[t]}):Ft(v.join(t,e))}function Mn(e,t){for(let[n,{default:a}]of Object.entries(e))t[n]==null&&a!=null&&(t[n]=a)}var ve="0.1.6",Y={version:{category:"General",description:"Prints just the compiler's version and exits.",type:"b",alias:"v"},help:{category:"General",description:"Prints this message and exits.",type:"b",alias:"h"},config:{category:"General",description:"Configuration file to apply. CLI arguments take precedence.",type:"s",cliOnly:!0},target:{category:"General",description:"Configuration file target to use. Defaults to 'release'.",type:"s",cliOnly:!0},optimize:{category:"Optimization",description:["Optimizes the module. Typical shorthands are:",""," Default optimizations   -O"," Make a release build    -O --noAssert"," Make a debug build      --debug"," Optimize for speed      -Ospeed"," Optimize for size       -Osize",""],type:"b",alias:"O"},optimizeLevel:{category:"Optimization",description:"How much to focus on optimizing code. [0-3]",type:"i"},shrinkLevel:{category:"Optimization",description:"How much to focus on shrinking code size. [0-2, s=1, z=2]",type:"i"},converge:{category:"Optimization",description:"Re-optimizes until no further improvements can be made.",type:"b",default:!1},noAssert:{category:"Optimization",description:"Replaces assertions with just their value without trapping.",type:"b",default:!1},outFile:{category:"Output",description:"Specifies the WebAssembly output file (.wasm).",type:"s",alias:"o",isPath:!0},textFile:{category:"Output",description:"Specifies the WebAssembly text output file (.wat).",type:"s",alias:"t",isPath:!0},bindings:{category:"Output",description:["Specifies the bindings to generate (.js + .d.ts).","","  esm  JavaScript bindings & typings for ESM integration.","  raw  Like esm, but exports just the instantiate function.","       Useful where modules are meant to be instantiated","       multiple times or non-ESM imports must be provided."],type:"S",alias:"b"},sourceMap:{category:"Debugging",description:["Enables source map generation. Optionally takes the URL","used to reference the source map from the binary file."],type:"s"},uncheckedBehavior:{category:"Debugging",description:["Changes the behavior of unchecked() expressions.","Using this option can potentially cause breakage.","","  default  The default behavior: unchecked operations are","           only used inside of unchecked().","  never    Unchecked operations are never used, even when","           inside of unchecked().","  always   Unchecked operations are always used if possible,","           whether or not unchecked() is used."],type:"s",default:"default"},debug:{category:"Debugging",description:"Enables debug information in emitted binaries.",type:"b",default:!1},importMemory:{category:"Features",description:"Imports the memory from 'env.memory'.",type:"b",default:!1},noExportMemory:{category:"Features",description:"Does not export the memory as 'memory'.",type:"b",default:!1},initialMemory:{category:"Features",description:"Sets the initial memory size in pages.",type:"i",default:0},maximumMemory:{category:"Features",description:"Sets the maximum memory size in pages.",type:"i",default:0},sharedMemory:{category:"Features",description:"Declare memory as shared. Requires maximumMemory.",type:"b",default:!1},zeroFilledMemory:{category:"Features",description:"Assume imported memory is zeroed. Requires importMemory.",type:"b",default:!1},importTable:{category:"Features",description:"Imports the function table from 'env.table'.",type:"b",default:!1},exportTable:{category:"Features",description:"Exports the function table as 'table'.",type:"b",default:!1},exportStart:{category:"Features",description:["Exports the start function using the specified name instead","of calling it implicitly. Useful to obtain the exported memory","before executing any code accessing it."],type:"s"},runtime:{category:"Features",description:["Specifies the runtime variant to include in the program.",""," incremental  TLSF + incremental GC (default)"," minimal      TLSF + lightweight GC invoked externally"," stub         Minimal runtime stub (never frees)"," ...          Path to a custom runtime implementation",""],type:"s",default:"incremental"},exportRuntime:{category:"Features",description:["Always exports the runtime helpers (__new, __collect, __pin etc.).","Automatically determined when generation of --bindings is enabled."],type:"b",default:!1},stackSize:{category:"Features",description:["Overrides the stack size. Only relevant for incremental GC","or when using a custom runtime that requires stack space.","Defaults to 0 without and to 32768 with incremental GC."],default:0,type:"i"},enable:{category:"Features",description:["Enables WebAssembly features being disabled by default.",""," threads             Threading and atomic operations."," simd                SIMD types and operations."," reference-types     Reference types and operations."," gc                  Garbage collection (WIP)."," stringref           String reference types."," relaxed-simd        Relaxed SIMD operations.",""],TODO_doesNothingYet:[" exception-handling  Exception handling."," tail-calls          Tail call operations."," multi-value         Multi value types."," memory64            Memory64 operations."," extended-const      Extended const expressions."],type:"S",mutuallyExclusive:"disable"},disable:{category:"Features",description:["Disables WebAssembly features being enabled by default.",""," mutable-globals     Mutable global imports and exports."," sign-extension      Sign-extension operations"," nontrapping-f2i     Non-trapping float to integer ops."," bulk-memory         Bulk memory operations.",""],type:"S",mutuallyExclusive:"enable"},use:{category:"Features",description:["Aliases a global object under another name, e.g., to switch","the default 'Math' implementation used: --use Math=JSMath","Can also be used to introduce an integer constant."],type:"S",alias:"u"},lowMemoryLimit:{category:"Features",description:"Enforces very low (<64k) memory constraints.",default:0,type:"i"},memoryBase:{category:"Linking",description:"Sets the start offset of emitted memory segments.",type:"i",default:0},tableBase:{category:"Linking",description:"Sets the start offset of emitted table elements.",type:"i",default:0},transform:{category:"API",description:"Specifies the path to a custom transform to load.",type:"S",isPath:!0,useNodeResolution:!0},trapMode:{category:"Binaryen",description:["Sets the trap mode to use.",""," allow  Allow trapping operations. This is the default."," clamp  Replace trapping operations with clamping semantics."," js     Replace trapping operations with JS semantics.",""],type:"s",default:"allow"},runPasses:{category:"Binaryen",description:["Specifies additional Binaryen passes to run after other","optimizations, if any. See: Binaryen/src/passes/pass.cpp"],type:"s"},noValidate:{category:"Binaryen",description:"Skips validating the module using Binaryen.",type:"b",default:!1},baseDir:{description:"Specifies the base directory of input and output files.",type:"s",default:"."},noColors:{description:"Disables terminal colors.",type:"b",default:!1},noUnsafe:{description:["Disallows the use of unsafe features in user code.","Does not affect library files and external modules."],type:"b",default:!1},disableWarning:{description:["Disables warnings matching the given diagnostic code.","If no diagnostic code is given, all warnings are disabled."],type:"I"},noEmit:{description:"Performs compilation as usual but does not emit code.",type:"b",default:!1},showConfig:{description:"Print computed compiler options and exit.",type:"b",default:!1},stats:{description:"Prints statistics on I/O and compile times.",type:"b",default:!1},pedantic:{description:"Make yourself sad for no good reason.",type:"b",default:!1},lib:{description:["Adds one or multiple paths to custom library components and","uses exports of all top-level files at this path as globals."],type:"S",isPath:!0},path:{description:["Adds one or multiple paths to package resolution, similar","to node_modules. Prefers an 'ascMain' entry in a package's","package.json and falls back to an inner 'assembly/' folder."],type:"S",isPath:!0},wasm:{description:"Uses the specified Wasm binary of the compiler.",type:"s"}," ...":{description:"Specifies node.js options (CLI only). See: node --help"},"-Os":{value:{optimizeLevel:0,shrinkLevel:1}},"-Oz":{value:{optimizeLevel:0,shrinkLevel:2}},"-O0":{value:{optimizeLevel:0,shrinkLevel:0}},"-O1":{value:{optimizeLevel:1,shrinkLevel:0}},"-O2":{value:{optimizeLevel:2,shrinkLevel:0}},"-O3":{value:{optimizeLevel:3,shrinkLevel:0}},"-O0s":{value:{optimizeLevel:0,shrinkLevel:1}},"-O1s":{value:{optimizeLevel:1,shrinkLevel:1}},"-O2s":{value:{optimizeLevel:2,shrinkLevel:1}},"-O3s":{value:{optimizeLevel:3,shrinkLevel:1}},"-O0z":{value:{optimizeLevel:0,shrinkLevel:2}},"-O1z":{value:{optimizeLevel:1,shrinkLevel:2}},"-O2z":{value:{optimizeLevel:2,shrinkLevel:2}},"-O3z":{value:{optimizeLevel:3,shrinkLevel:2}},"-Ospeed":{value:{optimizeLevel:3,shrinkLevel:0}},"-Osize":{value:{optimizeLevel:0,shrinkLevel:2,converge:!0}},"--measure":{value:{stats:!0}}},Ee="~lib/",Ae={array:`/// <reference path="./rt/index.d.ts" />
 
 import { BLOCK_MAXSIZE } from "./rt/common";
 import { Runtime } from "shared/runtime";
@@ -759,6 +759,3481 @@ export namespace Atomics {
     return size == 1 || size == 2 || size == 4;
   }
 }
+`,bignum:`// Big integer types (u128 / i128 / u256), implemented under ./bignum
+// (Apache-2.0; see ./bignum/LICENSE).
+//
+// This file is a top-level standard-library entry, so toilscript globalizes its
+// named re-exports the same way it does Array/Map/String. That makes u128, i128
+// and u256 usable with no import, as native types:
+//
+//     let a = u128.fromU64(40) + u128.fromU64(2);
+//     let b = u256.fromU128(a);
+//
+// The vendored sources are unmodified; only this thin globalizer is toilscript's.
+// i256 is the signed-256 backing type of the family (u128/i128 convert to it),
+// so it is globalized too for a self-consistent surface.
+
+export { u128 } from "./bignum/integer/u128";
+export { i128 } from "./bignum/integer/i128";
+export { u256 } from "./bignum/integer/u256";
+export { i256 } from "./bignum/integer/i256";
+`,"bignum/fixed/fp128":`import { i128 } from '../integer/i128';
+import { u128 } from '../integer/u128';
+
+// Support only this fractions:
+// fp128<u8>   =>   8 bits (~ 2  decimal digits)
+// fp128<u16>  =>  16 bits (~ 4  decimal digits)
+// fp128<u24>  =>  24 bits (~ 7  decimal digits)
+// fp128<u32>  =>  32 bits (~ 9  decimal digits)
+// fp128<u40>  =>  40 bits (~ 12 decimal digits)
+// fp128<u48>  =>  48 bits (~ 14 decimal digits)
+// fp128<u56>  =>  56 bits (~ 16 decimal digits)
+// fp128<u64>  =>  64 bits (~ 19 decimal digits)
+// fp128<u72>  =>  72 bits (~ 21 decimal digits)
+// fp128<u80>  =>  80 bits (~ 24 decimal digits)
+// fp128<u88>  =>  88 bits (~ 26 decimal digits)
+// fp128<u96>  =>  96 bits (~ 28 decimal digits)
+// fp128<u104> => 104 bits (~ 31 decimal digits)
+// fp128<u112> => 112 bits (~ 33 decimal digits)
+// fp128<u120> => 120 bits (~ 36 decimal digits)
+
+export class fp128<Q> {
+
+  static readonly Zero: fp128<Q> = new fp128<Q>(0);
+  static readonly One: fp128<Q> = new fp128<Q>(1);
+
+  protected value: i128 = i128.Zero;
+
+  constructor(lo: u64 = 0, hi: i64 = 0) {
+    this.value.lo = lo;
+    this.value.hi = hi;
+  }
+
+  @inline
+  get intBits(): i32 {
+    return 128 - this.fractBits;
+  }
+
+  @inline
+  get fractBits(): i32 {
+    if (isReference<Q>()) {
+      return 8 * offsetof<Q>();
+    } else {
+      return 8 * sizeof<Q>();
+    }
+  }
+
+  @inline
+  get int(): i128 {
+    return this.value >>> this.fractBits;
+  }
+
+  @inline
+  get fract(): u128 {
+    return (chagetype<u128>(this.value)) << this.intBits;
+  }
+
+  // TODO
+}
+`,"bignum/fixed/fp256":`import { i256 } from '../integer/i256';
+
+export class fp256<Q> {
+
+  constructor(public value: i256 = i256.Zero) {
+  }
+
+  // TODO
+}
+`,"bignum/fixed/index":`import { u128 } from "../integer/u128";
+import { fp128 } from "./fp128";
+import { fp256 } from "./fp256";
+import { u104, u112, u120, u136, u144, u152, u160, u24, u40, u48, u56, u72, u80, u88, u96, } from './types';
+
+export type fp128x8 = fp128<u8>;
+export type fp128x16 = fp128<u16>;
+export type fp128x24 = fp128<u24>;
+export type fp128x32 = fp128<u32>;
+export type fp128x40 = fp128<u40>;
+export type fp128x48 = fp128<u48>;
+export type fp128x56 = fp128<u56>;
+export type fp128x64 = fp128<u64>;
+export type fp128x72 = fp128<u72>;
+export type fp128x80 = fp128<u80>;
+
+export type fp256x8 = fp256<u8>;
+export type fp256x16 = fp256<u16>;
+export type fp256x24 = fp256<u24>;
+export type fp256x32 = fp256<u32>;
+export type fp256x40 = fp256<u40>;
+export type fp256x48 = fp256<u48>;
+export type fp256x56 = fp256<u56>;
+export type fp256x64 = fp256<u64>;
+export type fp256x72 = fp256<u72>;
+export type fp256x80 = fp256<u80>;
+export type fp256x88 = fp256<u88>;
+export type fp256x96 = fp256<u96>;
+export type fp256x104 = fp256<u104>;
+export type fp256x112 = fp256<u112>;
+export type fp256x120 = fp256<u120>;
+export type fp256x128 = fp256<u128>;
+export type fp256x136 = fp256<u136>;
+export type fp256x144 = fp256<u144>;
+export type fp256x152 = fp256<u152>;
+export type fp256x160 = fp256<u160>;
+
+export { fp128, fp256 };
+`,"bignum/fixed/safe/fp128":`export namespace safe {
+  // TODO
+}
+`,"bignum/fixed/safe/fp256":`export namespace safe {
+  // TODO
+}
+`,"bignum/fixed/types":`// u8
+// u16
+
+export class u24 {
+  private _0: u16
+  private _1: u8
+}
+
+// u32
+
+export class u40 {
+  private _0: u32
+  private _1: u8
+}
+
+export class u48 {
+  private _0: u32
+  private _1: u16
+}
+
+export class u56 {
+  private _0: u32
+  private _1: u24
+}
+
+// u64
+
+export class u72 {
+  private _0: u64
+  private _1: u8
+}
+
+export class u80 {
+  private _0: u64
+  private _1: u16
+}
+
+export class u88 {
+  private _0: u64
+  private _1: u24
+}
+
+export class u96 {
+  private _0: u64
+  private _1: u32
+}
+
+export class u104 {
+  private _0: u64
+  private _1: u40
+}
+
+export class u112 {
+  private _0: u64
+  private _1: u48
+}
+
+export class u120 {
+  private _0: u112
+  private _1: u8
+}
+
+// u128
+
+export class u136 {
+  private _0: u120
+  private _1: u16
+}
+
+export class u144 {
+  private _0: u136
+  private _1: u8
+}
+
+export class u152 {
+  private _0: u144
+  private _1: u8
+}
+
+export class u160 {
+  private _0: u152
+  private _1: u8
+}
+
+export class u168 {
+  private _0: u160
+  private _1: u8
+}
+
+export class u176 {
+  private _0: u168
+  private _1: u8
+}
+
+export class u184 {
+  private _0: u176
+  private _1: u8
+}
+
+export class u192 {
+  private _0: u184
+  private _1: u8
+}
+`,"bignum/globals":`import { u128, u256 } from "./integer";
+
+@lazy export var __divmod_quot_hi: u64 = 0;
+@lazy export var __divmod_rem_lo: u64 = 0;
+@lazy export var __divmod_rem_hi: u64 = 0;
+
+// used for returning low and high part of __mulq64, __multi3 etc
+@lazy export var __res128_hi: u64 = 0;
+
+// used for returning 0 or 1
+@lazy export var __carry: u64 = 0;
+@lazy export var __u256carry: u64 = 0;
+@lazy export var __u256carrySub: u64 = 0;
+
+/**
+ * Convert 128-bit unsigned integer to 64-bit float
+ * @param  lo lower  64-bit part of unsigned 128-bit integer
+ * @param  hi higher 64-bit part of unsigned 128-bit integer
+ * @return    64-bit float result
+ */
+// @ts-ignore: decorator
+@global
+export function __floatuntidf(lo: u64, hi: u64): f64 {
+  // __floatuntidf ported from LLVM sources
+  if (!(lo | hi)) return 0.0;
+
+  var v = new u128(lo, hi);
+  var sd = 128 - __clz128(lo, hi);
+  var e = sd - 1;
+
+  if (sd > 53) {
+    if (sd != 55) {
+      if (sd == 54) {
+        v = u128.shl(v, 1);
+      } else {
+        v = u128.or(
+          u128.shr(v, sd - 55),
+          u128.fromBool(u128.and(v, u128.shr(u128.Max, 128 + 55 - sd)).toBool())
+        );
+      }
+    }
+
+    v.lo |= (v.lo & 4) >> 2;
+    v.preInc();
+
+    v = u128.shr(v, 2);
+
+    if (v.lo & (1 << 53)) {
+      v = u128.shr(v, 1);
+      ++e;
+    }
+
+  } else {
+    v = u128.shl(v, 53 - sd);
+  }
+
+  var w: u64 = u128.shr(v, 32).lo & 0x000FFFFF;
+  var u: u64 = <u64>(((e + 1023) << 20) | w) << 32;
+  return reinterpret<f64>(u | (v.lo & 0xFFFFFFFF));
+}
+
+
+/**
+ * Adds two 64-bit unsigned integers \`a\` and \`b\` along with a carry-in value.
+ * Sets the global \`__carry2\` variable to indicate whether an overflow occurred.
+ * @param {u64} a - The first 64-bit unsigned integer.
+ * @param {u64} b - The second 64-bit unsigned integer.
+ * @param {u64} carryIn - Carry-in value (0 or 1).
+ * @returns {u64} - The 64-bit result of the addition.
+ */
+@inline
+export function add64Local(a: u64, b: u64, carryIn: u64): u64 {
+  let tmp = a + carryIn;
+  let carry = tmp < a ? 1 : 0;
+  let sum = tmp + b;
+  carry += sum < tmp ? 1 : 0;
+  __u256carry = carry;
+  return sum;
+}
+
+/**
+ * Subtracts the 64-bit unsigned integer \`b\` from \`a\` along with a borrow-in value.
+ * Sets the global \`__carry2\` variable to indicate whether a borrow occurred.
+ * @param {u64} a - The minuend (64-bit unsigned integer).
+ * @param {u64} b - The subtrahend (64-bit unsigned integer).
+ * @param {u64} borrowIn - Borrow-in value (0 or 1).
+ * @returns {u64} - The 64-bit result of the subtraction.
+ */
+@inline
+export function sub64(a: u64, b: u64, borrowIn: u64): u64 {
+  let tmp = a - b;
+  let borrow = tmp > a ? 1 : 0;
+  let diff = tmp - borrowIn;
+  borrow += diff > tmp ? 1 : 0;
+  __u256carrySub = borrow;
+  return diff;
+}
+
+// @ts-ignore: decorator
+@global
+export function __umulh64(a: u64, b: u64): u64 {
+  var u = a & 0xFFFFFFFF;
+  a >>= 32;
+  var v = b & 0xFFFFFFFF;
+  b >>= 32;
+
+  var uv = u * v;
+  uv = a * v + (uv >> 32);
+  var w0 = (u * b) + (uv & 0xFFFFFFFF);
+  return a * b + (uv >> 32) + (w0 >> 32);
+}
+
+// @ts-ignore: decorator
+@global
+export function __umulq64(a: u64, b: u64): u64 {
+  var u = a & 0xFFFFFFFF;
+  a >>= 32;
+  var v = b & 0xFFFFFFFF;
+  b >>= 32;
+
+  var uv = u * v;
+  var w0 = uv & 0xFFFFFFFF;
+  uv = a * v + (uv >>> 32);
+  var w1 = uv >>> 32;
+  uv = u * b + (uv & 0xFFFFFFFF);
+
+  __res128_hi = a * b + w1 + (uv >>> 32);
+  return (uv << 32) | w0;
+}
+
+// __umul64Hop computes (hi * 2^64 + lo) = z + (x * y)
+// @ts-ignore: decorator
+@inline
+export function __umul64Hop(z: u64, x: u64, y: u64): u64 {
+  var lo = __umulq64(x, y);
+  lo = __uadd64(lo, z);
+  var hi = __res128_hi + __carry;
+  __res128_hi = hi;
+  return lo
+}
+
+// __umul64Step computes (hi * 2^64 + lo) = z + (x * y) + carry.
+// @ts-ignore: decorator
+@inline
+export function __umul64Step(z: u64, x: u64, y: u64, carry: u64): u64 {
+  var lo = __umulq64(x, y)
+  lo = __uadd64(lo, carry);
+  var hi = __uadd64(__res128_hi, 0, __carry);
+  lo = __uadd64(lo, z);
+  hi += __carry;
+  __res128_hi = hi;
+  return lo
+}
+
+// __uadd64 returns the sum with carry of x, y and carry: sum = x + y + carry.
+// The carry input must be 0 or 1; otherwise the behavior is undefined.
+// The carryOut output is guaranteed to be 0 or 1.
+// @ts-ignore: decorator
+@inline
+export function __uadd64(x: u64, y: u64, carry: u64 = 0): u64 {
+  var sum = x + y + carry
+  // // The sum will overflow if both top bits are set (x & y) or if one of them
+  // // is (x | y), and a carry from the lower place happened. If such a carry
+  // // happens, the top bit will be 1 + 0 + 1 = 0 (& ~sum).
+  __carry = ((x & y) | ((x | y) & ~sum)) >>> 63
+  return sum;
+}
+
+// 64x64 => 128 bits
+@inline
+function mul64To128(x: u64, y: u64): u128 {
+  let lo = __umulq64(x, y);  // sets __res128_hi
+  let hi = __res128_hi;
+  return new u128(lo, hi);
+}
+
+/**
+ * A correct 256\xD7256 -> 256 multiply (mod 2^256).
+ * We do standard "schoolbook" multiplication for each 64-bit limb,
+ * skipping products that shift above 255 bits (they vanish mod 2^256).
+ */
+@global
+export function __mul256(
+  ax0: u64, ax1: u64, ax2: u64, ax3: u64,
+  bx0: u64, bx1: u64, bx2: u64, bx3: u64
+): u256 {
+  let result = new u256();
+  let a = [ax0, ax1, ax2, ax3];
+  let b = [bx0, bx1, bx2, bx3];
+
+  // For each (i,j), partial = a[i]*b[j], shift = 64*(i+j).
+  // If shift >= 256, that partial is 0 mod 2^256.
+  // Otherwise shift partial, add to result.
+  for (let i = 0; i < 4; i++) {
+    for (let j = 0; j < 4; j++) {
+      let shift = (i + j) << 6; // 64*(i+j)
+      if (shift >= 256) continue;
+      let p128 = mul64To128(a[i], b[j]); // 128-bit partial product
+      // convert to u256
+      let part = new u256(p128.lo, p128.hi, 0, 0);
+      // shift left by 'shift' bits
+      if (shift != 0) {
+        part = u256.shl(part, shift);
+      }
+      // add to accumulator
+      result = result + part;
+    }
+  }
+
+  return result;
+}
+
+// @ts-ignore: decorator
+@global
+export function __multi3(al: u64, ah: u64, bl: u64, bh: u64): u64 {
+  var u = al, v = bl;
+  var w: u64, k: u64;
+
+  var u1 = u & 0xFFFFFFFF;
+  u >>= 32;
+  var v1 = v & 0xFFFFFFFF;
+  v >>= 32;
+  var t = u1 * v1;
+  var w1 = t & 0xFFFFFFFF;
+
+  t = u * v1 + (t >> 32);
+  k = t & 0xFFFFFFFF;
+  w = t >> 32;
+  t = u1 * v + k;
+
+  var lo = (t << 32) | w1;
+  var hi = u * v + w;
+  hi += ah * bl;
+  hi += al * bh;
+  hi += t >> 32;
+
+  __res128_hi = hi;
+  return lo;
+}
+
+// @ts-ignore: decorator
+@global
+export function __floatuntfdi(value: f64): u64 {
+  var u = reinterpret<u64>(value);
+
+  // if (value < -1.7014118346046e38) { // -(2^127-1)
+  if (value < reinterpret<f64>(0xC7F0000000000000)) { // -(2^128-1)
+    // __float_u128_hi = <u64>-1; // for i128
+    __res128_hi = 0;
+    // overflow negative
+    return 0;
+    // } else if (value < -9.2233720368547e18) { // -2^63-1 // for i128
+  } else if (value < reinterpret<f64>(0xC3F0000000000000)) { // // -(2^64-1)
+    let lo: u64, hi: u64, m: u64;
+
+    m = (u & 0x000FFFFFFFFFFFFF) | (1 << 52);
+    u = (u & 0x7FFFFFFFFFFFFFFF) >> 52;
+
+    u -= 1075;
+    if (u > 64) {
+      lo = 0;
+      hi = m << (u - 64);
+    } else {
+      lo = m << u;
+      hi = m >> (64 - u);
+    }
+    // Convert to 2's complement for correct negative representation
+    lo = ~lo;
+    hi = ~hi;
+    lo += 1;
+    if (lo == 0) hi += 1; // carry to high part
+
+    __res128_hi = hi;
+    return lo;
+    // } else if (value < 9.2233720368547e18) { // 2^63-1 // for i128
+  } else if (value < reinterpret<f64>(0x43F0000000000000)) { // 2^64-1
+    // __float_u128_hi = (value < 0) ? -1 : 0; // for int
+    __res128_hi = 0;
+    // fit in a u64
+    return <u64>value;
+    // } else if (value < 1.7014118346046e38) {
+  } else if (value < reinterpret<f64>(0x47F0000000000000)) { // 2^128-1
+    let lo: u64, hi: u64, m: u64;
+
+    m = (u & 0x000FFFFFFFFFFFFF) | (1 << 52);
+    u = (u & 0x7FFFFFFFFFFFFFFF) >> 52;
+    u -= 1075;
+    if (u > 64) {
+      lo = 0;
+      hi = m << (u - 64);
+    } else {
+      lo = m << u;
+      hi = m >> (64 - u);
+    }
+    __res128_hi = hi;
+    return lo;
+  } else {
+    // overflow positive
+    __res128_hi = <u64>-1; // 0x7FFFFFFFFFFFFFFF for i128
+    return <u64>-1;
+  }
+}
+
+/**
+ * Count leading zeros in a 64-bit unsigned integer \`x\`, returning i32 in [0..64].
+ * If x == 0, returns 64.
+ */
+function clz64(x: u64): i32 {
+  if (x == 0) return 64;
+
+  let n: i32 = 0;
+  // Check high half [ bits 63..32 ]
+  if ((x & 0xFFFFFFFF00000000) == 0) {
+    n += 32;
+    x <<= 32; // shift left so next checks are for the upper bits
+  }
+  // Check bits [63..48]
+  if ((x & 0xFFFF000000000000) == 0) {
+    n += 16;
+    x <<= 16;
+  }
+  // Check bits [63..56]
+  if ((x & 0xFF00000000000000) == 0) {
+    n += 8;
+    x <<= 8;
+  }
+  // Check bits [63..60]
+  if ((x & 0xF000000000000000) == 0) {
+    n += 4;
+    x <<= 4;
+  }
+  // Check bits [63..62]
+  if ((x & 0xC000000000000000) == 0) {
+    n += 2;
+    x <<= 2;
+  }
+  // Check bit [63]
+  if ((x & 0x8000000000000000) == 0) {
+    n += 1;
+  }
+  return n;
+}
+
+/**
+ * Count trailing zeros in a 64-bit unsigned integer \`x\`, returning i32 in [0..64].
+ * If x == 0, returns 64.
+ */
+function ctz64(x: u64): i32 {
+  if (x == 0) return 64;
+
+  let n: i32 = 0;
+  // Check low half [bits 31..0]
+  if ((x & 0xFFFFFFFF) == 0) {
+    n += 32;
+    x >>= 32;
+  }
+  // Check bits [15..0]
+  if ((x & 0xFFFF) == 0) {
+    n += 16;
+    x >>= 16;
+  }
+  // Check bits [7..0]
+  if ((x & 0xFF) == 0) {
+    n += 8;
+    x >>= 8;
+  }
+  // Check bits [3..0]
+  if ((x & 0xF) == 0) {
+    n += 4;
+    x >>= 4;
+  }
+  // Check bits [1..0]
+  if ((x & 0x3) == 0) {
+    n += 2;
+    x >>= 2;
+  }
+  // Check bit [0]
+  if ((x & 0x1) == 0) {
+    n += 1;
+  }
+  return n;
+}
+
+/**
+ * Count leading zeros in a 128-bit integer [hi:lo], returning i32 in [0..128].
+ * If both hi and lo are 0, returns 128.
+ *
+ * hi is signed in i128, but we interpret it as unsigned here.
+ */
+// @ts-ignore: decorator
+@global @inline
+export function __clz128(lo: u64, hi: i64): i32 {
+  let h: u64 = <u64>hi;  // reinterpret hi as unsigned
+  if (h == 0) {
+    // If hi is 0, the leading zeros are "64 plus however many are in lo"
+    return 64 + <i32>i64.clz(lo);
+  } else {
+    // The top 64 bits are set => just measure their leading zeros
+    return <i32>i64.clz(h);
+  }
+}
+
+/**
+ * Count trailing zeros in a 128-bit integer [hi:lo], returning i32 in [0..128].
+ * If both hi and lo are 0, returns 128.
+ *
+ * For i128 we typically treat hi as signed, but ctz is purely bitwise, so we
+ * can pass it as u64 as well.
+ */
+// @ts-ignore: decorator
+@global @inline
+export function __ctz128(lo: u64, hi: u64): i32 {
+  if (lo == 0) {
+    // Otherwise, ctz is 64 plus ctz(hi)
+    return 64 + <i32>i64.ctz(hi);
+  } else {
+    // If the lower 64 bits are non-zero, measure ctz(lo)
+    return <i32>i64.ctz(lo);
+  }
+}
+
+// @ts-ignore: decorator
+@global
+export function __udivmod128(alo: u64, ahi: u64, blo: u64, bhi: u64): u64 {
+  var bzn = __clz128(blo, bhi); // N
+
+  // b == 0
+  if (bzn == 128) {
+    throw new RangeError("Division by zero"); // division by zero
+  }
+
+  // var azn = __clz128(alo, ahi); // M
+  var btz = __ctz128(blo, bhi); // N
+
+  // a == 0
+  if (!(alo | ahi)) {
+    __divmod_quot_hi = 0;
+    __divmod_rem_lo = 0;
+    __divmod_rem_hi = 0;
+    return 0;
+  }
+
+  // a / 1
+  if (bzn == 127) {
+    __divmod_quot_hi = ahi;
+    __divmod_rem_lo = 0;
+    __divmod_rem_hi = 0;
+    return alo;
+  }
+
+  // a == b
+  if (alo == blo && ahi == bhi) {
+    __divmod_quot_hi = 0;
+    __divmod_rem_lo = 0;
+    __divmod_rem_hi = 0;
+    return 1;
+  }
+
+  if (!(ahi | bhi)) {
+    __divmod_quot_hi = 0;
+    __divmod_rem_hi = 0;
+    // if \`b.lo\` is power of two
+    if (!(blo & (blo - 1))) {
+      __divmod_rem_lo = alo & (blo - 1);
+      return alo >> btz;
+    } else {
+      let dlo = alo / blo;
+      __divmod_rem_lo = alo - dlo * blo;
+      return dlo;
+    }
+  }
+  return __udivmod128core(alo, ahi, blo, bhi);
+}
+
+function __udivmod128core(alo: u64, ahi: u64, blo: u64, bhi: u64): u64 {
+  var r = new u128(alo, ahi);
+  var d = new u128(blo, bhi);
+  var q = new u128(0, 0);
+
+  // Standard division by shifting
+  var leadingZeros = __clz128(blo, bhi) - __clz128(alo, ahi);
+
+  if (leadingZeros < 0) {
+    __divmod_quot_hi = 0;
+    __divmod_rem_lo = alo;
+    __divmod_rem_hi = ahi;
+    return 0;
+  }
+
+  var dShift = u128.shl(d, leadingZeros);
+
+  for (let i = 0; i <= leadingZeros; i++) {
+    q = u128.shl(q, 1);
+    if (r >= dShift) {
+      r -= dShift;
+      q = u128.add(q, u128.One);
+    }
+    dShift = u128.shr(dShift, 1);
+  }
+
+  __divmod_quot_hi = q.hi;
+  __divmod_rem_lo = r.lo;
+  __divmod_rem_hi = r.hi;
+  return q.lo;
+}
+
+// @ts-ignore: decorator
+@global
+export function __udivmod128_10(lo: u64, hi: u64): u64 {
+  if (hi == 0) {
+    __divmod_quot_hi = 0;
+    let q = lo / 10;
+    __divmod_rem_lo = lo - (q * 10);
+    __divmod_rem_hi = 0;
+    return q;
+  }
+
+  // High part division
+  let q_hi = hi / 10;
+  let r_hi = hi - (q_hi * 10);
+
+  // Low part chunking to avoid 128-bit math
+  // r_hi becomes the high bits for the next division
+  let lo_hi = lo >>> 32;
+  let lo_lo = lo & 0xFFFFFFFF;
+
+  // Divide upper half of lo (plus carry from hi)
+  let t1 = (r_hi << 32) | lo_hi;
+  let q1 = t1 / 10;
+  let r1 = t1 - (q1 * 10);
+
+  // Divide lower half of lo (plus carry from above)
+  let t2 = (r1 << 32) | lo_lo;
+  let q2 = t2 / 10;
+  let r2 = t2 - (q2 * 10);
+
+  // Reassemble quotient
+  // q1 is known to fit in 32 bits because max t1 < 10 * 2^32
+  let q_lo = (q1 << 32) | q2;
+
+  __divmod_quot_hi = q_hi;
+  __divmod_rem_lo = r2;
+  __divmod_rem_hi = 0;
+
+  return q_lo;
+}
+`,"bignum/index":`export * from "./integer";
+`,"bignum/integer/i128":`import { u128 } from './u128';
+import { i256 } from './i256';
+import { u256 } from './u256';
+
+import { __clz128, __ctz128, } from '../globals';
+
+import { atou128 } from '../utils';
+
+/**
+ * 128-bit signed integer in two's complement representation.
+ * The \`hi\` field is signed, storing sign bits for negative values.
+ */
+export class i128 {
+
+  constructor(public lo: u64 = 0, public hi: i64 = 0) {
+  }
+
+  @inline static get Zero(): i128 {
+    return new i128();
+  }
+
+  @inline static get One(): i128 {
+    return new i128(1, 0);
+  }
+
+  @inline static get Min(): i128 {
+    return new i128(0, 0x8000000000000000);
+  }
+
+  @inline static get Max(): i128 {
+    return new i128(u64.MAX_VALUE, 0x7FFFFFFFFFFFFFFF);
+  }
+
+  // Construct from decimal or hex string
+  @inline
+  static fromString(value: string, radix: i32 = 10): i128 {
+    // If the string is prefixed with "-" we rely on atou128 + two\u2019s complement wrap
+    // in the final reinterpret.
+    return changetype<i128>(atou128(value, radix));
+  }
+
+  @inline
+  static fromI256(value: i256): i128 {
+    // Truncates top bits (value.hi1, value.hi2)
+    return new i128(value.lo1, value.lo2);
+  }
+
+  @inline
+  static fromU256(value: u256): i128 {
+    // Also truncation
+    return new i128(value.lo1, <i64>value.lo2);
+  }
+
+  @inline
+  static fromI128(value: i128): i128 {
+    return new i128(value.lo, value.hi);
+  }
+
+  @inline
+  static fromU128(value: u128): i128 {
+    return new i128(value.lo, <i64>value.hi);
+  }
+
+  @inline
+  static fromI64(value: i64): i128 {
+    return new i128(<u64>value, value >> 63);
+  }
+
+  @inline
+  static fromU64(value: u64): i128 {
+    return new i128(value, 0);
+  }
+
+  @inline
+  static fromF64(value: f64): i128 {
+    let i = <i64>value;         // convert f64 -> i64 (round/truncate)
+    return new i128(<u64>i, i >> 63);
+  }
+
+  @inline
+  static fromF32(value: f32): i128 {
+    let i = <i64>value;  // or <i32> then sign-extend
+    return new i128(<u64>i, i >> 63);
+  }
+
+  @inline
+  static fromI32(value: i32): i128 {
+    return new i128(<u64>value, <i64>(value >> 31));
+  }
+
+  @inline
+  static fromU32(value: u32): i128 {
+    return new i128(<u64>value, 0);
+  }
+
+  @inline
+  static fromBits(lo1: i32, lo2: i32, hi1: i32, hi2: i32): i128 {
+    let lo = ((<u64>lo2) << 32) | (<u64>(lo1) & 0xffffffff);
+    let hi = ((<i64>hi2) << 32) | (<i64>(hi1) & 0xffffffff);
+    return new i128(lo, hi);
+  }
+
+  @inline
+  static fromBytes<T>(array: T, bigEndian: bool = false): i128 {
+    if (array instanceof u8[]) {
+      return bigEndian
+        // @ts-ignore
+        ? i128.fromBytesBE(<u8[]>array)
+        : i128.fromBytesLE(<u8[]>array);
+    } else if (array instanceof Uint8Array) {
+      return bigEndian
+        ? i128.fromUint8ArrayBE(<Uint8Array>array)
+        : i128.fromUint8ArrayLE(<Uint8Array>array);
+    } else {
+      throw new TypeError("Unsupported generic type");
+    }
+  }
+
+  @inline
+  static fromBytesLE(array: u8[]): i128 {
+    return i128.fromUint8ArrayLE(changetype<Uint8Array>(array));
+  }
+
+  @inline
+  static fromBytesBE(array: u8[]): i128 {
+    return i128.fromUint8ArrayBE(changetype<Uint8Array>(array));
+  }
+
+  @inline
+  static fromUint8ArrayLE(array: Uint8Array): i128 {
+    assert(array.length && (array.length & 15) == 0);
+    let buffer = array.dataStart;
+    return new i128(
+      load<u64>(buffer, 0 * sizeof<u64>()),
+      load<u64>(buffer, 1 * sizeof<u64>())
+    );
+  }
+
+  static fromUint8ArrayBE(array: Uint8Array): i128 {
+    assert(array.length && (array.length & 15) == 0);
+    let buffer = array.dataStart;
+    return new i128(
+      bswap<u64>(load<u64>(buffer, 1 * sizeof<u64>())),
+      bswap<u64>(load<u64>(buffer, 0 * sizeof<u64>()))
+    );
+  }
+
+  /**
+   * Create 128-bit signed integer from a generic type T
+   * @param  value
+   * @return 128-bit signed integer
+   */
+  @inline
+  static from<T>(value: T): i128 {
+    if (value instanceof bool) return i128.fromU64(<u64>value);
+    else if (value instanceof i8) return i128.fromI64(<i64>value);
+    else if (value instanceof u8) return i128.fromU64(<u64>value);
+    else if (value instanceof i16) return i128.fromI64(<i64>value);
+    else if (value instanceof u16) return i128.fromU64(<u64>value);
+    else if (value instanceof i32) return i128.fromI64(<i64>value);
+    else if (value instanceof u32) return i128.fromU64(<u64>value);
+    else if (value instanceof i64) return i128.fromI64(<i64>value);
+    else if (value instanceof u64) return i128.fromU64(<u64>value);
+    else if (value instanceof f32) return i128.fromF64(<f64>value);
+    else if (value instanceof f64) return i128.fromF64(<f64>value);
+    else if (value instanceof i128) return i128.fromI128(<i128>value);
+    else if (value instanceof u128) return i128.fromU128(<u128>value);
+    else if (value instanceof i256) return i128.fromI256(<i256>value);
+    else if (value instanceof u256) return i128.fromU256(<u256>value);
+    else if (value instanceof u8[]) return i128.fromBytes(<u8[]>value);
+    else throw new TypeError("Unsupported generic type");
+  }
+
+  @inline @operator.prefix('!')
+  static isEmpty(value: i128): bool {
+    return value.isZero();
+  }
+
+  @inline @operator('|')
+  static or(a: i128, b: i128): i128 {
+    return new i128(a.lo | b.lo, a.hi | b.hi);
+  }
+
+  @inline @operator('^')
+  static xor(a: i128, b: i128): i128 {
+    return new i128(a.lo ^ b.lo, a.hi ^ b.hi);
+  }
+
+  @inline @operator('&')
+  static and(a: i128, b: i128): i128 {
+    return new i128(a.lo & b.lo, a.hi & b.hi);
+  }
+
+  @inline @operator('<<')
+  static shl(value: i128, shift: i32): i128 {
+    shift &= 127;
+    0xFFFFFFFFFFFFFFFF
+    if (!shift) return value;
+
+    let lo = value.lo;
+    let hi = value.hi;
+    if (shift < 64) {
+      let newLo = lo << shift;
+      let newHi = (hi << shift) | i64(lo >>> (64 - shift));
+      return new i128(newLo, newHi);
+    } else {
+      // shift >= 64
+      let s = shift - 64;
+      if (s == 0) {
+        // exactly 64
+        return new i128(0, lo as i64);
+      } else {
+        // 1..63
+        return new i128(0, (lo << s) as i64);
+      }
+    }
+  }
+
+  @inline @operator('>>>')
+  static shr_u(value: i128, shift: i32): i128 {
+    // an unsigned right shift of a *signed* 128
+    shift &= 127;
+    if (!shift) return value;
+
+    let lo = value.lo;
+    let hi = u64(value.hi); // reinterpret sign as high bits
+
+    if (shift < 64) {
+      let newLo = (lo >>> shift) | (hi << (64 - shift));
+      let newHi = hi >>> shift;
+      return new i128(newLo, newHi as i64);
+    } else {
+      // shift >= 64
+      let s = shift - 64;
+      if (s == 0) {
+        return new i128(hi, 0);
+      } else {
+        // 1..63
+        return new i128(hi >>> s, 0);
+      }
+    }
+  }
+
+  @inline @operator('+')
+  static add(a: i128, b: i128): i128 {
+    let lo = a.lo + b.lo;
+    let carry = (lo < a.lo) ? 1 : 0;
+    let hi = a.hi + b.hi + (carry as i64);
+    return new i128(lo, hi);
+  }
+
+  @inline @operator('-')
+  static sub(a: i128, b: i128): i128 {
+    let lo = a.lo - b.lo;
+    let borrow = (lo > a.lo) ? 1 : 0;
+    let hi = a.hi - b.hi - (borrow as i64);
+    return new i128(lo, hi);
+  }
+
+  @inline @operator('==')
+  static eq(a: i128, b: i128): bool {
+    return a.hi == b.hi && a.lo == b.lo;
+  }
+
+  @inline @operator('!=')
+  static ne(a: i128, b: i128): bool {
+    return !i128.eq(a, b);
+  }
+
+  @inline @operator('<')
+  static lt(a: i128, b: i128): bool {
+    let ah = a.hi, bh = b.hi;
+    // If hi parts differ, that decides the sign. Otherwise compare lo.
+    return ah == bh ? a.lo < b.lo : ah < bh;
+  }
+
+  @inline @operator('>')
+  static gt(a: i128, b: i128): bool {
+    return b < a;
+  }
+
+  @inline @operator('<=')
+  static le(a: i128, b: i128): bool {
+    return !i128.gt(a, b);
+  }
+
+  @inline @operator('>=')
+  static ge(a: i128, b: i128): bool {
+    return !i128.lt(a, b);
+  }
+
+  @inline
+  static ord(a: i128, b: i128): i32 {
+    // Return -1, 0, 1
+    if (a == b) return 0;
+    return i128.lt(a, b) ? -1 : 1;
+  }
+
+  @inline
+  static popcnt(value: i128): i32 {
+    return <i32>(popcnt(value.lo) + popcnt(value.hi));
+  }
+
+  @inline
+  static clz(value: i128): i32 {
+    return __clz128(value.lo, value.hi);
+  }
+
+  @inline
+  static ctz(value: i128): i32 {
+    return __ctz128(value.lo, value.hi);
+  }
+
+  @inline
+  static abs(value: i128): i128 {
+    // if negative, return -value
+    return value.isNeg() ? value.neg() : value;
+  }
+
+  @inline
+  isPos(): bool {
+    return this.hi >= 0;
+  }
+
+  @inline
+  isNeg(): bool {
+    return this.hi < 0;
+  }
+
+  @inline
+  isZero(): bool {
+    return !(this.lo | this.hi);
+  }
+
+  @inline @operator.prefix('~')
+  not(): i128 {
+    return new i128(~this.lo, ~this.hi);
+  }
+
+  @inline @operator.prefix('+')
+  pos(): i128 {
+    return this;
+  }
+
+  @inline @operator.prefix('-')
+  neg(): i128 {
+    // two's complement: ~x + 1
+    let nlo = ~this.lo;
+    let nhi = ~this.hi;
+
+    let sum = nlo + 1;
+    let carry = (sum < nlo) ? 1 : 0;
+    let hi2 = nhi + (carry as i64);
+
+    return new i128(sum, hi2);
+  }
+
+  /**
+   * Convert to a normal array of bytes (16 bytes for 128 bits).
+   * @param bigEndian If true, the highest bytes come first.
+   */
+  @inline
+  toBytes(bigEndian: bool = false): u8[] {
+    let result = new Array<u8>(16);
+    this.toArrayBuffer(result.dataStart, bigEndian);
+    return result;
+  }
+
+  /**
+   * Convert to a StaticArray<u8> of length 16.
+   * @param bigEndian If true, the highest bytes come first.
+   * @returns StaticArray<u8>
+   */
+  @inline
+  toStaticBytes(bigEndian: bool = false): StaticArray<u8> {
+    let result = new StaticArray<u8>(16);
+    this.toArrayBuffer(changetype<usize>(result), bigEndian);
+    return result;
+  }
+
+  /**
+   * Convert to Uint8Array
+   * @param bigEndian Little or Big Endian? Default: false
+   * @returns  Uint8Array
+   */
+  @inline
+  toUint8Array(bigEndian: bool = false): Uint8Array {
+    let result = new Uint8Array(16);
+    this.toArrayBuffer(result.dataStart, bigEndian);
+    return result;
+  }
+
+  @inline
+  private toArrayBufferLE(buffer: usize): void {
+    store<u64>(buffer, this.lo, 0 * sizeof<u64>());
+    store<u64>(buffer, this.hi, 1 * sizeof<u64>());
+  }
+
+  @inline
+  private toArrayBufferBE(buffer: usize): void {
+    store<u64>(buffer, bswap<u64>(this.hi), 0 * sizeof<u64>());
+    store<u64>(buffer, bswap<u64>(this.lo), 1 * sizeof<u64>());
+  }
+
+  @inline
+  private toArrayBuffer(buffer: usize, bigEndian: bool = false): void {
+    if (bigEndian) {
+      this.toArrayBufferBE(buffer);
+    } else {
+      this.toArrayBufferLE(buffer);
+    }
+  }
+}
+`,"bignum/integer/i256":`export class i256 {
+
+  constructor(
+    public lo1: i64 = 0,
+    public lo2: i64 = 0,
+    public hi1: i64 = 0,
+    public hi2: i64 = 0,
+  ) {
+  }
+
+  @inline static get Zero(): i256 {
+    return new i256();
+  }
+
+  @inline static get One(): i256 {
+    return new i256(1);
+  }
+
+  @inline static get Min(): i256 {
+    return new i256(0, 0, 0, 0x8000000000000000);
+  }
+
+  @inline static get Max(): i256 {
+    return new i256(u64.MAX_VALUE, u64.MAX_VALUE, u64.MAX_VALUE, 0x7FFFFFFFFFFFFFFF);
+  }
+
+  @inline @operator.prefix('!')
+  static isEmpty(value: i256): bool {
+    return value.isZero();
+  }
+
+  @inline
+  isNeg(): bool {
+    return <bool>(this.hi2 >>> 63);
+  }
+
+  @inline
+  isZero(): bool {
+    return !(this.lo1 | this.lo2 | this.hi1 | this.hi2);
+  }
+
+  /*
+  @inline
+  static abs(value: i128): i128 {
+    return value < 0 ? value.neg() : value;
+  }
+  */
+
+  // TODO
+}
+`,"bignum/integer/index":`export * from "./i128";
+export * from "./u128";
+export * from "./u256";
+`,"bignum/integer/u128":`import { i128 } from './i128';
+import { i256 } from './i256';
+import { u256 } from './u256';
+
+// TODO import this on top level 'index.ts'
+import {
+  __clz128,
+  __ctz128,
+  __divmod_quot_hi,
+  __divmod_rem_hi,
+  __divmod_rem_lo,
+  __floatuntidf,
+  __multi3,
+  __res128_hi,
+  __udivmod128,
+  __udivmod128_10,
+} from '../globals';
+
+import { atou128, u128toDecimalString } from '../utils';
+
+@lazy const HEX_CHARS = '0123456789abcdef';
+
+export class u128 {
+  // CACHE: Static instances to avoid allocation
+  private static readonly _ZERO: u128 = new u128(0, 0);
+  private static readonly _ONE: u128 = new u128(1, 0);
+  private static readonly _MAX: u128 = new u128(-1, -1);
+
+  /**
+   * Create 128-bit unsigned integer from 64-bit parts
+   * @param lo low  64-bit part of 128-bit unsigned integer
+   * @param hi high 64-bit part of 128-bit unsigned integer
+   */
+  constructor(
+    public lo: u64 = 0,
+    public hi: u64 = 0,
+  ) {
+  }
+
+  @inline static get immutableZero(): u128 {
+    return u128._ZERO;
+  }
+
+  @inline static get immutableOne(): u128 {
+    return u128._ONE;
+  }
+
+  @inline static get immutableMin(): u128 {
+    return u128._ZERO;
+  }
+
+  @inline static get immutableMax(): u128 {
+    return u128._MAX;
+  }
+
+  @inline static get Zero(): u128 { return new u128(0, 0); }
+  @inline static get One(): u128 { return new u128(1, 0); }
+  @inline static get Min(): u128 { return new u128(0, 0); }
+  @inline static get Max(): u128 { return new u128(-1, -1); }
+
+  /**
+   * Ensures the current instance is not a static constant.
+   * If it is, throws an error.
+   * Cost: 3 integer comparisons. Cheap insurance.
+   */
+  @inline
+  private checkMutable(): void {
+    const ptr = changetype<usize>(this);
+    if (ptr == changetype<usize>(u128._ZERO) ||
+      ptr == changetype<usize>(u128._ONE) ||
+      ptr == changetype<usize>(u128._MAX)) {
+      throw new Error("u128: Immutable constant");
+    }
+  }
+
+  @inline
+  static fromString(value: string, radix: i32 = 10): u128 {
+    return atou128(value, radix);
+  }
+
+  @inline
+  static fromI256(value: i256): u128 {
+    return new u128(value.lo1, value.lo2);
+  }
+
+  @inline
+  static fromU256(value: u256): u128 {
+    return new u128(value.lo1, value.lo2);
+  }
+
+  @inline
+  static fromI128(value: i128): u128 {
+    return new u128(value.lo, value.hi);
+  }
+
+  @inline
+  static fromU128(value: u128): u128 {
+    return new u128(value.lo, value.hi);
+  }
+
+  @inline
+  static fromI64(value: i64): u128 {
+    if (value == 0) return u128.Zero;
+    if (value == 1) return u128.One;
+    return new u128(value, value >> 63);
+  }
+
+  @inline
+  static fromU64(value: u64): u128 {
+    if (value == 0) return u128.Zero;
+    if (value == 1) return u128.One;
+    return new u128(value);
+  }
+
+  // max safe uint for f64 actually 53-bits
+  @inline
+  static fromF64(value: f64): u128 {
+    return new u128(<u64>value, reinterpret<i64>(value) >> 63);
+  }
+
+  // max safe int for f32 actually 23-bits
+  @inline
+  static fromF32(value: f32): u128 {
+    return new u128(<u64>value, <u64>(reinterpret<i32>(value) >> 31));
+  }
+
+  @inline
+  static fromI32(value: i32): u128 {
+    if (value == 0) return u128.Zero;
+    if (value == 1) return u128.One;
+    return new u128(value, value >> 31);
+  }
+
+  @inline
+  static fromU32(value: u32): u128 {
+    if (value == 0) return u128.Zero;
+    if (value == 1) return u128.One;
+    return new u128(value);
+  }
+
+  @inline
+  static fromBool(value: bool): u128 {
+    return value ? u128.One : u128.Zero;
+  }
+
+  @inline
+  static fromBits(lo1: u32, lo2: u32, hi1: u32, hi2: u32): u128 {
+    return new u128(
+      <u64>lo1 | ((<u64>lo2) << 32),
+      <u64>hi1 | ((<u64>hi2) << 32),
+    );
+  }
+
+  @inline
+  static fromBytes<T>(array: T, bigEndian: bool = false): u128 {
+    // @ts-ignore
+    if (array instanceof u8[]) {
+      return bigEndian
+        // @ts-ignore
+        ? u128.fromBytesBE(<u8[]>array)
+        // @ts-ignore
+        : u128.fromBytesLE(<u8[]>array);
+    } else if (array instanceof Uint8Array) {
+      return bigEndian
+        ? u128.fromUint8ArrayBE(<Uint8Array>array)
+        : u128.fromUint8ArrayLE(<Uint8Array>array);
+    } else {
+      throw new TypeError("Unsupported generic type");
+    }
+  }
+
+  @inline
+  static fromBytesLE(array: u8[]): u128 {
+    if (array.length !== 16) throw new Error("Invalid length");
+    let buffer = array.dataStart;
+    return new u128(
+      load<u64>(buffer, 0),
+      load<u64>(buffer, 8)
+    );
+  }
+
+  @inline
+  static fromBytesBE(array: u8[]): u128 {
+    if (array.length !== 16) throw new Error("Invalid length");
+    let buffer = array.dataStart;
+    return new u128(
+      bswap<u64>(load<u64>(buffer, 8)),
+      bswap<u64>(load<u64>(buffer, 0))
+    );
+  }
+
+  @inline
+  static fromUint8ArrayLE(array: Uint8Array): u128 {
+    if (array.length !== 16) throw new Error("Invalid length");
+    let buffer = array.dataStart;
+    return new u128(
+      load<u64>(buffer, 0),
+      load<u64>(buffer, 8)
+    );
+  }
+
+  @inline
+  static fromUint8ArrayBE(array: Uint8Array): u128 {
+    if (array.length !== 16) throw new Error("Invalid length");
+    let buffer = array.dataStart;
+    return new u128(
+      bswap<u64>(load<u64>(buffer, 8)),
+      bswap<u64>(load<u64>(buffer, 0))
+    );
+  }
+
+  /**
+   * Create 128-bit unsigned integer from generic type T
+   * @param  value
+   * @returns 128-bit unsigned integer
+   */
+  @inline
+  static from<T>(value: T): u128 {
+    if (value instanceof bool) return u128.fromU64(<u64>value);
+    else if (value instanceof i8) return u128.fromI64(<i64>value);
+    else if (value instanceof u8) return u128.fromU64(<u64>value);
+    else if (value instanceof i16) return u128.fromI64(<i64>value);
+    else if (value instanceof u16) return u128.fromU64(<u64>value);
+    else if (value instanceof i32) return u128.fromI64(<i64>value);
+    else if (value instanceof u32) return u128.fromU64(<u64>value);
+    else if (value instanceof i64) return u128.fromI64(<i64>value);
+    else if (value instanceof u64) return u128.fromU64(<u64>value);
+    else if (value instanceof f32) return u128.fromF64(<f64>value);
+    else if (value instanceof f64) return u128.fromF64(<f64>value);
+    else if (value instanceof i128) return u128.fromI128(<i128>value);
+    else if (value instanceof u128) return u128.fromU128(<u128>value);
+    else if (value instanceof i256) return u128.fromI256(<i256>value);
+    else if (value instanceof u256) return u128.fromU256(<u256>value);
+    else if (value instanceof u8[]) return u128.fromBytes(<u8[]>value);
+    else if (value instanceof Uint8Array) return u128.fromBytes(<Uint8Array>value);
+    else if (value instanceof String) return u128.fromString(<string>value);
+    else throw new TypeError("Unsupported generic type");
+  }
+
+  @inline @operator.prefix('!')
+  static isEmpty(value: u128): bool {
+    return !(value.lo | value.hi);
+  }
+
+  @inline @operator('|')
+  static or(a: u128, b: u128): u128 {
+    return new u128(a.lo | b.lo, a.hi | b.hi);
+  }
+
+  @inline @operator('^')
+  static xor(a: u128, b: u128): u128 {
+    return new u128(a.lo ^ b.lo, a.hi ^ b.hi);
+  }
+
+  @inline @operator('&')
+  static and(a: u128, b: u128): u128 {
+    return new u128(a.lo & b.lo, a.hi & b.hi);
+  }
+
+  @inline @operator('<<')
+  static shl(value: u128, shift: i32): u128 {
+    // Cache check: if shift is 0 or invalid, return existing constants if possible
+    if (shift <= 0) {
+      return shift == 0 ? value.clone() : u128.Zero; // Use cached Zero
+    }
+
+    if (shift >= 128) {
+      return u128.Zero; // Use cached Zero
+    }
+
+    // Unrolled shift logic
+    if (shift < 64) {
+      const lo = value.lo << shift;
+      const hi = (value.hi << shift) | (value.lo >>> (64 - shift));
+      return new u128(lo, hi);
+    } else {
+      // shift >= 64
+      return new u128(0, value.lo << (shift - 64));
+    }
+  }
+
+  @inline @operator('>>')
+  static shr(value: u128, shift: i32): u128 {
+    shift &= 127;
+    if (shift == 0) return value.clone();
+
+    // Unrolled shift logic
+    if (shift < 64) {
+      let hi = value.hi >> shift;
+      let lo = (value.hi << (64 - shift)) | (value.lo >> shift);
+      return new u128(lo, hi);
+    } else {
+      let s = shift - 64;
+      return new u128(value.hi >> s, 0);
+    }
+  }
+
+  @inline @operator('>>>')
+  static shr_u(value: u128, shift: i32): u128 {
+    return u128.shr(value, shift);
+  }
+
+  @inline
+  static rotl(value: u128, shift: i32): u128 {
+    let n = shift & 127;
+    if (n == 0) return value.clone();
+
+    let lo = value.lo;
+    let hi = value.hi;
+    if (n == 64) {
+      return new u128(hi, lo);
+    }
+    if (n & 64) {
+      let t = lo;
+      lo = hi;
+      hi = t;
+    }
+    let slo = lo << n;
+    let shi = hi << n;
+    let rlo = lo >> (64 - n);
+    let rhi = hi >> (64 - n);
+    return new u128(slo | rhi, shi | rlo);
+  }
+
+  @inline
+  static rotr(value: u128, shift: i32): u128 {
+    let n = shift & 127;
+    if (n == 0) return value.clone();
+
+    let lo = value.lo;
+    let hi = value.hi;
+    if (n == 64) {
+      return new u128(hi, lo);
+    }
+    if (n & 64) {
+      let t = lo;
+      lo = hi;
+      hi = t;
+    }
+    let slo = lo >> n;
+    let shi = hi >> n;
+    let rlo = lo << (64 - n);
+    let rhi = hi << (64 - n);
+    return new u128(slo | rhi, shi | rlo);
+  }
+
+  @inline @operator('+')
+  static add(a: u128, b: u128): u128 {
+    var alo = a.lo;
+    var lo = alo + b.lo;
+    var hi = a.hi + b.hi + u64(lo < alo);
+    return new u128(lo, hi);
+  }
+
+  @inline @operator('-')
+  static sub(a: u128, b: u128): u128 {
+    var alo = a.lo;
+    var lo = alo - b.lo;
+    var hi = a.hi - b.hi - u64(lo > alo);
+    return new u128(lo, hi);
+  }
+
+  // mul: u128 x u128 = u128
+  @inline @operator('*')
+  static mul(a: u128, b: u128): u128 {
+    return new u128(
+      __multi3(a.lo, a.hi, b.lo, b.hi),
+      __res128_hi
+    );
+  }
+
+  @inline @operator('/')
+  static div(a: u128, b: u128): u128 {
+    return new u128(
+      __udivmod128(a.lo, a.hi, b.lo, b.hi),
+      __divmod_quot_hi
+    );
+  }
+
+  @inline @operator('%')
+  static rem(a: u128, b: u128): u128 {
+    __udivmod128(a.lo, a.hi, b.lo, b.hi);
+    return new u128(__divmod_rem_lo, __divmod_rem_hi);
+  }
+
+  @inline
+  static div10(value: u128): u128 {
+    return new u128(
+      __udivmod128_10(value.lo, value.hi),
+      __divmod_quot_hi
+    );
+  }
+
+  @inline
+  static rem10(value: u128): u128 {
+    __udivmod128_10(value.lo, value.hi);
+    return new u128(__divmod_rem_lo, __divmod_rem_hi);
+  }
+
+  /**
+   * Calculate power of base with exponent
+   * @param  base     128-bit unsigned integer
+   * @param  exponent 32-bit signed integer
+   * @returns         128-bit unsigned integer
+   */
+  @operator('**')
+  static pow(base: u128, exponent: i32): u128 {
+    // any negative exponent produce zero
+
+    var result = u128.One;
+
+    if (base == result) return result;
+    var tmp = base.clone();
+    if (exponent <= 1) {
+      if (exponent < 0) return u128.Zero;
+      return exponent == 0 ? result : tmp;
+    }
+
+    if (ASC_SHRINK_LEVEL < 1) {
+      var lo = base.lo;
+      var hi = base.hi;
+      // if base > u64::max and exp > 1 always return "0"
+      if (!lo) return u128.Zero;
+      if (!hi) {
+        let lo1 = lo - 1;
+        // "1 ^ exponent" always return "1"
+        if (!lo1) return result;
+
+        // if base is power of two do "1 << log2(base) * exp"
+        if (!(lo & lo1)) {
+          let shift = <i32>(64 - clz(lo1)) * exponent;
+          // @ts-ignore
+          return shift < 128 ? result << shift : u128.Zero;
+        }
+      }
+
+      if (exponent <= 4) {
+        let baseSq = tmp.sqr();
+        switch (exponent) {
+          case 2:
+            return baseSq;        // base ^ 2
+          // @ts-ignore
+          case 3:
+            return baseSq * base; // base ^ 2 * base
+          case 4:
+            return baseSq.sqr();  // base ^ 2 * base ^ 2
+          default:
+            break;
+        }
+      }
+
+      let log = 32 - clz(exponent);
+      if (log <= 7) {
+        // 128 = 2 ^ 7, so need usually only seven cases
+        switch (log) {
+          case 7:
+            // @ts-ignore
+            if (exponent & 1) result *= tmp;
+            exponent >>= 1;
+            tmp.sqr();
+          case 6:
+            // @ts-ignore
+            if (exponent & 1) result *= tmp;
+            exponent >>= 1;
+            tmp.sqr();
+          case 5:
+            // @ts-ignore
+            if (exponent & 1) result *= tmp;
+            exponent >>= 1;
+            tmp.sqr();
+          case 4:
+            // @ts-ignore
+            if (exponent & 1) result *= tmp;
+            exponent >>= 1;
+            tmp.sqr();
+          case 3:
+            // @ts-ignore
+            if (exponent & 1) result *= tmp;
+            exponent >>= 1;
+            tmp.sqr();
+          case 2:
+            // @ts-ignore
+            if (exponent & 1) result *= tmp;
+            exponent >>= 1;
+            tmp.sqr();
+          case 1:
+            // @ts-ignore
+            if (exponent & 1) result *= tmp;
+        }
+        return result;
+      }
+    }
+
+    while (exponent > 0) {
+      // @ts-ignore
+      if (exponent & 1) result *= tmp;
+      exponent >>= 1;
+      tmp.sqr();
+    }
+    return result;
+  }
+
+  // compute floor(sqrt(x))
+  static sqrt(value: u128): u128 {
+    var rem = value.clone();
+    if (value < new u128(2)) {
+      return rem;
+    }
+    var res = u128.Zero;
+    // @ts-ignore
+    var pos = u128.One << (127 - (u128.clz(value) | 1));
+    // @ts-ignore
+    while (!pos.isZero()) {
+      // @ts-ignore
+      value = res + pos;
+      if (rem >= value) {
+        // @ts-ignore
+        rem = rem - value;
+        // @ts-ignore
+        res = pos + value;
+      }
+      // @ts-ignore
+      res >>= 1;
+      pos >>= 2;
+    }
+    return res;
+  }
+
+  @inline @operator('==')
+  static eq(a: u128, b: u128): bool {
+    return a.hi == b.hi && a.lo == b.lo;
+  }
+
+  @inline @operator('!=')
+  static ne(a: u128, b: u128): bool {
+    return !u128.eq(a, b);
+  }
+
+  @inline @operator('<')
+  static lt(a: u128, b: u128): bool {
+    var ah = a.hi, bh = b.hi;
+    return ah == bh ? a.lo < b.lo : ah < bh;
+  }
+
+  @inline @operator('>')
+  static gt(a: u128, b: u128): bool {
+    var ah = a.hi, bh = b.hi;
+    return ah == bh ? a.lo > b.lo : ah > bh;
+  }
+
+  @inline @operator('<=')
+  static le(a: u128, b: u128): bool {
+    return !u128.gt(a, b);
+  }
+
+  @inline @operator('>=')
+  static ge(a: u128, b: u128): bool {
+    return !u128.lt(a, b);
+  }
+
+  /**
+   * Get ordering
+   * if a > b then result is  1
+   * if a < b then result is -1
+   * if a = b then result is  0
+   * @param  a 128-bit unsigned integer
+   * @param  b 128-bit unsigned integer
+   * @returns  32-bit signed integer
+   */
+  @inline
+  static ord(a: u128, b: u128): i32 {
+    // if a > b => +1
+    // if a < b => -1
+    // if equal => 0
+    if (a.hi > b.hi) return 1;
+    if (a.hi < b.hi) return -1;
+    if (a.lo > b.lo) return 1;
+    if (a.lo < b.lo) return -1;
+    return 0;
+  }
+
+  /**
+   * Compute count of set (populated) bits
+   * @param  value 128-bit unsigned integer
+   * @returns      32-bit signed integer
+   */
+  @inline
+  static popcnt(value: u128): i32 {
+    return <i32>(popcnt(value.lo) + popcnt(value.hi));
+  }
+
+  /**
+   * Compute bit count of leading zeros
+   * @param  value 128-bit unsigned integer
+   * @returns      32-bit signed integer
+   */
+  @inline
+  static clz(value: u128): i32 {
+    return __clz128(value.lo, value.hi);
+  }
+
+  /**
+   * Compute bit count of trailing zeros
+   * @param  value 128-bit unsigned integer
+   * @returns      32-bit signed integer
+   */
+  @inline
+  static ctz(value: u128): i32 {
+    return __ctz128(value.lo, value.hi);
+  }
+
+  /**
+   * Calculate squared value (value ** 2)
+   * @param  value 128-bit unsigned integer
+   * @returns      128-bit unsigned integer
+   */
+  @inline
+  static sqr(value: u128): u128 {
+    return value.clone().sqr();
+  }
+
+  /**
+   * Calculate multiply and division as \`number * numerator / denominator\`
+   * without overflow in multiplication part.
+   *
+   * @returns 128-bit unsigned integer
+   */
+  static muldiv(a: u128, b: u128, c: u128): u128 {
+    let A = u256.fromU128(a);
+    let B = u256.fromU128(b);
+    let C = u256.fromU128(c);
+
+    let product = u256.mul(A, B);
+    let quotient = u256.div(product, C);
+
+    return quotient.toU128();
+  }
+
+  @inline
+  set(value: u128): this {
+    this.checkMutable();
+    this.lo = value.lo;
+    this.hi = value.hi;
+    return this;
+  }
+
+  @inline
+  setI64(value: i64): this {
+    this.checkMutable();
+    this.lo = value;
+    this.hi = value >> 63;
+    return this;
+  }
+
+  @inline
+  setU64(value: u64): this {
+    this.checkMutable();
+    this.lo = value;
+    this.hi = 0;
+    return this;
+  }
+
+  @inline
+  setI32(value: i32): this {
+    this.checkMutable();
+    this.lo = value;
+    this.hi = value >> 63;
+    return this;
+  }
+
+  @inline
+  setU32(value: u32): this {
+    this.checkMutable();
+    this.lo = value;
+    this.hi = 0;
+    return this;
+  }
+
+  @inline
+  isZero(): bool {
+    return !(this.lo | this.hi);
+  }
+
+  @inline @operator.prefix('~')
+  not(): u128 {
+    return new u128(~this.lo, ~this.hi);
+  }
+
+  @inline @operator.prefix('+')
+  pos(): u128 {
+    return this;
+  }
+
+  @inline @operator.prefix('-')
+  neg(): u128 {
+    var lo = ~this.lo;
+    var hi = ~this.hi;
+    var lo1 = lo + 1;
+    return new u128(lo1, hi + u64(lo1 < lo));
+  }
+
+  @operator.prefix('++')
+  preInc(): this {
+    this.checkMutable();
+    var lo = this.lo;
+    var lo1 = lo + 1;
+    this.hi += u64(lo1 < lo);
+    this.lo = lo1;
+    return this;
+  }
+
+  @operator.prefix('--')
+  preDec(): this {
+    this.checkMutable();
+    var lo = this.lo;
+    var lo1 = lo - 1;
+    this.hi -= u64(lo1 > lo);
+    this.lo = lo1;
+    return this;
+  }
+
+  @operator.postfix('++')
+  postInc(): u128 {
+    return this.clone().preInc();
+  }
+
+  @operator.postfix('--')
+  postDec(): u128 {
+    return this.clone().preDec();
+  }
+
+  /**
+   * Calculate inplace squared 128-bit unsigned integer (this ** 2)
+   * @returns 128-bit unsigned integer
+   */
+  sqr(): this {
+    this.checkMutable();
+    // Use built-in 128\xD7128 => 128 multiplication
+    // i.e. "x * x"
+    let tmp = u128.mul(this, this);
+    this.lo = tmp.lo;
+    this.hi = tmp.hi;
+    return this;
+  }
+
+  /**
+   * Convert to 256-bit signed integer
+   * @returns 256-bit signed integer
+   */
+  @inline
+  toI256(): i256 {
+    return new i256(this.lo, this.hi);
+  }
+
+  /**
+   * Convert to 256-bit unsigned integer
+   * @returns 256-bit unsigned integer
+   */
+  @inline
+  toU256(): u256 {
+    return new u256(this.lo, this.hi);
+  }
+
+  /**
+   * Convert to 128-bit signed integer
+   * @returns 128-bit signed integer
+   */
+  @inline
+  toI128(): i128 {
+    return new i128(this.lo, this.hi);
+  }
+
+  /**
+   * Convert to 128-bit unsigned integer
+   * @returns 128-bit unsigned integer
+   */
+  @inline
+  toU128(): this {
+    return this;
+  }
+
+  /**
+   * Convert to 64-bit signed integer
+   * @returns 64-bit signed integer
+   */
+  @inline
+  toI64(): i64 {
+    return <i64>(
+      (this.lo & 0x7FFFFFFFFFFFFFFF) |
+      (this.hi & 0x8000000000000000)
+    );
+  }
+
+  /**
+   * Convert to 64-bit unsigned integer
+   * @returns 64-bit unsigned integer
+   */
+  @inline
+  toU64(): u64 {
+    return this.lo;
+  }
+
+  /**
+   * Convert to 32-bit signed integer
+   * @returns 32-bit signed integer
+   */
+  @inline
+  toI32(): i32 {
+    return <i32>this.toI64();
+  }
+
+  /**
+   * Convert to 32-bit unsigned integer
+   * @returns 32-bit unsigned integer
+   */
+  @inline
+  toU32(): u32 {
+    return <u32>this.lo;
+  }
+
+  /**
+   * Convert to 1-bit boolean
+   * @returns 1-bit boolean
+   */
+  @inline
+  toBool(): bool {
+    return (this.lo | this.hi) != 0;
+  }
+
+  /**
+   * Convert to 64-bit float number in deteministic way
+   * @returns 64-bit float
+   */
+  @inline
+  toF64(): f64 {
+    return __floatuntidf(this.lo, this.hi);
+  }
+
+  /**
+   * Convert to 32-bit float number
+   * @returns 32-bit float
+   */
+  @inline
+  toF32(): f32 {
+    return <f32>this.toF64();
+  }
+
+  /**
+   * Convert to generic type \`T\`. Useful inside other generics methods
+   * @param  T  is <bool | i8 | u8 | i16 | u16 | i32 | u32 | i64 | u64 | f32 | f64 | i128 | u128 | u256 | u8[] | Uint8Array | \`StaticArray<u8>\` | string>
+   * @returns   type of \`T\`
+   */
+  @inline
+  as<T>(): T {
+    if (isBoolean<T>()) {
+      return <T>this.toBool();
+    } else if (isInteger<T>()) {
+      if (isSigned<T>()) {
+        // i8, i16, i32, i64
+        return <T>this.toI64();
+      } else {
+        // u8, u16, u32, u64
+        return <T>this.toU64();
+      }
+    } else if (isFloat<T>()) {
+      // f32, f64
+      return <T>this.toF64();
+    } else if (isString<T>()) {
+      return <T>this.toString();
+    } else if (isReference<T>()) {
+      let dummy = changetype<T>(0);
+      if (dummy instanceof u8[]) return <T>this.toBytes();
+      else if (dummy instanceof StaticArray<u8>) return <T>this.toStaticBytes();
+      else if (dummy instanceof Uint8Array) return <T>this.toUint8Array();
+      else if (dummy instanceof i128) return <T>this.toI128();
+      else if (dummy instanceof u128) return <T>this;
+      else if (dummy instanceof u256) return <T>this.toU256();
+      else throw new TypeError('Unsupported generic type');
+    } else throw new TypeError('Unsupported generic type');
+  }
+
+  /**
+   * Convert to byte array
+   * @param bigEndian Little or Big Endian? Default: false
+   * @returns  Array of bytes
+   */
+  @inline
+  toBytes(bigEndian: bool = false): u8[] {
+    var result = new Array<u8>(16);
+    this.toArrayBuffer(result.dataStart, bigEndian);
+    return result;
+  }
+
+  /**
+   * Convert to byte static array
+   * @param bigEndian Little or Big Endian? Default: false
+   * @returns  StaticArray of bytes
+   */
+  @inline
+  toStaticBytes(bigEndian: bool = false): StaticArray<u8> {
+    var result = new StaticArray<u8>(16);
+    this.toArrayBuffer(changetype<usize>(result), bigEndian);
+    return result;
+  }
+
+  /**
+   * Convert to Uint8Array
+   * @param bigEndian Little or Big Endian? Default: false
+   * @returns  Uint8Array
+   */
+  @inline
+  toUint8Array(bigEndian: bool = false): Uint8Array {
+    var result = new Uint8Array(16);
+    this.toArrayBuffer(result.dataStart, bigEndian);
+    return result;
+  }
+
+  /**
+   * Return copy of current 128-bit value
+   * @returns 128-bit unsigned integer
+   */
+  clone(): u128 {
+    return new u128(this.lo, this.hi);
+  }
+
+  toString(radix: i32 = 10): string {
+    assert(radix == 10 || radix == 16, 'radix argument must be between 10 or 16');
+    if (this.isZero()) return '0';
+
+    var result = '';
+    if (radix == 16) {
+      let shift: i32 = 124 - (u128.clz(this) & ~3);
+      while (shift >= 0) {
+        // @ts-ignore
+        result += HEX_CHARS.charAt(<i32>((this >> shift).lo & 15));
+        shift -= 4;
+      }
+      return result;
+    }
+    return u128toDecimalString(this);
+  }
+
+  @inline
+  private toArrayBufferLE(buffer: usize): void {
+    store<u64>(buffer, this.lo, 0 * sizeof<u64>());
+    store<u64>(buffer, this.hi, 1 * sizeof<u64>());
+  }
+
+  @inline
+  private toArrayBufferBE(buffer: usize): void {
+    store<u64>(buffer, bswap(this.hi), 0 * sizeof<u64>());
+    store<u64>(buffer, bswap(this.lo), 1 * sizeof<u64>());
+  }
+
+  @inline
+  private toArrayBuffer(buffer: usize, bigEndian: bool = false): void {
+    if (bigEndian) {
+      this.toArrayBufferBE(buffer);
+    } else {
+      this.toArrayBufferLE(buffer);
+    }
+  }
+}
+`,"bignum/integer/u256":`import { i128 } from './i128';
+import { u128 } from './u128';
+import { u256toDecimalString } from "../utils";
+import {
+  __mul256, __u256carry, __u256carrySub, add64Local, sub64
+} from '../globals';
+
+@lazy const HEX_CHARS = '0123456789abcdef';
+
+/**
+ * Represents a 256-bit unsigned integer.
+ * Optimized for gas efficiency with unrolled loops and direct memory access.
+ */
+export class u256 {
+  /**
+   * Constructs a new \`u256\` with the specified 64-bit limbs.
+   * @constructor
+   * @param {u64} [lo1=0] - The lowest 64 bits.
+   * @param {u64} [lo2=0] - The 64 bits above \`lo1\`.
+   * @param {u64} [hi1=0] - The 64 bits above \`lo2\`.
+   * @param {u64} [hi2=0] - The highest 64 bits.
+   */
+  constructor(
+    public lo1: u64 = 0,
+    public lo2: u64 = 0,
+    public hi1: u64 = 0,
+    public hi2: u64 = 0,
+  ) {}
+
+  @inline static get Zero(): u256 { return  new u256(0, 0, 0, 0); }
+  @inline static get One(): u256 { return new u256(1, 0, 0, 0); }
+  @inline static get Min(): u256 { return  new u256(0, 0, 0, 0); }
+  @inline static get Max(): u256 { return new u256(-1, -1, -1, -1); }
+
+  /**
+   * A constant representing the maximum value for 256-bit unsigned integer.
+   * All bits set to 1.
+   * @returns {u256}
+   */
+  /**
+   * Creates a new \`u256\` from an existing \`u256\`.
+   * @param {u256} value - The source \`u256\` value.
+   * @returns {u256} - A new copy of the \`value\`.
+   */
+  @inline
+  static fromU256(value: u256): u256 {
+    return new u256(value.lo1, value.lo2, value.hi1, value.hi2);
+  }
+
+  /**
+   * Creates a new \`u256\` from a 128-bit unsigned integer.
+   * @param {u128} value - The 128-bit unsigned integer.
+   * @returns {u256} - The resulting 256-bit unsigned integer.
+   */
+  @inline
+  static fromU128(value: u128): u256 {
+    return new u256(value.lo, value.hi);
+  }
+
+  /**
+   * Creates a new \`u256\` from a 64-bit unsigned integer.
+   * @param {u64} value - The 64-bit unsigned integer.
+   * @returns {u256} - The resulting 256-bit unsigned integer.
+   */
+  @inline
+  static fromU64(value: u64): u256 {
+    if (value == 0) return u256.Zero;
+    if (value == 1) return u256.One;
+    return new u256(value);
+  }
+
+  /**
+   * Creates a new \`u256\` from a 64-bit signed integer (sign-extends).
+   * @param {i64} value - The 64-bit signed integer.
+   * @returns {u256} - The resulting 256-bit unsigned integer.
+   */
+  @inline
+  static fromI64(value: i64): u256 {
+    if (value == 0) return u256.Zero;
+    if (value == 1) return u256.One;
+    if (value == -1) return u256.Max;
+    let mask = value >> 63;
+    return new u256(<u64>value, mask, mask, mask);
+  }
+
+  /**
+   * Creates a new \`u256\` from a 32-bit unsigned integer.
+   * @param {u32} value - The 32-bit unsigned integer.
+   * @returns {u256} - The resulting 256-bit unsigned integer.
+   */
+  @inline
+  static fromU32(value: u32): u256 {
+    if (value == 0) return u256.Zero;
+    if (value == 1) return u256.One;
+    return new u256(value);
+  }
+
+  /**
+   * Creates a new \`u256\` from a 32-bit signed integer (sign-extends).
+   * @param {i32} value - The 32-bit signed integer.
+   * @returns {u256} - The resulting 256-bit unsigned integer.
+   */
+  @inline
+  static fromI32(value: i32): u256 {
+    if (value == 0) return u256.Zero;
+    if (value == 1) return u256.One;
+    if (value == -1) return u256.Max;
+    let mask: u64 = value >> 63;
+    return new u256(value, mask, mask, mask);
+  }
+
+  /**
+   * Creates a new \`u256\` from 8 separate 32-bit segments (lower to higher).
+   * @param {u32} l0 - Lower 32 bits of the first 64-bit segment.
+   * @param {u32} l1 - Higher 32 bits of the first 64-bit segment.
+   * @param {u32} l2 - Lower 32 bits of the second 64-bit segment.
+   * @param {u32} l3 - Higher 32 bits of the second 64-bit segment.
+   * @param {u32} h0 - Lower 32 bits of the third 64-bit segment.
+   * @param {u32} h1 - Higher 32 bits of the third 64-bit segment.
+   * @param {u32} h2 - Lower 32 bits of the fourth 64-bit segment.
+   * @param {u32} h3 - Higher 32 bits of the fourth 64-bit segment.
+   * @returns {u256} - The resulting 256-bit unsigned integer.
+   */
+  @inline
+  static fromBits(
+    l0: u32, l1: u32, l2: u32, l3: u32,
+    h0: u32, h1: u32, h2: u32, h3: u32,
+  ): u256 {
+    return new u256(
+      <u64>l0 | ((<u64>l1) << 32),
+      <u64>l2 | ((<u64>l3) << 32),
+      <u64>h0 | ((<u64>h1) << 32),
+      <u64>h2 | ((<u64>h3) << 32),
+    );
+  }
+
+  /**
+   * Creates a new \`u256\` from an array of bytes or \`Uint8Array\`.
+   * @param {T} array - The source array of bytes (u8[] or Uint8Array).
+   * @param {boolean} [bigEndian=false] - Whether the bytes are in big-endian format.
+   * @throws {TypeError} If the generic type \`T\` is not supported.
+   * @returns {u256} - The resulting \`u256\`.
+   */
+  @inline
+  static fromBytes<T>(array: T, bigEndian: bool = false): u256 {
+    // @ts-ignore
+    if (array instanceof u8[]) {
+      return bigEndian
+        // @ts-ignore
+        ? u256.fromBytesBE(<u8[]>array)
+        // @ts-ignore
+        : u256.fromBytesLE(<u8[]>array);
+    } else if (array instanceof Uint8Array) {
+      return bigEndian
+        ? u256.fromUint8ArrayBE(<Uint8Array>array)
+        : u256.fromUint8ArrayLE(<Uint8Array>array);
+    } else {
+      throw new TypeError("Unsupported generic type");
+    }
+  }
+
+  /**
+   * Creates a new \`u256\` from a little-endian array of bytes.
+   * @param {u8[]} array - A 32-byte array (little-endian).
+   * @returns {u256} - The resulting \`u256\`.
+   */
+  @inline
+  static fromBytesLE(array: u8[]): u256 {
+    if (array.length !== 32) throw new Error("Invalid length");
+    let buffer = array.dataStart;
+    return new u256(
+      load<u64>(buffer, 0),
+      load<u64>(buffer, 8),
+      load<u64>(buffer, 16),
+      load<u64>(buffer, 24),
+    );
+  }
+
+  /**
+   * Creates a new \`u256\` from a big-endian array of bytes.
+   * @param {u8[]} array - A 32-byte array (big-endian).
+   * @returns {u256} - The resulting \`u256\`.
+   */
+  @inline
+  static fromBytesBE(array: u8[]): u256 {
+    if (array.length !== 32) throw new Error("Invalid length");
+    let buffer = array.dataStart;
+    return new u256(
+      bswap<u64>(load<u64>(buffer, 24)),
+      bswap<u64>(load<u64>(buffer, 16)),
+      bswap<u64>(load<u64>(buffer, 8)),
+      bswap<u64>(load<u64>(buffer, 0))
+    );
+  }
+
+  /**
+   * Creates a new \`u256\` from a little-endian \`Uint8Array\`.
+   * @param {Uint8Array} array - A 32-byte \`Uint8Array\` (little-endian).
+   * @returns {u256} - The resulting \`u256\`.
+   */
+  @inline
+  static fromUint8ArrayLE(array: Uint8Array): u256 {
+    if (array.length !== 32) throw new Error("Invalid length");
+    let buffer = array.dataStart;
+    return new u256(
+      load<u64>(buffer, 0),
+      load<u64>(buffer, 8),
+      load<u64>(buffer, 16),
+      load<u64>(buffer, 24)
+    );
+  }
+
+  /**
+   * Creates a new \`u256\` from a big-endian \`Uint8Array\`.
+   * @param {Uint8Array} array - A 32-byte \`Uint8Array\` (big-endian).
+   * @returns {u256} - The resulting \`u256\`.
+   */
+  @inline
+  static fromUint8ArrayBE(array: Uint8Array): u256 {
+    if (array.length !== 32) throw new Error("Invalid length");
+    let buffer = array.dataStart;
+    return new u256(
+      bswap<u64>(load<u64>(buffer, 24)),
+      bswap<u64>(load<u64>(buffer, 16)),
+      bswap<u64>(load<u64>(buffer, 8)),
+      bswap<u64>(load<u64>(buffer, 0))
+    );
+  }
+
+  /**
+   * Creates a new \`u256\` from a 64-bit floating-point number.
+   * NOTE: This is only correct up to about 2^53.
+   * @param {f64} value - The 64-bit float value.
+   * @returns {u256} - The resulting \`u256\`.
+   */
+  @inline
+  static fromF64(value: f64): u256 {
+    let mask = u64(reinterpret<i64>(value) >> 63);
+    return new u256(<u64>value, mask, mask, mask);
+  }
+
+  /**
+   * Creates a new \`u256\` from a 32-bit floating-point number.
+   * NOTE: This is only correct up to about 2^23.
+   * @param {f32} value - The 32-bit float value.
+   * @returns {u256} - The resulting \`u256\`.
+   */
+  @inline
+  static fromF32(value: f32): u256 {
+    let mask = u64(reinterpret<i32>(value) >> 31);
+    return new u256(<u64>value, mask, mask, mask);
+  }
+
+  /**
+   * Creates a new \`u256\` from a generic value \`T\`.
+   * Supported types: bool, i8, u8, i16, u16, i32, u32, i64, u64, f32, f64, u128, u256, u8[], Uint8Array.
+   * @param {T} value - The source value.
+   * @throws {TypeError} If the type \`T\` is not supported.
+   * @returns {u256} - The resulting \`u256\`.
+   */
+  @inline
+  static from<T>(value: T): u256 {
+    if (value instanceof bool) return u256.fromU64(<u64>value);
+    else if (value instanceof i8) return u256.fromI64(<i64>value);
+    else if (value instanceof u8) return u256.fromU64(<u64>value);
+    else if (value instanceof i16) return u256.fromI64(<i64>value);
+    else if (value instanceof u16) return u256.fromU64(<u64>value);
+    else if (value instanceof i32) return u256.fromI64(<i64>value);
+    else if (value instanceof u32) return u256.fromU64(<u64>value);
+    else if (value instanceof i64) return u256.fromI64(<i64>value);
+    else if (value instanceof u64) return u256.fromU64(<u64>value);
+    else if (value instanceof f32) return u256.fromF64(<f64>value);
+    else if (value instanceof f64) return u256.fromF64(<f64>value);
+    else if (value instanceof u128) return u256.fromU128(<u128>value);
+    else if (value instanceof u256) return u256.fromU256(<u256>value);
+    else if (value instanceof u8[]) return u256.fromBytes(<u8[]>value);
+    else if (value instanceof Uint8Array) return u256.fromBytes(<Uint8Array>value);
+    else throw new TypeError("Unsupported generic type");
+  }
+
+  /**
+   * Parses a string in decimal or hexadecimal format into a \`u256\`.
+   * @param {string} str - The input string.
+   * @param {i32} [radix=10] - The base (10 for decimal, 16 for hexadecimal).
+   * @returns {u256} - The resulting \`u256\`.
+   */
+  @inline
+  static fromString(str: string, radix: i32 = 10): u256 {
+    assert(radix == 10 || radix == 16, "radix must be 10 or 16");
+    let len = str.length;
+    if (len == 0) return u256.Zero;
+    let result = u256.Zero; // Use cached Zero
+    if (radix == 10) {
+      for (let i = 0; i < len; i++) {
+        let c = str.charCodeAt(i);
+        assert(c >= 0x30 && c <= 0x39, "Invalid decimal digit");
+        let digit: u64 = c - 0x30;
+        result = result * u256.from(10) + u256.from(digit);
+      }
+    } else {
+      for (let i = 0; i < len; i++) {
+        let c = str.charCodeAt(i);
+        let digit: u64 = 0;
+        if (c >= 0x30 && c <= 0x39) digit = c - 0x30;
+        else if (c >= 0x41 && c <= 0x46) digit = c - 0x41 + 10;
+        else if (c >= 0x61 && c <= 0x66) digit = c - 0x61 + 10;
+        else assert(false, "Invalid hexadecimal digit");
+        result = result * u256.from(16) + u256.from(digit);
+      }
+    }
+    return result;
+  }
+
+  /**
+   * Checks if a given \`u256\` value is zero using the \`!\` operator.
+   * @param {u256} value - The \`u256\` to check.
+   * @returns {boolean} - True if zero, false otherwise.
+   */
+  @inline @operator.prefix('!')
+  static isEmpty(value: u256): bool {
+    return value.isZero();
+  }
+
+  /**
+   * Adds two \`u256\` values and returns a new \`u256\` with the sum.
+   * @param {u256} a - The first \`u256\` addend.
+   * @param {u256} b - The second \`u256\` addend.
+   * @returns {u256} - The sum of \`a\` and \`b\`.
+   */
+  @operator('+')
+  static add(a: u256, b: u256): u256 {
+    let lo1 = add64Local(a.lo1, b.lo1, 0);
+    let c1 = __u256carry;
+    let lo2 = add64Local(a.lo2, b.lo2, c1);
+    let c2 = __u256carry;
+    let hi1 = add64Local(a.hi1, b.hi1, c2);
+    let c3 = __u256carry;
+    let hi2 = add64Local(a.hi2, b.hi2, c3);
+    return new u256(lo1, lo2, hi1, hi2);
+  }
+
+  /**
+   * Divides \`a\` by \`b\` (integer division).
+   * @param {u256} a - The dividend.
+   * @param {u256} b - The divisor.
+   * @throws {Error} If \`b\` is zero.
+   * @returns {u256} - The quotient of the division.
+   * Optimized Division.
+   * Performs division in-place on clones to minimize object allocation.
+   */
+  @operator('/')
+  public static div(a: u256, b: u256): u256 {
+    if (b.isZero()) throw new Error('Division by zero');
+    if (a.isZero() || u256.lt(a, b)) return u256.Zero; // Return cached Zero
+    if (u256.eq(a, b)) return u256.One; // Return cached One
+
+    // Clone to mutate in-place
+    let n = a.clone();
+    let d = b.clone();
+    let result = u256.Zero.clone(); // Start with fresh Zero
+
+    const shift = u256.clz(d) - u256.clz(n);
+
+    // Shift d left by 'shift'
+    // Since d is a clone, we can mutate/reassign it
+    d = u256.shl(d, shift);
+
+    // Unrolled restore division
+    for (let i = shift; i >= 0; i--) {
+      if (u256.ge(n, d)) {
+        n.subAssign(d); // In-place subtract
+        result.orAssignBit(i); // In-place bit set
+      }
+      d.rshiftOne(); // In-place right shift by 1
+    }
+    return result;
+  }
+
+  /**
+   * Left-shifts a \`u256\` by the specified number of bits.
+   * @param {u256} value - The \`u256\` to shift.
+   * @param {i32} shift - The number of bits to shift (modulo 256).
+   * @returns {u256} - The shifted \`u256\`.
+   * Optimized Left Shift (Massacred allocation overhead).
+   * Unrolls the logic into local variables to avoid Array<u64> allocation.
+   */
+  @operator('<<')
+  public static shl(value: u256, shift: i32): u256 {
+    if (shift <= 0) return shift == 0 ? value.clone() : u256.Zero; // Return cached
+    if (shift >= 256) return u256.Zero; // Return cached
+
+    shift &= 255;
+
+    const bits = 64;
+    const segShift = (shift / bits) | 0;
+    const bitShift = shift % bits;
+    const invShift = bits - bitShift;
+
+    let r0: u64 = 0, r1: u64 = 0, r2: u64 = 0, r3: u64 = 0;
+    const i0 = value.lo1, i1 = value.lo2, i2 = value.hi1, i3 = value.hi2;
+
+    if (segShift == 0) {
+      r0 = i0 << bitShift;
+      r1 = (i1 << bitShift) | (bitShift == 0 ? 0 : i0 >>> invShift);
+      r2 = (i2 << bitShift) | (bitShift == 0 ? 0 : i1 >>> invShift);
+      r3 = (i3 << bitShift) | (bitShift == 0 ? 0 : i2 >>> invShift);
+    } else if (segShift == 1) {
+      r1 = i0 << bitShift;
+      r2 = (i1 << bitShift) | (bitShift == 0 ? 0 : i0 >>> invShift);
+      r3 = (i2 << bitShift) | (bitShift == 0 ? 0 : i1 >>> invShift);
+    } else if (segShift == 2) {
+      r2 = i0 << bitShift;
+      r3 = (i1 << bitShift) | (bitShift == 0 ? 0 : i0 >>> invShift);
+    } else if (segShift == 3) {
+      r3 = i0 << bitShift;
+    }
+
+    return new u256(r0, r1, r2, r3);
+  }
+
+  /**
+   * Subtracts \`b\` from \`a\` and returns a new \`u256\`.
+   * @param {u256} a - The minuend.
+   * @param {u256} b - The subtrahend.
+   * @returns {u256} - The difference \`a - b\`.
+   */
+  @operator('-')
+  static sub(a: u256, b: u256): u256 {
+    let lo1 = sub64(a.lo1, b.lo1, 0);
+    let b1 = __u256carrySub;
+    let lo2 = sub64(a.lo2, b.lo2, b1);
+    let b2 = __u256carrySub;
+    let hi1 = sub64(a.hi1, b.hi1, b2);
+    let b3 = __u256carrySub;
+    let hi2 = sub64(a.hi2, b.hi2, b3);
+    return new u256(lo1, lo2, hi1, hi2);
+  }
+
+  /**
+   * Bitwise OR between two \`u256\` values.
+   * @param {u256} a - The first operand.
+   * @param {u256} b - The second operand.
+   * @returns {u256} - The bitwise OR result.
+   */
+  @inline @operator('|')
+  static or(a: u256, b: u256): u256 {
+    return new u256(a.lo1 | b.lo1, a.lo2 | b.lo2, a.hi1 | b.hi1, a.hi2 | b.hi2);
+  }
+
+  /**
+   * Bitwise XOR between two \`u256\` values.
+   * @param {u256} a - The first operand.
+   * @param {u256} b - The second operand.
+   * @returns {u256} - The bitwise XOR result.
+   */
+  @inline @operator('^')
+  static xor(a: u256, b: u256): u256 {
+    return new u256(a.lo1 ^ b.lo1, a.lo2 ^ b.lo2, a.hi1 ^ b.hi1, a.hi2 ^ b.hi2);
+  }
+
+  /**
+   * Bitwise AND between two \`u256\` values.
+   * @param {u256} a - The first operand.
+   * @param {u256} b - The second operand.
+   * @returns {u256} - The bitwise AND result.
+   */
+  @inline @operator('&')
+  static and(a: u256, b: u256): u256 {
+    return new u256(a.lo1 & b.lo1, a.lo2 & b.lo2, a.hi1 & b.hi1, a.hi2 & b.hi2);
+  }
+
+  /**
+   * Right-shifts a \`u256\` by the specified number of bits (logical shift).
+   * @param {u256} value - The \`u256\` to shift.
+   * @param {i32} shift - The number of bits to shift (modulo 256).
+   * @returns {u256} - The shifted \`u256\`.
+   */
+  @operator('>>')
+  static shr(value: u256, shift: i32): u256 {
+    // If shift <= 0 => shift=0 means "no shift," shift<0 is arguably invalid.
+    // We just return a if shift=0, else zero if negative. Adjust to your preference.
+    if (shift <= 0) {
+      return shift == 0 ? value.clone() : u256.Zero;
+    }
+
+    // If shift >= 256 => the result is zero for a 256-bit integer
+    if (shift >= 256) {
+      return u256.Zero;
+    }
+
+    // Now shift is in [1..255]
+    // Some code likes to do shift &= 255; but after the above check, it\u2019s no longer necessary.
+    // We'll keep it for consistency:
+    shift &= 255;
+
+    // If after masking shift is 0, that means the original shift was multiple of 256, but we handled it above
+    if (shift == 0) return value.clone();
+
+    const w = shift >>> 6; // how many full 64-bit words to drop
+    const b = shift & 63;  // how many bits to shift within a word
+
+    let lo1 = value.lo1;
+    let lo2 = value.lo2;
+    let hi1 = value.hi1;
+    let hi2 = value.hi2;
+
+    // Shift words down by w words
+    if (w >= 4) return u256.Zero; // Return cached
+    else if (w == 3) { lo1 = hi2; lo2 = 0; hi1 = 0; hi2 = 0; }
+    else if (w == 2) { lo1 = hi1; lo2 = hi2; hi1 = 0; hi2 = 0; }
+    else if (w == 1) { lo1 = lo2; lo2 = hi1; hi1 = hi2; hi2 = 0; }
+
+    // Now apply the bit shift b
+    if (b > 0) {
+      const invB = 64 - b;
+      lo1 = (lo1 >>> b) | (lo2 << invB);
+      lo2 = (lo2 >>> b) | (hi1 << invB);
+      hi1 = (hi1 >>> b) | (hi2 << invB);
+      hi2 = hi2 >>> b;
+    }
+
+    return new u256(lo1, lo2, hi1, hi2);
+  }
+
+  /**
+   * Unsigned right shift operator (same as \`shr\` for \`u256\`).
+   * @param {u256} value - The \`u256\` to shift.
+   * @param {i32} shift - The number of bits to shift (modulo 256).
+   * @returns {u256} - The shifted \`u256\`.
+   */
+  @inline @operator('>>>')
+  static shr_u(value: u256, shift: i32): u256 {
+    return u256.shr(value, shift);
+  }
+
+  /**
+   * Checks if two \`u256\` values are equal.
+   * @param {u256} a - The first operand.
+   * @param {u256} b - The second operand.
+   * @returns {boolean} - True if the two values are equal, otherwise false.
+   */
+  @inline @operator('==')
+  static eq(a: u256, b: u256): bool {
+    return a.lo1 == b.lo1 && a.lo2 == b.lo2 && a.hi1 == b.hi1 && a.hi2 == b.hi2;
+  }
+
+  /**
+   * Checks if two \`u256\` values are not equal.
+   * @param {u256} a - The first operand.
+   * @param {u256} b - The second operand.
+   * @returns {boolean} - True if the two values differ, otherwise false.
+   */
+  @inline @operator('!=')
+  static ne(a: u256, b: u256): bool {
+    return !u256.eq(a, b);
+  }
+
+  /**
+   * Checks if \`a < b\`.
+   * @param {u256} a - The first operand.
+   * @param {u256} b - The second operand.
+   * @returns {boolean} - True if \`a\` is less than \`b\`, otherwise false.
+   */
+  @operator('<')
+  static lt(a: u256, b: u256): bool {
+    if (a.hi2 != b.hi2) return a.hi2 < b.hi2;
+    if (a.hi1 != b.hi1) return a.hi1 < b.hi1;
+    if (a.lo2 != b.lo2) return a.lo2 < b.lo2;
+    return a.lo1 < b.lo1;
+  }
+
+  @inline @operator('>')
+  static gt(a: u256, b: u256): bool { return b < a; }
+  @inline @operator('<=')
+  static le(a: u256, b: u256): bool { return !u256.gt(a, b); }
+  @inline @operator('>=')
+  static ge(a: u256, b: u256): bool { return !u256.lt(a, b); }
+
+  @inline @operator('*')
+  static mul(a: u256, b: u256): u256 {
+    return __mul256(a.lo1, a.lo2, a.hi1, a.hi2, b.lo1, b.lo2, b.hi1, b.hi2);
+  }
+
+  /**
+   * Counts the number of set bits (1s) in the \`u256\`.
+   * @param {u256} value - The \`u256\` to count bits for.
+   * @returns {i32} - The number of bits set to 1.
+   */
+  @inline
+  static popcnt(value: u256): i32 {
+    return <i32>(popcnt(value.lo1) + popcnt(value.lo2) + popcnt(value.hi1) + popcnt(value.hi2));
+  }
+
+  /**
+   * Counts leading zeros in the \`u256\`.
+   * @param {u256} value - The \`u256\` to evaluate.
+   * @returns {i32} - The number of leading zero bits.
+   */
+  @inline
+  static clz(value: u256): i32 {
+    if (value.hi2) return <i32>clz(value.hi2);
+    if (value.hi1) return <i32>(clz(value.hi1) + 64);
+    if (value.lo2) return <i32>(clz(value.lo2) + 128);
+    if (value.lo1) return <i32>(clz(value.lo1) + 192);
+    return 256;
+  }
+
+  /**
+   * Counts trailing zeros in the \`u256\`.
+   * @param {u256} value - The \`u256\` to evaluate.
+   * @returns {i32} - The number of trailing zero bits.
+   */
+  @inline
+  static ctz(value: u256): i32 {
+    if (value.lo1) return <i32>ctz(value.lo1);
+    if (value.lo2) return <i32>(ctz(value.lo2) + 64);
+    if (value.hi1) return <i32>(ctz(value.hi1) + 128);
+    if (value.hi2) return <i32>(ctz(value.hi2) + 192);
+    return 256;
+  }
+
+  /**
+   * Sets the value of this \`u256\` to another \`u256\`.
+   * @param {u256} value - The source \`u256\`.
+   * @returns {this} - The current instance.
+   */
+  @inline
+  set(value: u256): this {
+    this.lo1 = value.lo1; this.lo2 = value.lo2; this.hi1 = value.hi1; this.hi2 = value.hi2;
+    return this;
+  }
+
+  /**
+   * Sets the lower 128 bits of this \`u256\` from a \`u128\`, resetting the higher 128 bits to zero.
+   * @param {u128} value - The source 128-bit unsigned integer.
+   * @returns {this} - The current instance.
+   */
+  @inline
+  setU128(value: u128): this {
+    this.lo1 = value.lo; this.lo2 = value.hi; this.hi1 = 0; this.hi2 = 0;
+    return this;
+  }
+
+  /**
+   * Sets this \`u256\` to the sign-extended value of a 64-bit signed integer.
+   * @param {i64} value - The 64-bit signed integer.
+   * @returns {this} - The current instance.
+   */
+  @inline
+  setI64(value: i64): this {
+    let mask: u64 = value >> 63;
+    this.lo1 = <u64>value; this.lo2 = mask; this.hi1 = mask; this.hi2 = mask;
+    return this;
+  }
+
+  /**
+   * Sets this \`u256\` to the specified 64-bit unsigned integer, clearing higher bits.
+   * @param {u64} value - The 64-bit unsigned integer.
+   * @returns {this} - The current instance.
+   */
+  @inline
+  setU64(value: u64): this {
+    this.lo1 = value; this.lo2 = 0; this.hi1 = 0; this.hi2 = 0;
+    return this;
+  }
+
+  /**
+   * Sets this \`u256\` to the sign-extended value of a 32-bit signed integer.
+   * @param {i32} value - The 32-bit signed integer.
+   * @returns {this} - The current instance.
+   */
+  @inline
+  setI32(value: i32): this {
+    let mask: u64 = value >> 63;
+    this.lo1 = value; this.lo2 = mask; this.hi1 = mask; this.hi2 = mask;
+    return this;
+  }
+
+  /**
+   * Sets this \`u256\` to the specified 32-bit unsigned integer, clearing higher bits.
+   * @param {u32} value - The 32-bit unsigned integer.
+   * @returns {this} - The current instance.
+   */
+  @inline
+  setU32(value: u32): this {
+    this.lo1 = value; this.lo2 = 0; this.hi1 = 0; this.hi2 = 0;
+    return this;
+  }
+
+  /**
+   * Checks if this \`u256\` is equal to zero.
+   * @returns {boolean} - True if zero, false otherwise.
+   */
+  @inline
+  isZero(): bool {
+    return !(this.lo1 | this.lo2 | this.hi1 | this.hi2);
+  }
+
+  /**
+   * Performs a bitwise NOT operation (\`~\`) on the current \`u256\`.
+   * @returns {u256} - A new \`u256\` with inverted bits.
+   */
+  @inline @operator.prefix('~')
+  not(): u256 {
+    return new u256(~this.lo1, ~this.lo2, ~this.hi1, ~this.hi2);
+  }
+
+  /**
+   * A unary plus operator, returning the current \`u256\` without changes.
+   * @returns {u256} - The current \`u256\`.
+   */
+  @inline @operator.prefix('+')
+  pos(): u256 { return this; }
+
+  /**
+   * A unary negation operator (\`-x\`), computed as \`~x + 1\`.
+   * @returns {u256} - A new \`u256\` representing the negated value (mod 2^256).
+   */
+  @operator.prefix('-')
+  neg(): u256 {
+    let lo1 = ~this.lo1, lo2 = ~this.lo2, hi1 = ~this.hi1, hi2 = ~this.hi2;
+    let sum = lo1 + 1;
+    let carry = (sum < lo1) ? 1 : 0;
+    lo1 = sum;
+    sum = lo2 + carry;
+    carry = (sum < lo2) ? 1 : 0;
+    lo2 = sum;
+    sum = hi1 + carry;
+    carry = (sum < hi1) ? 1 : 0;
+    hi1 = sum;
+    hi2 = hi2 + carry;
+    return new u256(lo1, lo2, hi1, hi2);
+  }
+
+  @operator.prefix("++")
+  public preInc(): this {
+    let sum = this.lo1 + 1;
+    let carry = sum < this.lo1 ? 1 : 0;
+    this.lo1 = sum;
+    sum = this.lo2 + carry;
+    carry = sum < this.lo2 ? 1 : 0;
+    this.lo2 = sum;
+    sum = this.hi1 + carry;
+    carry = sum < this.hi1 ? 1 : 0;
+    this.hi1 = sum;
+    this.hi2 += carry;
+    return this;
+  }
+
+  @operator.prefix("--")
+  public preDec(): this {
+    let diff = this.lo1 - 1;
+    let borrow = (diff > this.lo1) ? 1 : 0;
+    this.lo1 = diff;
+    diff = this.lo2 - borrow;
+    borrow = (diff > this.lo2) ? 1 : 0;
+    this.lo2 = diff;
+    diff = this.hi1 - borrow;
+    borrow = (diff > this.hi1) ? 1 : 0;
+    this.hi1 = diff;
+    this.hi2 -= borrow;
+    return this;
+  }
+
+  @inline @operator.postfix('++')
+  postInc(): u256 { return this.clone().preInc(); }
+
+  @inline @operator.postfix('--')
+  postDec(): u256 { return this.clone().preDec(); }
+
+  /**
+   * Converts this \`u256\` to a generic type \`T\`.
+   * Supported types: bool, i8, u8, i16, u16, i32, u32, i64, u64, i128, u128, u256, u8[], Uint8Array, StaticArray<u8>, string.
+   * @returns {T} - The converted value.
+   */
+  @inline
+  as<T>(): T {
+    if (isReference<T>()) {
+      let typeName = nameof<T>();
+      if (typeName.indexOf("Array<u8>") >= 0) return changetype<T>(this.toBytes());
+      else if (typeName.indexOf("Uint8Array") >= 0) return changetype<T>(this.toUint8Array());
+      else if (typeName.indexOf("StaticArray<u8>") >= 0) return changetype<T>(this.toStaticBytes());
+      else if (typeName.indexOf("String") >= 0) return changetype<T>(this.toString());
+      else if (typeName.indexOf("u128") >= 0) return changetype<T>(this.toU128());
+      else if (typeName.indexOf("i128") >= 0) return changetype<T>(this.toI128());
+      else if (typeName.indexOf("u256") >= 0) return changetype<T>(this.toU256());
+      else throw new TypeError(\`Unsupported generic type \${typeName}\`);
+    } else {
+      if (isInteger<T>()) {
+        if (sizeof<T>() == 1) return <T><u64>this.toU64();
+        else if (sizeof<T>() == 2) return <T><u64>this.toU64();
+        else if (sizeof<T>() == 4) return <T><u64>this.toU64();
+        else if (sizeof<T>() == 8) return <T>this.toU64();
+        else throw new TypeError(\`Unsupported generic type \${nameof<T>()}\`);
+      } else if (isFloat<T>()) {
+        return <T><f64>this.toU64();
+      } else {
+        // bool
+        return <T>this.toBool();
+      }
+    }
+  }
+
+  /**
+   * Converts this \`u256\` to a signed 128-bit integer (i128).
+   * The highest bit of the 256-bit value is sign bit for i128.
+   * @returns {i128} - The resulting \`i128\`.
+   */
+  @inline
+  toI128(): i128 {
+    return new i128(this.lo1, (this.lo2 & 0x7FFFFFFFFFFFFFFF) | (this.hi2 & 0x8000000000000000));
+  }
+
+  /**
+   * Converts this \`u256\` to an unsigned 128-bit integer (u128).
+   * Truncates higher bits.
+   * @returns {u128} - The resulting \`u128\`.
+   */
+  @inline
+  toU128(): u128 { return new u128(this.lo1, this.lo2); }
+
+  /**
+   * Returns this \`u256\` itself, effectively a no-op for \`u256\`.
+   * @returns {u256} - The current \`u256\`.
+   */
+  @inline
+  toU256(): this { return this; }
+
+  /**
+   * Converts this \`u256\` to a signed 64-bit integer (i64).
+   * Truncates and treats the highest bit of the 256-bit as sign.
+   * @returns {i64} - The resulting 64-bit signed integer.
+   */
+  @inline
+  toI64(): i64 { return <i64>( (this.lo1 & 0x7FFFFFFFFFFFFFFF) | (this.hi2 & 0x8000000000000000) ); }
+
+  /**
+   * Converts this \`u256\` to an unsigned 64-bit integer (u64).
+   * Truncates higher bits.
+   * @returns {u64} - The resulting 64-bit unsigned integer.
+   */
+  @inline
+  toU64(): u64 { return this.lo1; }
+
+  /**
+   * Converts this \`u256\` to a signed 32-bit integer (i32).
+   * @returns {i32} - The resulting 32-bit signed integer.
+   */
+  @inline
+  toI32(): i32 { return <i32>this.toI64(); }
+
+  /**
+   * Converts this \`u256\` to an unsigned 32-bit integer (u32).
+   * Truncates higher bits.
+   * @returns {u32} - The resulting 32-bit unsigned integer.
+   */
+  @inline
+  toU32(): u32 { return <u32>this.lo1; }
+
+  /**
+   * Checks if the \`u256\` is non-zero, then returns \`true\`; otherwise \`false\`.
+   * @returns {boolean} - True if non-zero, otherwise false.
+   */
+  @inline
+  toBool(): bool { return <bool>(this.lo1 | this.lo2 | this.hi1 | this.hi2); }
+
+  /**
+   * Converts this \`u256\` to an array of 32 bytes (u8[]).
+   * @param {boolean} [bigEndian=false] - Output in big-endian if true, else little-endian.
+   * @returns {u8[]} - The resulting byte array.
+   */
+  @inline
+  toBytes(bigEndian: bool = false): u8[] {
+    let result = new Array<u8>(32);
+    this.toArrayBuffer(changetype<usize>(result.dataStart), bigEndian);
+    return result;
+  }
+
+  /**
+   * Converts this \`u256\` to a static array of 32 bytes (StaticArray<u8>).
+   * @param {boolean} [bigEndian=false] - Output in big-endian if true, else little-endian.
+   * @returns {StaticArray<u8>} - The resulting static byte array.
+   */
+  @inline
+  toStaticBytes(bigEndian: bool = false): StaticArray<u8> {
+    let result = new StaticArray<u8>(32);
+    this.toArrayBuffer(changetype<usize>(result), bigEndian);
+    return result;
+  }
+
+  /**
+   * Converts this \`u256\` to a \`Uint8Array\` of length 32.
+   * @param {boolean} [bigEndian=false] - Output in big-endian if true, else little-endian.
+   * @returns {Uint8Array} - The resulting \`Uint8Array\`.
+   */
+  @inline
+  toUint8Array(bigEndian: bool = false): Uint8Array {
+    let result = new Uint8Array(32);
+    this.toArrayBuffer(changetype<usize>(result.dataStart), bigEndian);
+    return result;
+  }
+
+  /**
+   * Creates and returns a clone (deep copy) of this \`u256\`.
+   * @returns {u256} - A new \`u256\` instance with the same value.
+   */
+  clone(): u256 { return new u256(this.lo1, this.lo2, this.hi1, this.hi2); }
+
+  /**
+   * Converts this \`u256\` to a string in either decimal or hexadecimal format.
+   * @param {i32} [radix=10] - The base (10 or 16).
+   * @throws {Error} If \`radix\` is not 10 or 16.
+   * @returns {string} - The string representation of the \`u256\`.
+   */
+  toString(radix: i32 = 10): string {
+    assert(radix == 10 || radix == 16, 'radix argument must be between 10 or 16');
+    if (this.isZero()) return '0';
+    if (radix == 16) {
+      let result = '';
+      let shift: i32 = 252 - (u256.clz(this) & ~3);
+      while (shift >= 0) {
+        // @ts-ignore
+        result += HEX_CHARS.charAt(<i32>((this >> shift).lo1 & 15));
+        shift -= 4;
+      }
+      return result;
+    }
+    return u256toDecimalString(this);
+  }
+
+  /**
+   * @private
+   * Stores this \`u256\` into a buffer in little-endian format.
+   * @param {usize} buffer - The buffer start pointer.
+   */
+  // --- INTERNAL HELPERS FOR DIV OPTIMIZATION ---
+  // These allow in-place mutation to avoid allocations inside the div loop.
+
+  /** In-place subtraction. Assumes this >= other. */
+  @inline
+  private subAssign(other: u256): void {
+    let lo1 = sub64(this.lo1, other.lo1, 0);
+    let b1 = __u256carrySub;
+    let lo2 = sub64(this.lo2, other.lo2, b1);
+    let b2 = __u256carrySub;
+    let hi1 = sub64(this.hi1, other.hi1, b2);
+    let b3 = __u256carrySub;
+    let hi2 = sub64(this.hi2, other.hi2, b3);
+    this.lo1 = lo1; this.lo2 = lo2; this.hi1 = hi1; this.hi2 = hi2;
+  }
+
+  /** In-place bit set: this |= (1 << bit) */
+  @inline
+  private orAssignBit(bit: i32): void {
+    const bits = 64;
+    const seg = (bit / bits) | 0;
+    const shift = bit % bits;
+    // FIX: Explicitly cast literal 1 to u64 to ensure proper 64-bit shifting
+    const mask: u64 = <u64>1 << shift;
+    if (seg == 0) this.lo1 |= mask;
+    else if (seg == 1) this.lo2 |= mask;
+    else if (seg == 2) this.hi1 |= mask;
+    else if (seg == 3) this.hi2 |= mask;
+  }
+
+  /** In-place right shift by 1. */
+  @inline
+  private rshiftOne(): void {
+    this.lo1 = (this.lo1 >>> 1) | (this.lo2 << 63);
+    this.lo2 = (this.lo2 >>> 1) | (this.hi1 << 63);
+    this.hi1 = (this.hi1 >>> 1) | (this.hi2 << 63);
+    this.hi2 = (this.hi2 >>> 1);
+  }
+
+  @inline
+  private toArrayBufferLE(buffer: usize): void {
+    store<u64>(buffer, this.lo1, 0);
+    store<u64>(buffer, this.lo2, 8);
+    store<u64>(buffer, this.hi1, 16);
+    store<u64>(buffer, this.hi2, 24);
+  }
+
+  /**
+   * @private
+   * Stores this \`u256\` into a buffer in big-endian format.
+   * @param {usize} buffer - The buffer start pointer.
+   */
+  @inline
+  private toArrayBufferBE(buffer: usize): void {
+    store<u64>(buffer, bswap(this.hi2), 0);
+    store<u64>(buffer, bswap(this.hi1), 8);
+    store<u64>(buffer, bswap(this.lo2), 16);
+    store<u64>(buffer, bswap(this.lo1), 24);
+  }
+
+  /**
+   * @private
+   * Stores this \`u256\` into a buffer in either little-endian or big-endian format.
+   * @param {usize} buffer - The buffer start pointer.
+   * @param {boolean} [bigEndian=false] - Use big-endian if true, else little-endian.
+   */
+  @inline
+  private toArrayBuffer(buffer: usize, bigEndian: bool = false): void {
+    if (bigEndian) this.toArrayBufferBE(buffer);
+    else this.toArrayBufferLE(buffer);
+  }
+}
+`,"bignum/utils":`import { CharCode } from "util/string";
+import { u128 } from "./integer/u128";
+import { u256 } from "./integer/u256";
+
+// @ts-ignore: decorator
+@lazy const MaxBaseForExponent128 = memory.data<u64>([
+  u64.MAX_VALUE,       // 0
+  u64.MAX_VALUE,       // 1
+  u64.MAX_VALUE,       // 2
+  0x000006597FA94F5B,  // 3
+  0x00000000FFFFFFFF,  // 4
+  0x0000000003080C00,  // 5
+  0x0000000000285145,  // 6
+  0x000000000004E045,  // 7
+  0x000000000000FFFF,  // 8
+  0x0000000000004AA8,  // 9
+  0x0000000000001BDB,  // 10
+  0x0000000000000C6F,  // 11
+  0x0000000000000659,  // 12
+  0x0000000000000398,  // 13
+  0x0000000000000235,  // 14
+  0x0000000000000172,  // 15
+  0x00000000000000FF,  // 16
+  0x00000000000000B8,  // 17
+  0x000000000000008A,  // 18
+  0x000000000000006A,  // 19
+  0x0000000000000054,  // 20
+  0x0000000000000044,  // 21
+  0x0000000000000038,  // 22
+  0x000000000000002F,  // 23
+  0x0000000000000028,  // 24
+  0x0000000000000022,  // 25
+  0x000000000000001E,  // 26
+  0x000000000000001A,  // 27
+  0x0000000000000017,  // 28
+  0x0000000000000015,  // 29
+  0x0000000000000013,  // 30
+  0x0000000000000011,  // 31
+  0x000000000000000F,  // 32
+  0x000000000000000E,  // 33
+  0x000000000000000D,  // 34
+  0x000000000000000C,  // 35
+  0x000000000000000B,  // 36
+  0x000000000000000B,  // 37
+  0x000000000000000A,  // 38
+]);
+
+// Use LUT wrapped by function for lazy compilation
+// @ts-ignore: decorator
+@lazy const RadixCharsTable = memory.data<u8>([
+  0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 36, 36, 36, 36, 36, 36,
+  36, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
+  25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 36, 36, 36, 36,
+  36, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
+  25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35
+]);
+
+// @ts-ignore: decorator
+@inline export function isPowerOverflow128(base: u128, exponent: i32): bool {
+  // never overflow
+  if (exponent <= 1 || base <= u128.One) {
+    return false;
+  }
+  // always overflow
+  if (base.hi != 0 || exponent >= 128) {
+    return true;
+  }
+  var low = base.lo;
+  if (low <= 10) {
+    switch (<i32>low) {
+      case 2:
+        return exponent > 127;
+      case 3:
+        return exponent > 80;
+      case 4:
+        return exponent > 63;
+      case 5:
+        return exponent > 55;
+      case 6:
+        return exponent > 49;
+      case 7:
+        return exponent > 45;
+      case 8:
+        return exponent > 42;
+      case 9:
+        return exponent > 40;
+      case 10:
+        return exponent > 38;
+    }
+  }
+  if (exponent >= 38) return true;
+  return low > load<u64>(MaxBaseForExponent128 + (exponent << 3));
+}
+
+// helper function for utoa
+function processU64(digits: Uint8Array, value: u64): void {
+  var length = digits.length - 1;
+  for (let i = 63; i != -1; --i) {
+    for (let j = 0; j <= length; ++j) {
+      unchecked(digits[j] += (u8(digits[j] >= 5) * 3));
+    }
+    for (let j = length; j != -1; --j) {
+      let d = unchecked(digits[j]) << 1;
+      if (j < length) unchecked(digits[j + 1] |= u8(d > 15));
+      unchecked(digits[j] = d & 15);
+    }
+    unchecked(digits[0] += u8((value & (1 << i)) != 0));
+  }
+}
+
+export function u128toDecimalString(value: u128): string {
+  var length = 40;
+  var digits = new Uint8Array(length);
+  var result = "", start = false;
+
+  processU64(digits, value.hi);
+  processU64(digits, value.lo);
+
+  for (let i = length - 1; i != -1; --i) {
+    let d = unchecked(digits[i]);
+    if (!start && d != 0) start = true;
+    if (start) {
+      assert(<u32>d <= 9);
+      result += String.fromCharCode(0x30 + d);
+    }
+  }
+  return result;
+}
+
+export function u256toDecimalString(value: u256): string {
+  var length = 78;
+  var digits = new Uint8Array(length);
+  var result = "", start = false;
+
+  processU64(digits, value.hi2);
+  processU64(digits, value.hi1);
+  processU64(digits, value.lo2);
+  processU64(digits, value.lo1);
+
+  for (let i = length - 1; i != -1; --i) {
+    let d = unchecked(digits[i]);
+    if (!start && d != 0) start = true;
+    if (start) {
+      assert(<u32>d <= 9);
+      result += String.fromCharCode(0x30 + d);
+    }
+  }
+  return result;
+}
+
+export function atou128(str: string, radix: i32 = 10): u128 {
+  if (radix < 2 || radix > 36) {
+    throw new Error("Invalid radix");
+  }
+  var len = str.length;
+  if (!len) return u128.Zero;
+
+  var first = str.charCodeAt(0);
+  if (len == 1 && first == CharCode._0) {
+    return u128.Zero;
+  }
+  var isNeg = first == CharCode.MINUS;
+  // @ts-ignore
+  var index = i32(isNeg | (first == CharCode.PLUS));
+
+  if (str.charCodeAt(index) == CharCode._0) {
+    let second = str.charCodeAt(++index);
+    if ((second | 32) == CharCode.x) {
+      radix = 16;
+      ++index;
+    } else if ((second | 32) == CharCode.o) {
+      radix = 8;
+      ++index;
+    } else if ((second | 32) == CharCode.b) {
+      radix = 2;
+      ++index;
+    } else if (second == CharCode._0) {
+      // skip leading zeros
+      while (index < len && str.charCodeAt(index) == CharCode._0) ++index;
+    }
+  }
+  var result = u128.Zero;
+  var table = RadixCharsTable;
+
+  if (index >= len) return result;
+
+  if (ASC_SHRINK_LEVEL >= 1) {
+    let radix128 = u128.fromU64(radix);
+    do {
+      let n: u32 = str.charCodeAt(index) - CharCode._0;
+      if (n > <u32>(CharCode.z - CharCode._0)) break;
+
+      let num = load<u8>(table + n);
+      if (num >= <u8>radix) break;
+
+      // @ts-ignore
+      result *= radix128;
+      // @ts-ignore
+      result += u128.fromU64(num);
+    } while (++index < len);
+  } else {
+    switch (radix) {
+      case 2: {
+        do {
+          let num: u32 = str.charCodeAt(index) - CharCode._0;
+          if (num >= 2) break;
+          // @ts-ignore
+          result <<= 1;
+          // @ts-ignore
+          result |= u128.fromU64(num);
+        } while (++index < len);
+        break;
+      }
+      case 10: {
+        do {
+          let num: u32 = str.charCodeAt(index) - CharCode._0;
+          if (num >= 10) break;
+          // @ts-ignore
+          result = (result << 3) + (result << 1);
+          // @ts-ignore
+          result += u128.fromU64(num);
+        } while (++index < len);
+        break;
+      }
+      case 16: {
+        do {
+          let n: u32 = str.charCodeAt(index) - CharCode._0;
+          if (n > <u32>(CharCode.z - CharCode._0)) break;
+
+          let num = load<u8>(table + n);
+          if (num >= 16) break;
+
+          // @ts-ignore
+          result <<= 4;
+          // @ts-ignore
+          result |= u128.fromU64(num);
+        } while (++index < len);
+        break;
+      }
+      default: {
+        let radix128 = u128.fromU64(radix);
+        do {
+          let n: u32 = str.charCodeAt(index) - CharCode._0;
+          if (n > <u32>(CharCode.z - CharCode._0)) break;
+
+          let num = load<u8>(table + n);
+          if (num >= <u8>radix) break;
+
+          // @ts-ignore
+          result *= radix128;
+          // @ts-ignore
+          result += u128.fromU64(num);
+        } while (++index < len);
+        break;
+      }
+    }
+  }
+  // @ts-ignore
+  return isNeg ? -result : result;
+}
 `,"bindings/asyncify":`@unmanaged
 export class StackDescriptor {
   /** The index in linear memory of the start of the \u201Casyncify stack\u201D. */
@@ -13470,22 +16945,6 @@ export namespace table {
     throw new Error(E_NOTIMPLEMENTED);
   }
 }
-`,toilscript:`/**
- * ToilScript-native declarations.
- *
- * Compiler-level natives available everywhere with no import. \`@main\` is handled
- * directly by the ToilScript compiler \u2014 it exports the decorated top-level
- * function as the module's \`main\` entry \u2014 so this declaration exists only so
- * editors and type-checking recognize the decorator. Future zero-import toil
- * natives (globals/decorators) belong here too.
- */
-
-/**
- * Marks a single top-level function as the module entry point. The compiler
- * exports it as the WebAssembly export \`main\` \u2014 no \`export\` keyword needed.
- * Exactly one \`@main\` is allowed per module.
- */
-declare function main(): void;
 `,typedarray:`import { COMPARATOR, SORT } from "./util/sort";
 import { E_INDEXOUTOFRANGE, E_INVALIDLENGTH, E_NOTIMPLEMENTED } from "./util/error";
 import { joinIntegerArray, joinFloatArray } from "./util/string";
@@ -21121,7 +24580,7 @@ export abstract class V128 {
  *//***/
 
 /// <reference no-default-lib="true"/>
-/// <reference path="./toilscript.ts" />
+/// <reference path="./toilscript.d.ts" />
 
 // Types
 
@@ -24468,7 +27927,7 @@ declare interface Float64Array {
 // FIXME: remove
 declare function offsetof<T>(fieldName?: string): usize;
 declare function idof<T>(): u32;
-`};var xn={};Q(xn,{default:()=>pn});Dn(xn,Ut);import*as Ut from"binaryen";import{default as pn}from"binaryen";import*as At from"toilscript";var h=At,Pn=U.argv.indexOf("--wasm");if(~Pn){let e=String(U.argv[Pn+1]);U.argv.splice(Pn,2),h=await import(new URL(e,dn.pathToFileURL(U.cwd()+"/")))}var Vn=sn.createRequire(import.meta.url),Kn=U.platform==="win32",E=Kn?`\r
+`};var xn={};Q(xn,{default:()=>pn});Dn(xn,Mt);import*as Mt from"binaryen";import{default as pn}from"binaryen";import*as At from"toilscript";var h=At,Pn=M.argv.indexOf("--wasm");if(~Pn){let e=String(M.argv[Pn+1]);M.argv.splice(Pn,2),h=await import(new URL(e,dn.pathToFileURL(M.cwd()+"/")))}var Vn=sn.createRequire(import.meta.url),Kn=M.platform==="win32",E=Kn?`\r
 `:`
-`,jn=Kn?"\\":"/",_=".ts",_t=`.d${_}`,hn=new RegExp("\\"+_+"$"),Tt=new RegExp("^(?!.*\\.d\\"+_+"$).*\\"+_+"$");function Te(e){return e.replace(/-/g,"_").toUpperCase()}function Ct(e){return typeof e=="string"&&e!==""}var Xn=ve,zt=Y,P=Ee,X=Ae,Bt=_e,Be=3,Se=0;function qn(e,t=[]){return Object.keys(e||{}).forEach(n=>{let a=e[n],s=Y[n];s&&s.type==="b"?a&&t.push(`--${n}`):Array.isArray(a)?a.forEach(r=>{t.push(`--${n}`,String(r))}):t.push(`--${n}`,String(a))}),t}async function St(e,t={}){typeof e=="string"&&(e={[`input${_}`]:e});let n=["--outFile","binary","--textFile","text"];qn(t,n);let a={},s=await we(n.concat(Object.keys(e)),{readFile:r=>Object.prototype.hasOwnProperty.call(e,r)?e[r]:null,writeFile:(r,u)=>{a[r]=u},listFiles:()=>[]});return Object.assign(s,a)}async function we(e,t){Array.isArray(e)||(e=qn(e)),t||(t={});let n=t.stats||new Cn,a=n.begin(),s=0,r=0,u=0,f=(Xn||"").split(".");f.length===3&&(r=parseInt(f[0])|0,s=parseInt(f[1])|0,u=parseInt(f[2])|0);let p=t.stdout||Hn(),b=t.stderr||Hn(),d=t.readFile||ee,g=t.writeFile||te,y=t.listFiles||ie,m=ye(e,Y,!1),i=m.options;e=m.arguments;let zn=new nn(p),j=new nn(b);i.noColors&&(zn.enabled=!1,j.enabled=!1);let Yn=m.unknown;Yn.length&&Yn.forEach(o=>{b.write(`${j.yellow("WARNING ")}Unknown option '${o}'${E}`)});let Zn=m.trailing;Zn.length&&b.write(`${j.yellow("WARNING ")}Unsupported trailing arguments: ${Zn.join(" ")}${E}`);let H=null,R=null,z=(o,l={})=>(o&&b.write(`${j.red("FAILURE ")}${o.stack.replace(/^ERROR: /i,"")}${E}`),R&&R.dispose(),n.total||(n.total=n.end(a)),Object.assign({error:o,stdout:p,stderr:b,stats:n},l));if(i.version)return p.write(`Version ${Xn}${E}`),z(null);let B=v.normalize(i.baseDir||"."),K=en(i.config||"toilconfig.json",B),Bn=v.basename(K),Z=v.dirname(K),k=await Ce(Bn,Z,d),De=k!=null&&Array.isArray(k.entries)&&k.entries.length;if(i.help||!e.length&&!De){let o=i.help?p:b,l=i.help?zn:j;return o.write([l.white("SYNTAX"),"  "+l.cyan("toilscript")+" [entryFile ...] [options]","",l.white("EXAMPLES"),"  "+l.cyan("toilscript")+" hello"+_,"  "+l.cyan("toilscript")+" hello"+_+" -o hello.wasm -t hello.wat","  "+l.cyan("toilscript")+" hello1"+_+" hello2"+_+" -o -O > hello.wasm","  "+l.cyan("toilscript")+" --config toilconfig.json --target release","",l.white("OPTIONS")].concat(Fe(Y,24,E)).join(E)+E),z(null)}if(!(G.promises&&G.promises.readFile)){if(d===ee)throw Error("'options.readFile' must be specified");if(g===te)throw Error("'options.writeFile' must be specified");if(y===ie)throw Error("'options.listFiles' must be specified")}let Sn=new Set;Sn.add(K);let Ie=i.target||"release";for(;k;){if(k.targets){let l=k.targets[Ie];l&&(i=Mn(Y,i,l,Z))}let o=k.options;if(o&&(i=Mn(Y,i,o,Z)),k.entries)for(let l of k.entries)e.push(en(l,Z));if(k.extends){if(K=en(k.extends,Z,!0),Bn=v.basename(K),Z=v.dirname(K),Sn.has(K))break;Sn.add(K),k=await Ce(Bn,Z,d)}else break}if(Un(Y,i),i.showConfig)return b.write(JSON.stringify({options:i,entries:e},null,2)),z(null);function $n(o){return[...new Set(o)]}let S,tn,mn,T=h.newOptions();switch(i.runtime){case"stub":tn=0;break;case"minimal":tn=1;break;case"memory":tn=3;break;default:tn=2;break}switch(i.uncheckedBehavior){default:mn=0;break;case"never":mn=1;break;case"always":mn=2;break}if(h.setTarget(T,0),h.setDebugInfo(T,!!i.debug),h.setRuntime(T,tn),h.setNoAssert(T,i.noAssert),h.setExportMemory(T,!i.noExportMemory),h.setImportMemory(T,i.importMemory),h.setInitialMemory(T,i.initialMemory>>>0),h.setMaximumMemory(T,i.maximumMemory>>>0),h.setSharedMemory(T,i.sharedMemory),h.setImportTable(T,i.importTable),h.setExportTable(T,i.exportTable),i.exportStart!=null&&h.setExportStart(T,Ct(i.exportStart)?i.exportStart:"_start"),h.setMemoryBase(T,i.memoryBase>>>0),h.setTableBase(T,i.tableBase>>>0),h.setSourceMap(T,i.sourceMap!=null),h.setUncheckedBehavior(T,mn),h.setNoUnsafe(T,i.noUnsafe),h.setPedantic(T,i.pedantic),h.setLowMemoryLimit(T,i.lowMemoryLimit>>>0),h.setExportRuntime(T,i.exportRuntime),h.setBundleVersion(T,r,s,u),!i.stackSize&&tn===2&&(i.stackSize=h.DEFAULT_STACK_SIZE),h.setStackSize(T,i.stackSize),h.setBindingsHint(T,i.bindings&&i.bindings.length>0),i.use){let o=i.use;for(let l=0,c=o.length;l<c;++l){let x=o[l],A=x.indexOf("=");if(A<0)return z(Error(`Global alias '${x}' is invalid.`));let F=x.substring(0,A).trim(),C=x.substring(A+1).trim();if(!F.length)return z(Error(`Global alias '${x}' is invalid.`));h.addGlobalAlias(T,F,C)}}let N;if((N=i.disable)!=null){typeof N=="string"&&(N=N.split(","));for(let o=0,l=N.length;o<l;++o){let c=N[o].trim(),x=h[`FEATURE_${Te(c)}`];if(!x)return z(Error(`Feature '${c}' is unknown.`));h.setFeature(T,x,!1)}}if((N=i.enable)!=null){typeof N=="string"&&(N=N.split(","));for(let o=0,l=N.length;o<l;++o){let c=N[o].trim(),x=h[`FEATURE_${Te(c)}`];if(!x)return z(Error(`Feature '${c}' is unknown.`));h.setFeature(T,x,!0)}}let $=0,J=0;i.optimize&&($=Be,J=Se),typeof i.optimizeLevel=="number"&&($=i.optimizeLevel),typeof i.shrinkLevel=="number"&&(J=i.shrinkLevel),$=Math.min(Math.max($,0),3),J=Math.min(Math.max(J,0),2),h.setOptimizeLevelHints(T,$,J),S=h.newProgram(T);let rn=[];if(Array.isArray(t.transforms)&&rn.push(...t.transforms),i.transform){let o=$n(i.transform);for(let l=0,c=o.length;l<c;++l){let x=o[l].trim(),A,F;if(Vn.resolve)try{A=Vn.resolve(x,{paths:[U.cwd(),B]}),F=await import(dn.pathToFileURL(A)),F.default&&(F=F.default)}catch(C){try{F=Vn(A)}catch{return z(C)}}else try{F=await import(new URL(x,import.meta.url)),F.default&&(F=F.default)}catch(C){return z(C)}if(!F||typeof F!="function"&&typeof F!="object")return z(Error("not a transform: "+o[l]));rn.push(F)}}try{rn=rn.map(o=>(typeof o=="function"&&(Object.assign(o.prototype,{program:S,binaryen:pn,baseDir:B,stdout:p,stderr:b,log:console.error,readFile:d,writeFile:g,listFiles:y}),o=new o),o))}catch(o){return z(o)}async function wn(o,...l){for(let c=0,x=rn.length;c<x;++c){let A=rn[c];if(typeof A[o]=="function")try{let F=n.begin();n.transformCount++,await A[o](...l),n.transformTime+=n.end(F)}catch(F){return F}}}Object.keys(X).forEach(o=>{if(o.includes("/"))return;let l=n.begin();n.parseCount++,h.parse(S,X[o],P+o+_,!1),n.parseTime+=n.end(l)});let on=[];if(i.lib){let o=i.lib;typeof o=="string"&&(o=o.split(",")),on.push(...o.map(l=>l.trim())),on=$n(on);for(let l=0,c=on.length;l<c;++l){let x=on[l],A;x.endsWith(_)?(A=[v.basename(x)],x=v.dirname(x)):A=await y(x,B)||[];for(let F of A){let C=await d(F,x);if(C==null)return z(Error(`Library file '${F}' not found.`));X[F.replace(hn,"")]=C;let I=n.begin();n.parseCount++,h.parse(S,C,P+F,!1),n.parseTime+=n.end(I)}}}i.path=i.path||[];let bn=new Map;async function Oe(o,l){let c=null,x=null;if(!o.startsWith(P))(c=await d(x=o+_,B))==null&&(c=await d(x=o+"/index"+_,B))==null&&(x=o+_,c=await d(o+_t,B));else{let A=o.substring(P.length),F=`${A}/index`;if(Object.prototype.hasOwnProperty.call(X,A))c=X[A],x=P+A+_;else if(Object.prototype.hasOwnProperty.call(X,F))c=X[F],x=P+F+_;else{for(let C of on)if((c=await d(A+_,C))!=null){x=P+A+_;break}else if((c=await d(F+_,C))!=null){x=P+F+_;break}if(c==null){let C=o.match(/^~lib\/((?:@[^/]+\/)?[^/]+)(?:\/(.+))?/);if(C){let I=C[1],q=C[2]||"index",vn=bn.has(l)?bn.get(l):".",M=[],D=v.resolve(B,vn).split(jn);for(let w=D.length,O=Kn?1:0;w>=O;--w)D[w-1]!=="node_modules"&&M.push(`${D.slice(0,w).join(jn)}${jn}node_modules`);M.push(...i.path);for(let w of M.map(O=>v.relative(B,O))){let O=q;if((c=await d(v.join(w,I,O+_),B))!=null){x=`${P}${I}/${O}${_}`,bn.set(x.replace(hn,""),v.join(w,I));break}let un=`${q}/index`;if((c=await d(v.join(w,I,un+_),B))!=null){x=`${P}${I}/${un}${_}`,bn.set(x.replace(hn,""),v.join(w,I));break}}}}}}return c==null?null:{sourceText:c,sourcePath:x}}function Le(o=[]){do{let l=h.nextFile(S);if(l==null)break;o.push(l)}while(!0);return o}async function Jn(){let o;for(;(o=Le()).length;){let c=[];for(let x of o){let A=h.getDependee(S,x);c.push(Oe(x,A))}c=await Promise.all(c);for(let x=0,A=o.length;x<A;++x){let F=o[x],C=c[x],I=n.begin();n.parseCount++,C?h.parse(S,C.sourceText,C.sourcePath,!1):h.parse(S,null,F+_,!1),n.parseTime+=n.end(I)}}let l=gn(S,b,i.disableWarning,t.reportDiagnostic,j.enabled);if(l){let c=Error(`${l} parse error(s)`);return c.stack=c.message,z(c)}}{let o=String(i.runtime),l=`rt/index-${o}`,c=X[l];if(c==null){if(l=o,c=await d(l+_,B),c==null)return z(Error(`Runtime '${v.resolve(B,l+_)}' is not found.`))}else l=`~lib/${l}`;let x=n.begin();n.parseCount++,h.parse(S,c,l+_,!0),n.parseTime+=n.end(x)}for(let o=0,l=e.length;o<l;++o){let c=String(e[o]),x=v.isAbsolute(c)?v.relative(B,c):v.normalize(c);x=x.replace(/\\/g,"/").replace(hn,"").replace(/\/$/,"");let A=await d(x+_,B);if(A==null){let C=`${x}/index${_}`;A=await d(C,B),A!=null?x=C:x+=_}else x+=_;let F=n.begin();n.parseCount++,h.parse(S,A,x,!0),n.parseTime+=n.end(F)}{let o=await Jn();if(o)return o}{let o=await wn("afterParse",S.parser);if(o)return z(o)}{let o=await Jn();if(o)return o}{let o=n.begin();n.initializeCount++;try{h.initializeProgram(S)}catch(l){L("initialize",l)}n.initializeTime+=n.end(o)}{let o=await wn("afterInitialize",S);if(o)return z(o)}{let o=n.begin();n.compileCount++;try{H=h.compile(S)}catch(l){let c=gn(S,b,i.disableWarning,t.reportDiagnostic,j.enabled);if(c){let x=Error(`${c} compile error(s)`);return x.stack=x.message,z(x)}L("compile",l)}n.compileTime+=n.end(o)}R=pn.wrapModule(typeof H=="number"||H instanceof Number?h.getBinaryenModuleRef(H):H.ref);let ln=gn(S,b,i.disableWarning,t.reportDiagnostic,j.enabled);if(ln){let o=Error(`${ln} compile error(s)`);return o.stack=o.message,z(o)}{let o=await wn("afterCompile",R);if(o)return z(o)}if(ln=gn(S,b,i.disableWarning,t.reportDiagnostic,j.enabled),ln){let o=Error(`${ln} afterCompile error(s)`);return o.stack=o.message,z(o)}if(!i.noValidate){let o=n.begin();n.validateCount++;let l=h.validate(H);if(n.validateTime+=n.end(o),!l)return z(Error("validate error"))}if(i.trapMode==="clamp"||i.trapMode==="js"){let o=n.begin();try{R.runPasses([`trap-mode-${i.trapMode}`])}catch(l){L("runPasses",l)}n.compileTime+=n.end(o)}else if(i.trapMode!=="allow")return z(Error("Unsupported trap mode"));let Qn=i.debug,Re=i.converge,ne=i.importMemory?i.zeroFilledMemory:!1,yn=[];i.runPasses&&(typeof i.runPasses=="string"&&(i.runPasses=i.runPasses.split(",")),i.runPasses.length&&i.runPasses.forEach(o=>{yn.includes(o=o.trim())||yn.push(o)}));{let o=n.begin();try{n.optimizeCount++,h.optimize(H,$,J,Qn,ne)}catch(l){L("optimize",l)}try{R.runPasses(yn)}catch(l){L("runPasses",l)}if(Re){let l;try{let c=n.begin();n.emitCount++,l=R.emitBinary(),n.emitTime+=n.end(c)}catch(c){L("emitBinary (converge)",c)}do{try{n.optimizeCount++,h.optimize(H,$,J,Qn,ne)}catch(x){L("optimize (converge)",x)}try{R.runPasses(yn)}catch(x){L("runPasses (converge)",x)}let c;try{let x=n.begin();n.emitCount++,c=R.emitBinary(),n.emitTime+=n.end(x)}catch(x){L("emitBinary (converge)",x)}if(c.length>=l.length){c.length>l.length&&b.write(`Last converge was suboptimal.${E}`);break}l=c}while(!0)}n.optimizeTime+=n.end(o)}let an=[];if(!i.noEmit){if(i.binaryFile)return z(Error("Usage of the --binaryFile compiler option is no longer supported. Use --outFile instead."));let o=i.bindings||[],l=!1,c=i.outFile!=null,x=i.textFile!=null,A=c||x,F=c&&i.outFile.length>0||x&&i.textFile.length>0,C=F?(i.outFile||i.textFile).replace(/\.\w+$/,""):null,I=F?v.basename(C):"output";if(h.setBasenameHint(T,I),i.outFile!=null){let M=i.sourceMap!=null?i.sourceMap.length?i.sourceMap:`./${I}.wasm.map`:null,D=n.begin();n.emitCount++;let w;try{w=R.emitBinary(M)}catch(O){L("emitBinary",O)}if(n.emitTime+=n.end(D),i.outFile.length?an.push(g(i.outFile,w.binary,B)):(l=!0,Fn(w.binary)),w.sourceMap!="")if(i.outFile.length){let O=JSON.parse(w.sourceMap);O.sourceRoot=`./${I}`;let un=[];for(let En=0,ke=O.sources.length;En<ke;++En){let re=O.sources[En],oe=h.getSource(S,re.replace(hn,""));if(oe==null)return z(Error(`Source of file '${re}' not found.`));un[En]=oe}O.sourcesContent=un,an.push(g(v.join(v.dirname(i.outFile),v.basename(M)).replace(/^\.\//,""),JSON.stringify(O),B))}else b.write(`Skipped source map (no output path)${E}`)}if(i.textFile!=null||!A){let M=n.begin();n.emitCount++;let D;try{pn.setOptimizeStackIR(!0),D=i.textFile?.endsWith(".wast")?R.emitText():R.emitStackIR()}catch(w){L("emitText",w)}n.emitTime+=n.end(M),i.textFile!=null&&i.textFile.length?an.push(g(i.textFile,D,B)):l||Fn(D)}let q=o.includes("esm"),vn=!q&&o.includes("raw");if(q||vn)if(C){let M=n.begin();n.emitCount++;let D;try{D=h.buildTSD(S,q)}catch(w){L("buildTSD",w)}n.emitTime+=n.end(M),an.push(g(C+".d.ts",D,B))}else b.write(`Skipped TypeScript binding (no output path)${E}`);if(q||vn)if(C){let M=n.begin();n.emitCount++;let D;try{D=h.buildJS(S,q)}catch(w){L("buildJS",w)}n.emitTime+=n.end(M),an.push(g(C+".js",D,B))}else b.write(`Skipped JavaScript binding (no output path)${E}`)}try{await Promise.all(an)}catch(o){return z(o)}return n.total=n.end(a),i.stats&&b.write(n.toString()),z(null);async function ee(o,l){let c=v.resolve(l,o);try{return n.readCount++,await G.promises.readFile(c,"utf8")}catch{return null}}async function te(o,l,c){try{n.writeCount++;let x=v.resolve(c,v.dirname(o)),A=v.join(x,v.basename(o));return await G.promises.mkdir(x,{recursive:!0}),await G.promises.writeFile(A,l),!0}catch{return!1}}async function ie(o,l){try{return n.readCount++,(await G.promises.readdir(v.join(l,o))).filter(c=>Tt.test(c))}catch{return null}}function Fn(o){Fn.used||(Fn.used=!0,n.writeCount++),p.write(o)}function L(o,l){let c=zn.red("\u258C ");console.error([E,c,"Whoops, the ToilScript compiler has crashed during ",o," :-(",E,c,E,(typeof l.stack=="string"?[c,"Here is the stack trace hinting at the problem, perhaps it's useful?",E,c,E,l.stack.replace(/^/mg,c),E]:[c,"There is no stack trace. Perhaps a Binaryen exception above / in console?",E,c,E,c,"> "+l.stack,E]).join(""),c,E,c,"If you see where the error is, feel free to send us a pull request. If not,",E,c,"please let us know: https://github.com/dacely-cloud/toilscript/issues",E,c,E,c,"Thank you!",E].join("")),U.exit(1)}}function Gn(e){return Object.prototype.toString.call(e)==="[object Object]"}async function Ce(e,t,n){let a=await n(e,t),s=v.join(t,e);if(!a)return null;let r;try{r=JSON.parse(a)}catch(u){throw new Error(`Toilconfig is not valid json: ${s}`,{cause:u})}if(r.options&&!Gn(r.options))throw new Error(`Toilconfig.options is not an object: ${s}`);if(r.include&&!Array.isArray(r.include))throw new Error(`Toilconfig.include is not an array: ${s}`);if(r.targets){if(!Gn(r.targets))throw new Error(`Toilconfig.targets is not an object: ${s}`);let u=Object.keys(r.targets);for(let f=0;f<u.length;f++){let p=u[f];if(!Gn(r.targets[p]))throw new Error(`Toilconfig.targets.${p} is not an object: ${s}`)}}if(r.extends&&typeof r.extends!="string")throw new Error(`Toilconfig.extends is not a string: ${s}`);return r}function gn(e,t,n,a,s){typeof s>"u"&&t&&(s=t.isTTY);let r=0;do{let p=h.nextDiagnostic(e);if(!p)break;if(t){let b=d=>{if(n==null)return!1;if(!n.length)return!0;let g=h.getDiagnosticCode(d);return n.includes(g)};(h.isError(p)||!b(p))&&t.write(h.formatDiagnostic(p,s,!0)+E+E)}if(a){let b=function(g){return g&&{start:h.getRangeStart(g),end:h.getRangeEnd(g),source:d(h.getRangeSource(g))}||null},d=function(g){return g&&{normalizedPath:h.getSourceNormalizedPath(g)}||null};var u=b,f=d;a({message:h.getDiagnosticMessage(p),code:h.getDiagnosticCode(p),category:h.getDiagnosticCategory(p),range:b(h.getDiagnosticRange(p)),relatedRange:b(h.getDiagnosticRelatedRange(p))})}h.isError(p)&&++r}while(!0);return r}var Cn=class{readCount=0;writeCount=0;parseTime=0;parseCount=0;initializeTime=0;initializeCount=0;compileTime=0;compileCount=0;emitTime=0;emitCount=0;validateTime=0;validateCount=0;optimizeTime=0;optimizeCount=0;transformTime=0;transformCount=0;begin(){return U.hrtime()}end(t){let n=U.hrtime(t);return n[0]*1e9+n[1]}toString(){let t=m=>m?`${(m/1e6).toFixed(3)} ms`:"n/a",n=Object.keys(this).filter(m=>m.endsWith("Time")).map(m=>m.substring(0,m.length-4)),a=n.map(m=>t(this[`${m}Time`])),s=n.map(m=>this[`${m}Count`].toString()),r=n.reduce((m,i)=>Math.max(i.length,m),0),u=a.reduce((m,i)=>Math.max(i.length,m),0),f=s.reduce((m,i)=>Math.max(i.length,m),0),p=r+u+f+6,b=[];b.push(`\u256D\u2500${"\u2500".repeat(p)}\u2500\u256E${E}`);let d="Stats";b.push(`\u2502 ${d}${" ".repeat(p-d.length)} \u2502${E}`),b.push(`\u255E\u2550${"\u2550".repeat(r)}\u2550\u2564\u2550${"\u2550".repeat(u)}\u2550\u2564\u2550${"\u2550".repeat(f)}\u2550\u2561${E}`);for(let m=0,i=n.length;m<i;++m)b.push(`\u2502 ${n[m].padEnd(r)} \u2502 ${a[m].padStart(u)} \u2502 ${s[m].padStart(f)} \u2502${E}`);b.push(`\u251C\u2500${"\u2500".repeat(r)}\u2500\u2534\u2500${"\u2500".repeat(u)}\u2500\u2534\u2500${"\u2500".repeat(f)}\u2500\u2524${E}`);let g=`Took ${t(this.total)}`;b.push(`\u2502 ${g}${" ".repeat(p-g.length)} \u2502${E}`);let y=`${this.readCount} reads, ${this.writeCount} writes`;return b.push(`\u2502 ${y}${" ".repeat(p-y.length)} \u2502${E}`),b.push(`\u2570\u2500${"\u2500".repeat(p)}\u2500\u256F${E}`),b.join("")}},ze=typeof global<"u"&&global.Buffer?global.Buffer.allocUnsafe||(e=>new global.Buffer(e)):e=>new Uint8Array(e);function Hn(e){let t=[];return t.write=function(n){if(e&&e(n),typeof n=="string"){let a=ze(Tn.length(n));Tn.write(n,a,0),n=a}this.push(n)},t.reset=function(){t.length=0},t.toBuffer=function(){let n=0,a=0,s=this.length;for(;a<s;)n+=this[a++].length;let r=ze(n);for(n=a=0;a<s;)r.set(this[a],n),n+=this[a].length,++a;return r},t.toString=function(){let n=this.toBuffer();return Tn.read(n,0,n.length)},t}var wt={alwaysStrict:!0,strictNullChecks:!0,noImplicitAny:!0,noImplicitReturns:!0,noImplicitThis:!0,noEmitOnError:!0,noPropertyAccessFromIndexSignature:!0,experimentalDecorators:!0,target:"esnext",noLib:!0,types:[],allowJs:!1};export{Cn as Stats,gn as checkDiagnostics,St as compileString,qn as configToArguments,Hn as createMemoryStream,Wn as default,Be as defaultOptimizeLevel,Se as defaultShrinkLevel,Bt as definitionFiles,X as libraryFiles,P as libraryPrefix,we as main,zt as options,wt as tscOptions,Xn as version};
+`,jn=Kn?"\\":"/",_=".ts",_t=`.d${_}`,hn=new RegExp("\\"+_+"$"),Tt=new RegExp("^(?!.*\\.d\\"+_+"$).*\\"+_+"$");function Te(e){return e.replace(/-/g,"_").toUpperCase()}function Ct(e){return typeof e=="string"&&e!==""}var Xn=ve,zt=Y,P=Ee,X=Ae,Bt=_e,Be=3,we=0;function qn(e,t=[]){return Object.keys(e||{}).forEach(n=>{let a=e[n],s=Y[n];s&&s.type==="b"?a&&t.push(`--${n}`):Array.isArray(a)?a.forEach(r=>{t.push(`--${n}`,String(r))}):t.push(`--${n}`,String(a))}),t}async function wt(e,t={}){typeof e=="string"&&(e={[`input${_}`]:e});let n=["--outFile","binary","--textFile","text"];qn(t,n);let a={},s=await Se(n.concat(Object.keys(e)),{readFile:r=>Object.prototype.hasOwnProperty.call(e,r)?e[r]:null,writeFile:(r,u)=>{a[r]=u},listFiles:()=>[]});return Object.assign(s,a)}async function Se(e,t){Array.isArray(e)||(e=qn(e)),t||(t={});let n=t.stats||new Cn,a=n.begin(),s=0,r=0,u=0,f=(Xn||"").split(".");f.length===3&&(r=parseInt(f[0])|0,s=parseInt(f[1])|0,u=parseInt(f[2])|0);let p=t.stdout||Hn(),b=t.stderr||Hn(),d=t.readFile||ee,g=t.writeFile||te,y=t.listFiles||ie,m=ye(e,Y,!1),i=m.options;e=m.arguments;let zn=new nn(p),j=new nn(b);i.noColors&&(zn.enabled=!1,j.enabled=!1);let Yn=m.unknown;Yn.length&&Yn.forEach(o=>{b.write(`${j.yellow("WARNING ")}Unknown option '${o}'${E}`)});let Zn=m.trailing;Zn.length&&b.write(`${j.yellow("WARNING ")}Unsupported trailing arguments: ${Zn.join(" ")}${E}`);let H=null,k=null,z=(o,l={})=>(o&&b.write(`${j.red("FAILURE ")}${o.stack.replace(/^ERROR: /i,"")}${E}`),k&&k.dispose(),n.total||(n.total=n.end(a)),Object.assign({error:o,stdout:p,stderr:b,stats:n},l));if(i.version)return p.write(`Version ${Xn}${E}`),z(null);let B=v.normalize(i.baseDir||"."),K=en(i.config||"toilconfig.json",B),Bn=v.basename(K),Z=v.dirname(K),R=await Ce(Bn,Z,d),De=R!=null&&Array.isArray(R.entries)&&R.entries.length;if(i.help||!e.length&&!De){let o=i.help?p:b,l=i.help?zn:j;return o.write([l.white("SYNTAX"),"  "+l.cyan("toilscript")+" [entryFile ...] [options]","",l.white("EXAMPLES"),"  "+l.cyan("toilscript")+" hello"+_,"  "+l.cyan("toilscript")+" hello"+_+" -o hello.wasm -t hello.wat","  "+l.cyan("toilscript")+" hello1"+_+" hello2"+_+" -o -O > hello.wasm","  "+l.cyan("toilscript")+" --config toilconfig.json --target release","",l.white("OPTIONS")].concat(Fe(Y,24,E)).join(E)+E),z(null)}if(!(G.promises&&G.promises.readFile)){if(d===ee)throw Error("'options.readFile' must be specified");if(g===te)throw Error("'options.writeFile' must be specified");if(y===ie)throw Error("'options.listFiles' must be specified")}let wn=new Set;wn.add(K);let Ie=i.target||"release";for(;R;){if(R.targets){let l=R.targets[Ie];l&&(i=Un(Y,i,l,Z))}let o=R.options;if(o&&(i=Un(Y,i,o,Z)),R.entries)for(let l of R.entries)e.push(en(l,Z));if(R.extends){if(K=en(R.extends,Z,!0),Bn=v.basename(K),Z=v.dirname(K),wn.has(K))break;wn.add(K),R=await Ce(Bn,Z,d)}else break}if(Mn(Y,i),i.showConfig)return b.write(JSON.stringify({options:i,entries:e},null,2)),z(null);function $n(o){return[...new Set(o)]}let w,tn,mn,T=h.newOptions();switch(i.runtime){case"stub":tn=0;break;case"minimal":tn=1;break;case"memory":tn=3;break;default:tn=2;break}switch(i.uncheckedBehavior){default:mn=0;break;case"never":mn=1;break;case"always":mn=2;break}if(h.setTarget(T,0),h.setDebugInfo(T,!!i.debug),h.setRuntime(T,tn),h.setNoAssert(T,i.noAssert),h.setExportMemory(T,!i.noExportMemory),h.setImportMemory(T,i.importMemory),h.setInitialMemory(T,i.initialMemory>>>0),h.setMaximumMemory(T,i.maximumMemory>>>0),h.setSharedMemory(T,i.sharedMemory),h.setImportTable(T,i.importTable),h.setExportTable(T,i.exportTable),i.exportStart!=null&&h.setExportStart(T,Ct(i.exportStart)?i.exportStart:"_start"),h.setMemoryBase(T,i.memoryBase>>>0),h.setTableBase(T,i.tableBase>>>0),h.setSourceMap(T,i.sourceMap!=null),h.setUncheckedBehavior(T,mn),h.setNoUnsafe(T,i.noUnsafe),h.setPedantic(T,i.pedantic),h.setLowMemoryLimit(T,i.lowMemoryLimit>>>0),h.setExportRuntime(T,i.exportRuntime),h.setBundleVersion(T,r,s,u),!i.stackSize&&tn===2&&(i.stackSize=h.DEFAULT_STACK_SIZE),h.setStackSize(T,i.stackSize),h.setBindingsHint(T,i.bindings&&i.bindings.length>0),i.use){let o=i.use;for(let l=0,c=o.length;l<c;++l){let x=o[l],A=x.indexOf("=");if(A<0)return z(Error(`Global alias '${x}' is invalid.`));let F=x.substring(0,A).trim(),C=x.substring(A+1).trim();if(!F.length)return z(Error(`Global alias '${x}' is invalid.`));h.addGlobalAlias(T,F,C)}}let N;if((N=i.disable)!=null){typeof N=="string"&&(N=N.split(","));for(let o=0,l=N.length;o<l;++o){let c=N[o].trim(),x=h[`FEATURE_${Te(c)}`];if(!x)return z(Error(`Feature '${c}' is unknown.`));h.setFeature(T,x,!1)}}if((N=i.enable)!=null){typeof N=="string"&&(N=N.split(","));for(let o=0,l=N.length;o<l;++o){let c=N[o].trim(),x=h[`FEATURE_${Te(c)}`];if(!x)return z(Error(`Feature '${c}' is unknown.`));h.setFeature(T,x,!0)}}let $=0,J=0;i.optimize&&($=Be,J=we),typeof i.optimizeLevel=="number"&&($=i.optimizeLevel),typeof i.shrinkLevel=="number"&&(J=i.shrinkLevel),$=Math.min(Math.max($,0),3),J=Math.min(Math.max(J,0),2),h.setOptimizeLevelHints(T,$,J),w=h.newProgram(T);let rn=[];if(Array.isArray(t.transforms)&&rn.push(...t.transforms),i.transform){let o=$n(i.transform);for(let l=0,c=o.length;l<c;++l){let x=o[l].trim(),A,F;if(Vn.resolve)try{A=Vn.resolve(x,{paths:[M.cwd(),B]}),F=await import(dn.pathToFileURL(A)),F.default&&(F=F.default)}catch(C){try{F=Vn(A)}catch{return z(C)}}else try{F=await import(new URL(x,import.meta.url)),F.default&&(F=F.default)}catch(C){return z(C)}if(!F||typeof F!="function"&&typeof F!="object")return z(Error("not a transform: "+o[l]));rn.push(F)}}try{rn=rn.map(o=>(typeof o=="function"&&(Object.assign(o.prototype,{program:w,binaryen:pn,baseDir:B,stdout:p,stderr:b,log:console.error,readFile:d,writeFile:g,listFiles:y}),o=new o),o))}catch(o){return z(o)}async function Sn(o,...l){for(let c=0,x=rn.length;c<x;++c){let A=rn[c];if(typeof A[o]=="function")try{let F=n.begin();n.transformCount++,await A[o](...l),n.transformTime+=n.end(F)}catch(F){return F}}}Object.keys(X).forEach(o=>{if(o.includes("/"))return;let l=n.begin();n.parseCount++,h.parse(w,X[o],P+o+_,!1),n.parseTime+=n.end(l)});let on=[];if(i.lib){let o=i.lib;typeof o=="string"&&(o=o.split(",")),on.push(...o.map(l=>l.trim())),on=$n(on);for(let l=0,c=on.length;l<c;++l){let x=on[l],A;x.endsWith(_)?(A=[v.basename(x)],x=v.dirname(x)):A=await y(x,B)||[];for(let F of A){let C=await d(F,x);if(C==null)return z(Error(`Library file '${F}' not found.`));X[F.replace(hn,"")]=C;let I=n.begin();n.parseCount++,h.parse(w,C,P+F,!1),n.parseTime+=n.end(I)}}}i.path=i.path||[];let bn=new Map;async function Oe(o,l){let c=null,x=null;if(!o.startsWith(P))(c=await d(x=o+_,B))==null&&(c=await d(x=o+"/index"+_,B))==null&&(x=o+_,c=await d(o+_t,B));else{let A=o.substring(P.length),F=`${A}/index`;if(Object.prototype.hasOwnProperty.call(X,A))c=X[A],x=P+A+_;else if(Object.prototype.hasOwnProperty.call(X,F))c=X[F],x=P+F+_;else{for(let C of on)if((c=await d(A+_,C))!=null){x=P+A+_;break}else if((c=await d(F+_,C))!=null){x=P+F+_;break}if(c==null){let C=o.match(/^~lib\/((?:@[^/]+\/)?[^/]+)(?:\/(.+))?/);if(C){let I=C[1],q=C[2]||"index",vn=bn.has(l)?bn.get(l):".",U=[],D=v.resolve(B,vn).split(jn);for(let S=D.length,O=Kn?1:0;S>=O;--S)D[S-1]!=="node_modules"&&U.push(`${D.slice(0,S).join(jn)}${jn}node_modules`);U.push(...i.path);for(let S of U.map(O=>v.relative(B,O))){let O=q;if((c=await d(v.join(S,I,O+_),B))!=null){x=`${P}${I}/${O}${_}`,bn.set(x.replace(hn,""),v.join(S,I));break}let un=`${q}/index`;if((c=await d(v.join(S,I,un+_),B))!=null){x=`${P}${I}/${un}${_}`,bn.set(x.replace(hn,""),v.join(S,I));break}}}}}}return c==null?null:{sourceText:c,sourcePath:x}}function Le(o=[]){do{let l=h.nextFile(w);if(l==null)break;o.push(l)}while(!0);return o}async function Jn(){let o;for(;(o=Le()).length;){let c=[];for(let x of o){let A=h.getDependee(w,x);c.push(Oe(x,A))}c=await Promise.all(c);for(let x=0,A=o.length;x<A;++x){let F=o[x],C=c[x],I=n.begin();n.parseCount++,C?h.parse(w,C.sourceText,C.sourcePath,!1):h.parse(w,null,F+_,!1),n.parseTime+=n.end(I)}}let l=gn(w,b,i.disableWarning,t.reportDiagnostic,j.enabled);if(l){let c=Error(`${l} parse error(s)`);return c.stack=c.message,z(c)}}{let o=String(i.runtime),l=`rt/index-${o}`,c=X[l];if(c==null){if(l=o,c=await d(l+_,B),c==null)return z(Error(`Runtime '${v.resolve(B,l+_)}' is not found.`))}else l=`~lib/${l}`;let x=n.begin();n.parseCount++,h.parse(w,c,l+_,!0),n.parseTime+=n.end(x)}for(let o=0,l=e.length;o<l;++o){let c=String(e[o]),x=v.isAbsolute(c)?v.relative(B,c):v.normalize(c);x=x.replace(/\\/g,"/").replace(hn,"").replace(/\/$/,"");let A=await d(x+_,B);if(A==null){let C=`${x}/index${_}`;A=await d(C,B),A!=null?x=C:x+=_}else x+=_;let F=n.begin();n.parseCount++,h.parse(w,A,x,!0),n.parseTime+=n.end(F)}{let o=await Jn();if(o)return o}{let o=await Sn("afterParse",w.parser);if(o)return z(o)}{let o=await Jn();if(o)return o}{let o=n.begin();n.initializeCount++;try{h.initializeProgram(w)}catch(l){L("initialize",l)}n.initializeTime+=n.end(o)}{let o=await Sn("afterInitialize",w);if(o)return z(o)}{let o=n.begin();n.compileCount++;try{H=h.compile(w)}catch(l){let c=gn(w,b,i.disableWarning,t.reportDiagnostic,j.enabled);if(c){let x=Error(`${c} compile error(s)`);return x.stack=x.message,z(x)}L("compile",l)}n.compileTime+=n.end(o)}k=pn.wrapModule(typeof H=="number"||H instanceof Number?h.getBinaryenModuleRef(H):H.ref);let ln=gn(w,b,i.disableWarning,t.reportDiagnostic,j.enabled);if(ln){let o=Error(`${ln} compile error(s)`);return o.stack=o.message,z(o)}{let o=await Sn("afterCompile",k);if(o)return z(o)}if(ln=gn(w,b,i.disableWarning,t.reportDiagnostic,j.enabled),ln){let o=Error(`${ln} afterCompile error(s)`);return o.stack=o.message,z(o)}if(!i.noValidate){let o=n.begin();n.validateCount++;let l=h.validate(H);if(n.validateTime+=n.end(o),!l)return z(Error("validate error"))}if(i.trapMode==="clamp"||i.trapMode==="js"){let o=n.begin();try{k.runPasses([`trap-mode-${i.trapMode}`])}catch(l){L("runPasses",l)}n.compileTime+=n.end(o)}else if(i.trapMode!=="allow")return z(Error("Unsupported trap mode"));let Qn=i.debug,ke=i.converge,ne=i.importMemory?i.zeroFilledMemory:!1,yn=[];i.runPasses&&(typeof i.runPasses=="string"&&(i.runPasses=i.runPasses.split(",")),i.runPasses.length&&i.runPasses.forEach(o=>{yn.includes(o=o.trim())||yn.push(o)}));{let o=n.begin();try{n.optimizeCount++,h.optimize(H,$,J,Qn,ne)}catch(l){L("optimize",l)}try{k.runPasses(yn)}catch(l){L("runPasses",l)}if(ke){let l;try{let c=n.begin();n.emitCount++,l=k.emitBinary(),n.emitTime+=n.end(c)}catch(c){L("emitBinary (converge)",c)}do{try{n.optimizeCount++,h.optimize(H,$,J,Qn,ne)}catch(x){L("optimize (converge)",x)}try{k.runPasses(yn)}catch(x){L("runPasses (converge)",x)}let c;try{let x=n.begin();n.emitCount++,c=k.emitBinary(),n.emitTime+=n.end(x)}catch(x){L("emitBinary (converge)",x)}if(c.length>=l.length){c.length>l.length&&b.write(`Last converge was suboptimal.${E}`);break}l=c}while(!0)}n.optimizeTime+=n.end(o)}let an=[];if(!i.noEmit){if(i.binaryFile)return z(Error("Usage of the --binaryFile compiler option is no longer supported. Use --outFile instead."));let o=i.bindings||[],l=!1,c=i.outFile!=null,x=i.textFile!=null,A=c||x,F=c&&i.outFile.length>0||x&&i.textFile.length>0,C=F?(i.outFile||i.textFile).replace(/\.\w+$/,""):null,I=F?v.basename(C):"output";if(h.setBasenameHint(T,I),i.outFile!=null){let U=i.sourceMap!=null?i.sourceMap.length?i.sourceMap:`./${I}.wasm.map`:null,D=n.begin();n.emitCount++;let S;try{S=k.emitBinary(U)}catch(O){L("emitBinary",O)}if(n.emitTime+=n.end(D),i.outFile.length?an.push(g(i.outFile,S.binary,B)):(l=!0,Fn(S.binary)),S.sourceMap!="")if(i.outFile.length){let O=JSON.parse(S.sourceMap);O.sourceRoot=`./${I}`;let un=[];for(let En=0,Re=O.sources.length;En<Re;++En){let re=O.sources[En],oe=h.getSource(w,re.replace(hn,""));if(oe==null)return z(Error(`Source of file '${re}' not found.`));un[En]=oe}O.sourcesContent=un,an.push(g(v.join(v.dirname(i.outFile),v.basename(U)).replace(/^\.\//,""),JSON.stringify(O),B))}else b.write(`Skipped source map (no output path)${E}`)}if(i.textFile!=null||!A){let U=n.begin();n.emitCount++;let D;try{pn.setOptimizeStackIR(!0),D=i.textFile?.endsWith(".wast")?k.emitText():k.emitStackIR()}catch(S){L("emitText",S)}n.emitTime+=n.end(U),i.textFile!=null&&i.textFile.length?an.push(g(i.textFile,D,B)):l||Fn(D)}let q=o.includes("esm"),vn=!q&&o.includes("raw");if(q||vn)if(C){let U=n.begin();n.emitCount++;let D;try{D=h.buildTSD(w,q)}catch(S){L("buildTSD",S)}n.emitTime+=n.end(U),an.push(g(C+".d.ts",D,B))}else b.write(`Skipped TypeScript binding (no output path)${E}`);if(q||vn)if(C){let U=n.begin();n.emitCount++;let D;try{D=h.buildJS(w,q)}catch(S){L("buildJS",S)}n.emitTime+=n.end(U),an.push(g(C+".js",D,B))}else b.write(`Skipped JavaScript binding (no output path)${E}`)}try{await Promise.all(an)}catch(o){return z(o)}return n.total=n.end(a),i.stats&&b.write(n.toString()),z(null);async function ee(o,l){let c=v.resolve(l,o);try{return n.readCount++,await G.promises.readFile(c,"utf8")}catch{return null}}async function te(o,l,c){try{n.writeCount++;let x=v.resolve(c,v.dirname(o)),A=v.join(x,v.basename(o));return await G.promises.mkdir(x,{recursive:!0}),await G.promises.writeFile(A,l),!0}catch{return!1}}async function ie(o,l){try{return n.readCount++,(await G.promises.readdir(v.join(l,o))).filter(c=>Tt.test(c))}catch{return null}}function Fn(o){Fn.used||(Fn.used=!0,n.writeCount++),p.write(o)}function L(o,l){let c=zn.red("\u258C ");console.error([E,c,"Whoops, the ToilScript compiler has crashed during ",o," :-(",E,c,E,(typeof l.stack=="string"?[c,"Here is the stack trace hinting at the problem, perhaps it's useful?",E,c,E,l.stack.replace(/^/mg,c),E]:[c,"There is no stack trace. Perhaps a Binaryen exception above / in console?",E,c,E,c,"> "+l.stack,E]).join(""),c,E,c,"If you see where the error is, feel free to send us a pull request. If not,",E,c,"please let us know: https://github.com/dacely-cloud/toilscript/issues",E,c,E,c,"Thank you!",E].join("")),M.exit(1)}}function Gn(e){return Object.prototype.toString.call(e)==="[object Object]"}async function Ce(e,t,n){let a=await n(e,t),s=v.join(t,e);if(!a)return null;let r;try{r=JSON.parse(a)}catch(u){throw new Error(`Toilconfig is not valid json: ${s}`,{cause:u})}if(r.options&&!Gn(r.options))throw new Error(`Toilconfig.options is not an object: ${s}`);if(r.include&&!Array.isArray(r.include))throw new Error(`Toilconfig.include is not an array: ${s}`);if(r.targets){if(!Gn(r.targets))throw new Error(`Toilconfig.targets is not an object: ${s}`);let u=Object.keys(r.targets);for(let f=0;f<u.length;f++){let p=u[f];if(!Gn(r.targets[p]))throw new Error(`Toilconfig.targets.${p} is not an object: ${s}`)}}if(r.extends&&typeof r.extends!="string")throw new Error(`Toilconfig.extends is not a string: ${s}`);return r}function gn(e,t,n,a,s){typeof s>"u"&&t&&(s=t.isTTY);let r=0;do{let p=h.nextDiagnostic(e);if(!p)break;if(t){let b=d=>{if(n==null)return!1;if(!n.length)return!0;let g=h.getDiagnosticCode(d);return n.includes(g)};(h.isError(p)||!b(p))&&t.write(h.formatDiagnostic(p,s,!0)+E+E)}if(a){let b=function(g){return g&&{start:h.getRangeStart(g),end:h.getRangeEnd(g),source:d(h.getRangeSource(g))}||null},d=function(g){return g&&{normalizedPath:h.getSourceNormalizedPath(g)}||null};var u=b,f=d;a({message:h.getDiagnosticMessage(p),code:h.getDiagnosticCode(p),category:h.getDiagnosticCategory(p),range:b(h.getDiagnosticRange(p)),relatedRange:b(h.getDiagnosticRelatedRange(p))})}h.isError(p)&&++r}while(!0);return r}var Cn=class{readCount=0;writeCount=0;parseTime=0;parseCount=0;initializeTime=0;initializeCount=0;compileTime=0;compileCount=0;emitTime=0;emitCount=0;validateTime=0;validateCount=0;optimizeTime=0;optimizeCount=0;transformTime=0;transformCount=0;begin(){return M.hrtime()}end(t){let n=M.hrtime(t);return n[0]*1e9+n[1]}toString(){let t=m=>m?`${(m/1e6).toFixed(3)} ms`:"n/a",n=Object.keys(this).filter(m=>m.endsWith("Time")).map(m=>m.substring(0,m.length-4)),a=n.map(m=>t(this[`${m}Time`])),s=n.map(m=>this[`${m}Count`].toString()),r=n.reduce((m,i)=>Math.max(i.length,m),0),u=a.reduce((m,i)=>Math.max(i.length,m),0),f=s.reduce((m,i)=>Math.max(i.length,m),0),p=r+u+f+6,b=[];b.push(`\u256D\u2500${"\u2500".repeat(p)}\u2500\u256E${E}`);let d="Stats";b.push(`\u2502 ${d}${" ".repeat(p-d.length)} \u2502${E}`),b.push(`\u255E\u2550${"\u2550".repeat(r)}\u2550\u2564\u2550${"\u2550".repeat(u)}\u2550\u2564\u2550${"\u2550".repeat(f)}\u2550\u2561${E}`);for(let m=0,i=n.length;m<i;++m)b.push(`\u2502 ${n[m].padEnd(r)} \u2502 ${a[m].padStart(u)} \u2502 ${s[m].padStart(f)} \u2502${E}`);b.push(`\u251C\u2500${"\u2500".repeat(r)}\u2500\u2534\u2500${"\u2500".repeat(u)}\u2500\u2534\u2500${"\u2500".repeat(f)}\u2500\u2524${E}`);let g=`Took ${t(this.total)}`;b.push(`\u2502 ${g}${" ".repeat(p-g.length)} \u2502${E}`);let y=`${this.readCount} reads, ${this.writeCount} writes`;return b.push(`\u2502 ${y}${" ".repeat(p-y.length)} \u2502${E}`),b.push(`\u2570\u2500${"\u2500".repeat(p)}\u2500\u256F${E}`),b.join("")}},ze=typeof global<"u"&&global.Buffer?global.Buffer.allocUnsafe||(e=>new global.Buffer(e)):e=>new Uint8Array(e);function Hn(e){let t=[];return t.write=function(n){if(e&&e(n),typeof n=="string"){let a=ze(Tn.length(n));Tn.write(n,a,0),n=a}this.push(n)},t.reset=function(){t.length=0},t.toBuffer=function(){let n=0,a=0,s=this.length;for(;a<s;)n+=this[a++].length;let r=ze(n);for(n=a=0;a<s;)r.set(this[a],n),n+=this[a].length,++a;return r},t.toString=function(){let n=this.toBuffer();return Tn.read(n,0,n.length)},t}var St={alwaysStrict:!0,strictNullChecks:!0,noImplicitAny:!0,noImplicitReturns:!0,noImplicitThis:!0,noEmitOnError:!0,noPropertyAccessFromIndexSignature:!0,experimentalDecorators:!0,target:"esnext",noLib:!0,types:[],allowJs:!1};export{Cn as Stats,gn as checkDiagnostics,wt as compileString,qn as configToArguments,Hn as createMemoryStream,Wn as default,Be as defaultOptimizeLevel,we as defaultShrinkLevel,Bt as definitionFiles,X as libraryFiles,P as libraryPrefix,Se as main,zt as options,St as tscOptions,Xn as version};
 //# sourceMappingURL=cli.js.map