>0>>>0]=e.charCodeAt(h);c()[g>>0>>>0]=0;d+=e.length+1});return 0}function Bb(a,b){if(C)return S(21,1,a,b);var d=yb();w()[a>>2>>>0]=d.length;var e=0;d.forEach(function(g){e+=g.length+1});w()[b>>2>>>0]=e;return 0}function Cb(a){return C?S(22,1,a):52}function Gb(a,b,d,e){return C?S(23,1,a,b,d,e):52}function Hb(a,b,d,e,g){return C?S(24,1,a,b,d,e,g):70}
+var Ib=[null,[],[]];function Jb(a,b,d,e){if(C)return S(25,1,a,b,d,e);for(var g=0,h=0;h>2>>>0],u=w()[b+4>>2>>>0];b+=8;for(var E=0;E>>0],y=Ib[a];0===v||10===v?((1===a?qa:L)(ua(y,0)),y.length=0):y.push(v)}g+=u}w()[e>>2>>>0]=g;return 0}
+function Kb(){if("object"==typeof crypto&&"function"==typeof crypto.getRandomValues){var a=new Uint8Array(1);return()=>{crypto.getRandomValues(a);return a[0]}}if(B)try{var b=__webpack_require__(/*! crypto */ "?892d");return()=>b.randomBytes(1)[0]}catch(d){}return()=>N("randomDevice")}function Y(a,b){Y.Wa||(Y.Wa=Kb());for(var d=0;d>0>>>0]=Y.Wa();return 0}function Z(a){return 0===a%4&&(0!==a%100||0===a%400)}var Lb=[31,29,31,30,31,30,31,31,30,31,30,31],Mb=[31,28,31,30,31,30,31,31,30,31,30,31];
+function Nb(a){var b=Array(xa(a)+1);wa(a,b,0,b.length);return b}
+function Ob(a,b,d,e){function g(f,p,r){for(f="number"==typeof f?f.toString():f||"";f.lengthDb?-1:0J-f.getDate())p-=J-f.getDate()+1,f.setDate(1),11>r?f.setMonth(r+1):(f.setMonth(0),f.setFullYear(f.getFullYear()+1));else{f.setDate(f.getDate()+p);break}}r=new Date(f.getFullYear()+1,0,4);p=u(new Date(f.getFullYear(),
+0,4));r=u(r);return 0>=n(p,f)?0>=n(r,f)?f.getFullYear()+1:f.getFullYear():f.getFullYear()-1}var v=t()[e+40>>2>>>0];e={tb:t()[e>>2>>>0],sb:t()[e+4>>2>>>0],Sa:t()[e+8>>2>>>0],Va:t()[e+12>>2>>>0],Ta:t()[e+16>>2>>>0],Na:t()[e+20>>2>>>0],Ja:t()[e+24>>2>>>0],Ma:t()[e+28>>2>>>0],zb:t()[e+32>>2>>>0],rb:t()[e+36>>2>>>0],ub:v?va(v):""};d=va(d);v={"%c":"%a %b %d %H:%M:%S %Y","%D":"%m/%d/%y","%F":"%Y-%m-%d","%h":"%b","%r":"%I:%M:%S %p","%R":"%H:%M","%T":"%H:%M:%S","%x":"%m/%d/%y","%X":"%H:%M:%S","%Ec":"%c","%EC":"%C",
+"%Ex":"%m/%d/%y","%EX":"%H:%M:%S","%Ey":"%y","%EY":"%Y","%Od":"%d","%Oe":"%e","%OH":"%H","%OI":"%I","%Om":"%m","%OM":"%M","%OS":"%S","%Ou":"%u","%OU":"%U","%OV":"%V","%Ow":"%w","%OW":"%W","%Oy":"%y"};for(var y in v)d=d.replace(new RegExp(y,"g"),v[y]);var Eb="Sunday Monday Tuesday Wednesday Thursday Friday Saturday".split(" "),Fb="January February March April May June July August September October November December".split(" ");v={"%a":function(f){return Eb[f.Ja].substring(0,3)},"%A":function(f){return Eb[f.Ja]},
+"%b":function(f){return Fb[f.Ta].substring(0,3)},"%B":function(f){return Fb[f.Ta]},"%C":function(f){return h((f.Na+1900)/100|0,2)},"%d":function(f){return h(f.Va,2)},"%e":function(f){return g(f.Va,2," ")},"%g":function(f){return E(f).toString().substring(2)},"%G":function(f){return E(f)},"%H":function(f){return h(f.Sa,2)},"%I":function(f){f=f.Sa;0==f?f=12:12f.Sa?"AM":"PM"},"%S":function(f){return h(f.tb,2)},"%t":function(){return"\t"},"%u":function(f){return f.Ja||7},"%U":function(f){return h(Math.floor((f.Ma+7-f.Ja)/7),2)},"%V":function(f){var p=Math.floor((f.Ma+7-(f.Ja+6)%7)/7);2>=(f.Ja+371-f.Ma-2)%7&&p++;if(p)53==p&&(r=(f.Ja+371-f.Ma)%7,4==r||3==r&&Z(f.Na)||(p=1));else{p=52;var r=(f.Ja+7-f.Ma-1)%7;(4==r||5==r&&Z(f.Na%400-1))&&p++}return h(p,2)},
+"%w":function(f){return f.Ja},"%W":function(f){return h(Math.floor((f.Ma+7-(f.Ja+6)%7)/7),2)},"%y":function(f){return(f.Na+1900).toString().substring(2)},"%Y":function(f){return f.Na+1900},"%z":function(f){f=f.rb;var p=0<=f;f=Math.abs(f)/60;return(p?"+":"-")+String("0000"+(f/60*100+f%60)).slice(-4)},"%Z":function(f){return f.ub},"%%":function(){return"%"}};d=d.replace(/%%/g,"\x00\x00");for(y in v)d.includes(y)&&(d=d.replace(new RegExp(y,"g"),v[y](e)));d=d.replace(/\0\0/g,"%");y=Nb(d);if(y.length>
+b)return 0;Ua(y,a);return y.length-1}R.Ua();
+var Pb=[null,La,Na,Xa,Za,$a,ab,bb,cb,db,eb,fb,gb,hb,ib,jb,kb,nb,ob,rb,Ab,Bb,Cb,Gb,Hb,Jb],Rb={b:function(a){return qb(a+24)+24},c:function(a,b,d){(new Va(a)).Ua(b,d);Wa++;throw a;},L:function(a){Qb(a,!A,1,!la);R.Za()},l:function(a){C?postMessage({cmd:"cleanupThread",thread:a}):Ja(a)},D:Ya,i:Za,R:$a,z:ab,B:bb,T:cb,P:db,I:eb,O:fb,p:gb,A:hb,x:ib,Q:jb,y:kb,r:function(){},j:function(){N("To use dlopen, you need enable dynamic linking, see https://github.com/emscripten-core/emscripten/wiki/Linking")},s:function(){N("To use dlopen, you need enable dynamic linking, see https://github.com/emscripten-core/emscripten/wiki/Linking")},
+q:function(){return Date.now()},E:function(){return 2097152},V:function(){return!0},F:function(a,b,d,e){if(a==b)setTimeout(()=>Pa(e));else if(C)postMessage({targetThread:a,cmd:"processProxyingQueue",queue:e});else{a=R.La[a];if(!a)return;a.postMessage({cmd:"processProxyingQueue",queue:e})}return 1},K:function(){return-1},W:function(a,b){a=new Date(1E3*mb(a));t()[b>>2>>>0]=a.getUTCSeconds();t()[b+4>>2>>>0]=a.getUTCMinutes();t()[b+8>>2>>>0]=a.getUTCHours();t()[b+12>>2>>>0]=a.getUTCDate();t()[b+16>>2>>>
+0]=a.getUTCMonth();t()[b+20>>2>>>0]=a.getUTCFullYear()-1900;t()[b+24>>2>>>0]=a.getUTCDay();a=(a.getTime()-Date.UTC(a.getUTCFullYear(),0,1,0,0,0,0))/864E5|0;t()[b+28>>2>>>0]=a},X:function(a,b){a=new Date(1E3*mb(a));t()[b>>2>>>0]=a.getSeconds();t()[b+4>>2>>>0]=a.getMinutes();t()[b+8>>2>>>0]=a.getHours();t()[b+12>>2>>>0]=a.getDate();t()[b+16>>2>>>0]=a.getMonth();t()[b+20>>2>>>0]=a.getFullYear()-1900;t()[b+24>>2>>>0]=a.getDay();var d=new Date(a.getFullYear(),0,1),e=(a.getTime()-d.getTime())/864E5|0;t()[b+
+28>>2>>>0]=e;t()[b+36>>2>>>0]=-(60*a.getTimezoneOffset());e=(new Date(a.getFullYear(),6,1)).getTimezoneOffset();d=d.getTimezoneOffset();a=(e!=d&&a.getTimezoneOffset()==Math.min(d,e))|0;t()[b+32>>2>>>0]=a},Y:function(a){var b=new Date(t()[a+20>>2>>>0]+1900,t()[a+16>>2>>>0],t()[a+12>>2>>>0],t()[a+8>>2>>>0],t()[a+4>>2>>>0],t()[a>>2>>>0],0),d=t()[a+32>>2>>>0],e=b.getTimezoneOffset(),g=new Date(b.getFullYear(),0,1),h=(new Date(b.getFullYear(),6,1)).getTimezoneOffset(),n=g.getTimezoneOffset(),u=Math.min(n,
+h);0>d?t()[a+32>>2>>>0]=Number(h!=n&&u==e):0>2>>>0]=b.getDay();d=(b.getTime()-g.getTime())/864E5|0;t()[a+28>>2>>>0]=d;t()[a>>2>>>0]=b.getSeconds();t()[a+4>>2>>>0]=b.getMinutes();t()[a+8>>2>>>0]=b.getHours();t()[a+12>>2>>>0]=b.getDate();t()[a+16>>2>>>0]=b.getMonth();return b.getTime()/1E3|0},G:nb,H:ob,Z:sb,d:function(){N("")},m:function(){if(!B&&!A){var a="Blocking on the main thread is very dangerous, see https://emscripten.org/docs/porting/pthreads.html#blocking-on-the-main-browser-thread";
+X||(X={});X[a]||(X[a]=1,B&&(a="warning: "+a),L(a))}},w:function(){return 4294901760},f:tb,S:function(a,b,d){q().copyWithin(a>>>0,b>>>0,b+d>>>0)},g:function(){return B?(__webpack_require__(/*! os */ "?aedb").cpus)().length:navigator.hardwareConcurrency},J:function(a,b,d){wb.length=b;d>>=3;for(var e=0;e>>0];return(0>a?Ia[-a-1]:Pb[a]).apply(null,wb)},v:function(a){var b=q().length;a>>>=0;if(a<=b||4294901760=d;d*=2){var e=b*(1+.2/d);e=Math.min(e,a+100663296);var g=Math;e=Math.max(a,
+e);g=g.min.call(g,4294901760,e+(65536-e%65536)%65536);a:{try{k.grow(g-l.byteLength+65535>>>16);m(k.buffer);var h=1;break a}catch(n){}h=void 0}if(h)return!0}return!1},U:function(){throw"unwind";},M:Ab,N:Bb,k:Ma,h:Cb,o:Gb,t:Hb,n:Jb,u:Y,a:k||x.wasmMemory,C:Ob,e:function(a,b,d,e){return Ob(a,b,d,e)}};
+(function(){function a(g,h){x.asm=g.exports;R.$a.push(x.asm.wa);za=x.asm.za;Ba.unshift(x.asm._);ra=h;C||(O--,x.monitorRunDependencies&&x.monitorRunDependencies(O),0==O&&(null!==Ea&&(clearInterval(Ea),Ea=null),P&&(g=P,P=null,g())))}function b(g){a(g.instance,g.module)}function d(g){return Ha().then(function(h){return WebAssembly.instantiate(h,e)}).then(function(h){return h}).then(g,function(h){L("failed to asynchronously prepare wasm: "+h);N(h)})}var e={a:Rb};C||(O++,x.monitorRunDependencies&&x.monitorRunDependencies(O));
+if(x.instantiateWasm)try{return x.instantiateWasm(e,a)}catch(g){return L("Module.instantiateWasm callback failed with error: "+g),!1}(function(){return M||"function"!=typeof WebAssembly.instantiateStreaming||Fa()||Q.startsWith("file://")||B||"function"!=typeof fetch?d(b):fetch(Q,{credentials:"same-origin"}).then(function(g){return WebAssembly.instantiateStreaming(g,e).then(b,function(h){L("wasm streaming compile failed: "+h);L("falling back to ArrayBuffer instantiation");return d(b)})})})().catch(ia);
+return{}})();x.___wasm_call_ctors=function(){return(x.___wasm_call_ctors=x.asm._).apply(null,arguments)};x._OrtInit=function(){return(x._OrtInit=x.asm.$).apply(null,arguments)};x._OrtCreateSessionOptions=function(){return(x._OrtCreateSessionOptions=x.asm.aa).apply(null,arguments)};x._OrtAppendExecutionProvider=function(){return(x._OrtAppendExecutionProvider=x.asm.ba).apply(null,arguments)};x._OrtAddSessionConfigEntry=function(){return(x._OrtAddSessionConfigEntry=x.asm.ca).apply(null,arguments)};
+x._OrtReleaseSessionOptions=function(){return(x._OrtReleaseSessionOptions=x.asm.da).apply(null,arguments)};x._OrtCreateSession=function(){return(x._OrtCreateSession=x.asm.ea).apply(null,arguments)};x._OrtReleaseSession=function(){return(x._OrtReleaseSession=x.asm.fa).apply(null,arguments)};x._OrtGetInputCount=function(){return(x._OrtGetInputCount=x.asm.ga).apply(null,arguments)};x._OrtGetOutputCount=function(){return(x._OrtGetOutputCount=x.asm.ha).apply(null,arguments)};
+x._OrtGetInputName=function(){return(x._OrtGetInputName=x.asm.ia).apply(null,arguments)};x._OrtGetOutputName=function(){return(x._OrtGetOutputName=x.asm.ja).apply(null,arguments)};x._OrtFree=function(){return(x._OrtFree=x.asm.ka).apply(null,arguments)};x._OrtCreateTensor=function(){return(x._OrtCreateTensor=x.asm.la).apply(null,arguments)};x._OrtGetTensorData=function(){return(x._OrtGetTensorData=x.asm.ma).apply(null,arguments)};
+x._OrtReleaseTensor=function(){return(x._OrtReleaseTensor=x.asm.na).apply(null,arguments)};x._OrtCreateRunOptions=function(){return(x._OrtCreateRunOptions=x.asm.oa).apply(null,arguments)};x._OrtAddRunConfigEntry=function(){return(x._OrtAddRunConfigEntry=x.asm.pa).apply(null,arguments)};x._OrtReleaseRunOptions=function(){return(x._OrtReleaseRunOptions=x.asm.qa).apply(null,arguments)};x._OrtRun=function(){return(x._OrtRun=x.asm.ra).apply(null,arguments)};
+x._OrtEndProfiling=function(){return(x._OrtEndProfiling=x.asm.sa).apply(null,arguments)};var T=x._pthread_self=function(){return(T=x._pthread_self=x.asm.ta).apply(null,arguments)},qb=x._malloc=function(){return(qb=x._malloc=x.asm.ua).apply(null,arguments)};x._free=function(){return(x._free=x.asm.va).apply(null,arguments)};x.__emscripten_tls_init=function(){return(x.__emscripten_tls_init=x.asm.wa).apply(null,arguments)};
+var Qb=x.__emscripten_thread_init=function(){return(Qb=x.__emscripten_thread_init=x.asm.xa).apply(null,arguments)};x.__emscripten_thread_crashed=function(){return(x.__emscripten_thread_crashed=x.asm.ya).apply(null,arguments)};
+var vb=x._emscripten_run_in_main_runtime_thread_js=function(){return(vb=x._emscripten_run_in_main_runtime_thread_js=x.asm.Aa).apply(null,arguments)},lb=x.__emscripten_proxy_execute_task_queue=function(){return(lb=x.__emscripten_proxy_execute_task_queue=x.asm.Ba).apply(null,arguments)},Oa=x.__emscripten_thread_free_data=function(){return(Oa=x.__emscripten_thread_free_data=x.asm.Ca).apply(null,arguments)},Ta=x.__emscripten_thread_exit=function(){return(Ta=x.__emscripten_thread_exit=x.asm.Da).apply(null,
+arguments)},Sa=x._emscripten_stack_set_limits=function(){return(Sa=x._emscripten_stack_set_limits=x.asm.Ea).apply(null,arguments)},Ra=x.stackSave=function(){return(Ra=x.stackSave=x.asm.Fa).apply(null,arguments)},V=x.stackRestore=function(){return(V=x.stackRestore=x.asm.Ga).apply(null,arguments)},ub=x.stackAlloc=function(){return(ub=x.stackAlloc=x.asm.Ha).apply(null,arguments)};x.___cxa_is_pointer_type=function(){return(x.___cxa_is_pointer_type=x.asm.Ia).apply(null,arguments)};x.UTF8ToString=va;
+x.stringToUTF8=function(a,b,d){return wa(a,q(),b,d)};x.lengthBytesUTF8=xa;x.keepRuntimeAlive=function(){return noExitRuntime};x.wasmMemory=k;x.stackSave=Ra;x.stackRestore=V;x.stackAlloc=ub;x.ExitStatus=K;x.PThread=R;var Sb;P=function Tb(){Sb||Ub();Sb||(P=Tb)};
+function Ub(){function a(){if(!Sb&&(Sb=!0,x.calledRun=!0,!sa)){C||U(Ba);ha(x);if(x.onRuntimeInitialized)x.onRuntimeInitialized();if(!C){if(x.postRun)for("function"==typeof x.postRun&&(x.postRun=[x.postRun]);x.postRun.length;){var b=x.postRun.shift();Ca.unshift(b)}U(Ca)}}}if(!(0 {
+
+var __filename = "/index.js";
+var __dirname = "/";
+
+var ortWasm = (() => {
+ var _scriptDir = typeof document !== 'undefined' && document.currentScript ? document.currentScript.src : undefined;
+ if (true) _scriptDir = _scriptDir || __filename;
+ return (
+function(ortWasm) {
+ ortWasm = ortWasm || {};
+
+
+null;var b;b||(b=typeof ortWasm !== 'undefined' ? ortWasm : {});var aa,k;b.ready=new Promise(function(a,c){aa=a;k=c});var ba=Object.assign({},b),p="./this.program",t=(a,c)=>{throw c;},ca="object"==typeof window,u="function"==typeof importScripts,x="object"==typeof process&&"object"==typeof process.versions&&"string"==typeof process.versions.node,y="",z,A,C,fs,D,E;
+if(x)y=u?(__webpack_require__(/*! path */ "?75c6").dirname)(y)+"/":__dirname+"/",E=()=>{D||(fs=__webpack_require__(/*! fs */ "?63c8"),D=__webpack_require__(/*! path */ "?75c6"))},z=function(a,c){E();a=D.normalize(a);return fs.readFileSync(a,c?void 0:"utf8")},C=a=>{a=z(a,!0);a.buffer||(a=new Uint8Array(a));return a},A=(a,c,e)=>{E();a=D.normalize(a);fs.readFile(a,function(f,g){f?e(f):c(g.buffer)})},1{if(noExitRuntime)throw process.exitCode=a,c;c instanceof F||G("exiting due to exception: "+c);process.exit(a)},b.inspect=function(){return"[Emscripten Module object]"};else if(ca||u)u?y=self.location.href:"undefined"!=typeof document&&document.currentScript&&(y=document.currentScript.src),_scriptDir&&(y=_scriptDir),0!==y.indexOf("blob:")?y=y.substr(0,y.replace(/[?#].*/,"").lastIndexOf("/")+1):y="",z=a=>{var c=new XMLHttpRequest;c.open("GET",a,!1);c.send(null);return c.responseText},
+u&&(C=a=>{var c=new XMLHttpRequest;c.open("GET",a,!1);c.responseType="arraybuffer";c.send(null);return new Uint8Array(c.response)}),A=(a,c,e)=>{var f=new XMLHttpRequest;f.open("GET",a,!0);f.responseType="arraybuffer";f.onload=()=>{200==f.status||0==f.status&&f.response?c(f.response):e()};f.onerror=e;f.send(null)};var da=b.print||console.log.bind(console),G=b.printErr||console.warn.bind(console);Object.assign(b,ba);ba=null;b.thisProgram&&(p=b.thisProgram);b.quit&&(t=b.quit);var H;
+b.wasmBinary&&(H=b.wasmBinary);var noExitRuntime=b.noExitRuntime||!0;"object"!=typeof WebAssembly&&I("no native wasm support detected");var J,K=!1,ea="undefined"!=typeof TextDecoder?new TextDecoder("utf8"):void 0;
+function fa(a,c,e){c>>>=0;var f=c+e;for(e=c;a[e]&&!(e>=f);)++e;if(16g?f+=String.fromCharCode(g):(g-=65536,f+=String.fromCharCode(55296|g>>10,56320|g&1023))}}else f+=String.fromCharCode(g)}return f}function L(a,c){return(a>>>=0)?fa(M,a,c):""}
+function N(a,c,e,f){e>>>=0;if(!(0=l){var q=a.charCodeAt(++h);l=65536+((l&1023)<<10)|q&1023}if(127>=l){if(e>=f)break;c[e++>>>0]=l}else{if(2047>=l){if(e+1>=f)break;c[e++>>>0]=192|l>>6}else{if(65535>=l){if(e+2>=f)break;c[e++>>>0]=224|l>>12}else{if(e+3>=f)break;c[e++>>>0]=240|l>>18;c[e++>>>0]=128|l>>12&63}c[e++>>>0]=128|l>>6&63}c[e++>>>0]=128|l&63}}c[e>>>0]=0;return e-g}
+function O(a){for(var c=0,e=0;e=f?c++:2047>=f?c+=2:55296<=f&&57343>=f?(c+=4,++e):c+=3}return c}var ha,P,M,Q,R;function ia(){var a=J.buffer;ha=a;b.HEAP8=P=new Int8Array(a);b.HEAP16=new Int16Array(a);b.HEAP32=Q=new Int32Array(a);b.HEAPU8=M=new Uint8Array(a);b.HEAPU16=new Uint16Array(a);b.HEAPU32=R=new Uint32Array(a);b.HEAPF32=new Float32Array(a);b.HEAPF64=new Float64Array(a)}var ja=[],ka=[],la=[];function ma(){var a=b.preRun.shift();ja.unshift(a)}
+var S=0,T=null,U=null;function I(a){if(b.onAbort)b.onAbort(a);a="Aborted("+a+")";G(a);K=!0;a=new WebAssembly.RuntimeError(a+". Build with -sASSERTIONS for more info.");k(a);throw a;}function na(){return V.startsWith("data:application/octet-stream;base64,")}var V;V="ort-wasm.wasm";if(!na()){var oa=V;V=b.locateFile?b.locateFile(oa,y):y+oa}function pa(){var a=V;try{if(a==V&&H)return new Uint8Array(H);if(C)return C(a);throw"both async and sync fetching of the wasm failed";}catch(c){I(c)}}
+function qa(){if(!H&&(ca||u)){if("function"==typeof fetch&&!V.startsWith("file://"))return fetch(V,{credentials:"same-origin"}).then(function(a){if(!a.ok)throw"failed to load wasm binary file at '"+V+"'";return a.arrayBuffer()}).catch(function(){return pa()});if(A)return new Promise(function(a,c){A(V,function(e){a(new Uint8Array(e))},c)})}return Promise.resolve().then(function(){return pa()})}function F(a){this.name="ExitStatus";this.message="Program terminated with exit("+a+")";this.status=a}
+function W(a){for(;0>2>>>0]=c};this.Ba=function(c){R[this.sa+8>>2>>>0]=c};this.Ga=function(){Q[this.sa>>2>>>0]=0};this.Aa=function(){P[this.sa+12>>0>>>0]=0};this.Ha=function(){P[this.sa+13>>0>>>0]=0};this.ya=function(c,e){this.za();this.Ia(c);this.Ba(e);this.Ga();this.Aa();this.Ha()};this.za=function(){R[this.sa+16>>2>>>0]=0}}var sa=0;function ta(a){var c=O(a)+1,e=ua(c);e&&N(a,P,e,c);return e}
+function va(a,c,e){function f(w){return(w=w.toTimeString().match(/\(([A-Za-z ]+)\)$/))?w[1]:"GMT"}var g=(new Date).getFullYear(),h=new Date(g,0,1),l=new Date(g,6,1);g=h.getTimezoneOffset();var q=l.getTimezoneOffset();Q[a>>2>>>0]=60*Math.max(g,q);Q[c>>2>>>0]=Number(g!=q);a=f(h);c=f(l);a=ta(a);c=ta(c);q>2>>>0]=a,R[e+4>>2>>>0]=c):(R[e>>2>>>0]=c,R[e+4>>2>>>0]=a)}function wa(a,c,e){wa.xa||(wa.xa=!0,va(a,c,e))}var Aa={};
+function Ba(){if(!Ca){var a={USER:"web_user",LOGNAME:"web_user",PATH:"/",PWD:"/",HOME:"/home/web_user",LANG:("object"==typeof navigator&&navigator.languages&&navigator.languages[0]||"C").replace("-","_")+".UTF-8",_:p||"./this.program"},c;for(c in Aa)void 0===Aa[c]?delete a[c]:a[c]=Aa[c];var e=[];for(c in a)e.push(c+"="+a[c]);Ca=e}return Ca}var Ca,Da=[null,[],[]];
+function Ea(){if("object"==typeof crypto&&"function"==typeof crypto.getRandomValues){var a=new Uint8Array(1);return()=>{crypto.getRandomValues(a);return a[0]}}if(x)try{var c=__webpack_require__(/*! crypto */ "?892d");return()=>c.randomBytes(1)[0]}catch(e){}return()=>I("randomDevice")}function X(a,c){X.wa||(X.wa=Ea());for(var e=0;e>0>>>0]=X.wa();return 0}function Y(a){return 0===a%4&&(0!==a%100||0===a%400)}var Fa=[31,29,31,30,31,30,31,31,30,31,30,31],Ga=[31,28,31,30,31,30,31,31,30,31,30,31];
+function Ha(a){var c=Array(O(a)+1);N(a,c,0,c.length);return c}
+function Ia(a,c,e,f){function g(d,m,n){for(d="number"==typeof d?d.toString():d||"";d.lengthxa?-1:0B-d.getDate())m-=B-d.getDate()+1,d.setDate(1),11>n?d.setMonth(n+1):(d.setMonth(0),d.setFullYear(d.getFullYear()+1));else{d.setDate(d.getDate()+m);break}}n=new Date(d.getFullYear()+1,0,4);m=q(new Date(d.getFullYear(),
+0,4));n=q(n);return 0>=l(m,d)?0>=l(n,d)?d.getFullYear()+1:d.getFullYear():d.getFullYear()-1}var v=Q[f+40>>2>>>0];f={Ea:Q[f>>2>>>0],Da:Q[f+4>>2>>>0],ta:Q[f+8>>2>>>0],va:Q[f+12>>2>>>0],ua:Q[f+16>>2>>>0],ra:Q[f+20>>2>>>0],la:Q[f+24>>2>>>0],qa:Q[f+28>>2>>>0],Ja:Q[f+32>>2>>>0],Ca:Q[f+36>>2>>>0],Fa:v?L(v):""};e=L(e);v={"%c":"%a %b %d %H:%M:%S %Y","%D":"%m/%d/%y","%F":"%Y-%m-%d","%h":"%b","%r":"%I:%M:%S %p","%R":"%H:%M","%T":"%H:%M:%S","%x":"%m/%d/%y","%X":"%H:%M:%S","%Ec":"%c","%EC":"%C","%Ex":"%m/%d/%y",
+"%EX":"%H:%M:%S","%Ey":"%y","%EY":"%Y","%Od":"%d","%Oe":"%e","%OH":"%H","%OI":"%I","%Om":"%m","%OM":"%M","%OS":"%S","%Ou":"%u","%OU":"%U","%OV":"%V","%Ow":"%w","%OW":"%W","%Oy":"%y"};for(var r in v)e=e.replace(new RegExp(r,"g"),v[r]);var ya="Sunday Monday Tuesday Wednesday Thursday Friday Saturday".split(" "),za="January February March April May June July August September October November December".split(" ");v={"%a":function(d){return ya[d.la].substring(0,3)},"%A":function(d){return ya[d.la]},"%b":function(d){return za[d.ua].substring(0,
+3)},"%B":function(d){return za[d.ua]},"%C":function(d){return h((d.ra+1900)/100|0,2)},"%d":function(d){return h(d.va,2)},"%e":function(d){return g(d.va,2," ")},"%g":function(d){return w(d).toString().substring(2)},"%G":function(d){return w(d)},"%H":function(d){return h(d.ta,2)},"%I":function(d){d=d.ta;0==d?d=12:12d.ta?"AM":"PM"},"%S":function(d){return h(d.Ea,2)},"%t":function(){return"\t"},"%u":function(d){return d.la||7},"%U":function(d){return h(Math.floor((d.qa+7-d.la)/7),2)},"%V":function(d){var m=Math.floor((d.qa+7-(d.la+6)%7)/7);2>=(d.la+371-d.qa-2)%7&&m++;if(m)53==m&&(n=(d.la+371-d.qa)%7,4==n||3==n&&Y(d.ra)||(m=1));else{m=52;var n=(d.la+7-d.qa-1)%7;(4==n||5==n&&Y(d.ra%400-1))&&m++}return h(m,2)},"%w":function(d){return d.la},"%W":function(d){return h(Math.floor((d.qa+
+7-(d.la+6)%7)/7),2)},"%y":function(d){return(d.ra+1900).toString().substring(2)},"%Y":function(d){return d.ra+1900},"%z":function(d){d=d.Ca;var m=0<=d;d=Math.abs(d)/60;return(m?"+":"-")+String("0000"+(d/60*100+d%60)).slice(-4)},"%Z":function(d){return d.Fa},"%%":function(){return"%"}};e=e.replace(/%%/g,"\x00\x00");for(r in v)e.includes(r)&&(e=e.replace(new RegExp(r,"g"),v[r](f)));e=e.replace(/\0\0/g,"%");r=Ha(e);if(r.length>c)return 0;P.set(r,a>>>0);return r.length-1}
+var Ja={a:function(a){return ua(a+24)+24},b:function(a,c,e){(new ra(a)).ya(c,e);sa++;throw a;},g:function(){return 0},I:function(){},w:function(){},y:function(){},K:function(){return 0},G:function(){},C:function(){},F:function(){},k:function(){},x:function(){},u:function(){},H:function(){},v:function(){},n:function(){},p:function(){I("To use dlopen, you need enable dynamic linking, see https://github.com/emscripten-core/emscripten/wiki/Linking")},o:function(){I("To use dlopen, you need enable dynamic linking, see https://github.com/emscripten-core/emscripten/wiki/Linking")},
+l:function(){return Date.now()},L:function(){return!0},M:function(a,c){a=new Date(1E3*(R[a>>>2]+4294967296*Q[a+4>>>2]));Q[c>>2>>>0]=a.getUTCSeconds();Q[c+4>>2>>>0]=a.getUTCMinutes();Q[c+8>>2>>>0]=a.getUTCHours();Q[c+12>>2>>>0]=a.getUTCDate();Q[c+16>>2>>>0]=a.getUTCMonth();Q[c+20>>2>>>0]=a.getUTCFullYear()-1900;Q[c+24>>2>>>0]=a.getUTCDay();Q[c+28>>2>>>0]=(a.getTime()-Date.UTC(a.getUTCFullYear(),0,1,0,0,0,0))/864E5|0},N:function(a,c){a=new Date(1E3*(R[a>>>2]+4294967296*Q[a+4>>>2]));Q[c>>2>>>0]=a.getSeconds();
+Q[c+4>>2>>>0]=a.getMinutes();Q[c+8>>2>>>0]=a.getHours();Q[c+12>>2>>>0]=a.getDate();Q[c+16>>2>>>0]=a.getMonth();Q[c+20>>2>>>0]=a.getFullYear()-1900;Q[c+24>>2>>>0]=a.getDay();var e=new Date(a.getFullYear(),0,1);Q[c+28>>2>>>0]=(a.getTime()-e.getTime())/864E5|0;Q[c+36>>2>>>0]=-(60*a.getTimezoneOffset());var f=(new Date(a.getFullYear(),6,1)).getTimezoneOffset();e=e.getTimezoneOffset();Q[c+32>>2>>>0]=(f!=e&&a.getTimezoneOffset()==Math.min(e,f))|0},O:function(a){var c=new Date(Q[a+20>>2>>>0]+1900,Q[a+16>>
+2>>>0],Q[a+12>>2>>>0],Q[a+8>>2>>>0],Q[a+4>>2>>>0],Q[a>>2>>>0],0),e=Q[a+32>>2>>>0],f=c.getTimezoneOffset(),g=new Date(c.getFullYear(),0,1),h=(new Date(c.getFullYear(),6,1)).getTimezoneOffset(),l=g.getTimezoneOffset(),q=Math.min(l,h);0>e?Q[a+32>>2>>>0]=Number(h!=l&&q==f):0>2>>>0]=c.getDay();Q[a+28>>2>>>0]=(c.getTime()-g.getTime())/864E5|0;Q[a>>2>>>0]=c.getSeconds();Q[a+4>>2>>>0]=c.getMinutes();Q[a+8>>2>>>0]=c.getHours();Q[a+
+12>>2>>>0]=c.getDate();Q[a+16>>2>>>0]=c.getMonth();return c.getTime()/1E3|0},z:function(){return-52},B:function(){},m:wa,d:function(){I("")},t:function(){return 4294901760},h:x?()=>{var a=process.hrtime();return 1E3*a[0]+a[1]/1E6}:()=>performance.now(),J:function(a,c,e){M.copyWithin(a>>>0,c>>>0,c+e>>>0)},f:function(a){var c=M.length;a>>>=0;if(4294901760=e;e*=2){var f=c*(1+.2/e);f=Math.min(f,a+100663296);var g=Math;f=Math.max(a,f);g=g.min.call(g,4294901760,f+(65536-f%65536)%
+65536);a:{try{J.grow(g-ha.byteLength+65535>>>16);ia();var h=1;break a}catch(l){}h=void 0}if(h)return!0}return!1},D:function(a,c){var e=0;Ba().forEach(function(f,g){var h=c+e;g=R[a+4*g>>2>>>0]=h;for(h=0;h>0>>>0]=f.charCodeAt(h);P[g>>0>>>0]=0;e+=f.length+1});return 0},E:function(a,c){var e=Ba();R[a>>2>>>0]=e.length;var f=0;e.forEach(function(g){f+=g.length+1});R[c>>2>>>0]=f;return 0},r:function(a){if(!noExitRuntime){if(b.onExit)b.onExit(a);K=!0}t(a,new F(a))},e:function(){return 52},
+j:function(){return 52},q:function(){return 70},i:function(a,c,e,f){for(var g=0,h=0;h>2>>>0],q=R[c+4>>2>>>0];c+=8;for(var w=0;w>>0],r=Da[a];0===v||10===v?((1===a?da:G)(fa(r,0)),r.length=0):r.push(v)}g+=q}R[f>>2>>>0]=g;return 0},s:X,A:Ia,c:function(a,c,e,f){return Ia(a,c,e,f)}};
+(function(){function a(g){b.asm=g.exports;J=b.asm.P;ia();ka.unshift(b.asm.Q);S--;b.monitorRunDependencies&&b.monitorRunDependencies(S);0==S&&(null!==T&&(clearInterval(T),T=null),U&&(g=U,U=null,g()))}function c(g){a(g.instance)}function e(g){return qa().then(function(h){return WebAssembly.instantiate(h,f)}).then(function(h){return h}).then(g,function(h){G("failed to asynchronously prepare wasm: "+h);I(h)})}var f={a:Ja};S++;b.monitorRunDependencies&&b.monitorRunDependencies(S);if(b.instantiateWasm)try{return b.instantiateWasm(f,
+a)}catch(g){return G("Module.instantiateWasm callback failed with error: "+g),!1}(function(){return H||"function"!=typeof WebAssembly.instantiateStreaming||na()||V.startsWith("file://")||x||"function"!=typeof fetch?e(c):fetch(V,{credentials:"same-origin"}).then(function(g){return WebAssembly.instantiateStreaming(g,f).then(c,function(h){G("wasm streaming compile failed: "+h);G("falling back to ArrayBuffer instantiation");return e(c)})})})().catch(k);return{}})();
+b.___wasm_call_ctors=function(){return(b.___wasm_call_ctors=b.asm.Q).apply(null,arguments)};b._OrtInit=function(){return(b._OrtInit=b.asm.R).apply(null,arguments)};b._OrtCreateSessionOptions=function(){return(b._OrtCreateSessionOptions=b.asm.S).apply(null,arguments)};b._OrtAppendExecutionProvider=function(){return(b._OrtAppendExecutionProvider=b.asm.T).apply(null,arguments)};b._OrtAddSessionConfigEntry=function(){return(b._OrtAddSessionConfigEntry=b.asm.U).apply(null,arguments)};
+b._OrtReleaseSessionOptions=function(){return(b._OrtReleaseSessionOptions=b.asm.V).apply(null,arguments)};b._OrtCreateSession=function(){return(b._OrtCreateSession=b.asm.W).apply(null,arguments)};b._OrtReleaseSession=function(){return(b._OrtReleaseSession=b.asm.X).apply(null,arguments)};b._OrtGetInputCount=function(){return(b._OrtGetInputCount=b.asm.Y).apply(null,arguments)};b._OrtGetOutputCount=function(){return(b._OrtGetOutputCount=b.asm.Z).apply(null,arguments)};
+b._OrtGetInputName=function(){return(b._OrtGetInputName=b.asm._).apply(null,arguments)};b._OrtGetOutputName=function(){return(b._OrtGetOutputName=b.asm.$).apply(null,arguments)};b._OrtFree=function(){return(b._OrtFree=b.asm.aa).apply(null,arguments)};b._OrtCreateTensor=function(){return(b._OrtCreateTensor=b.asm.ba).apply(null,arguments)};b._OrtGetTensorData=function(){return(b._OrtGetTensorData=b.asm.ca).apply(null,arguments)};
+b._OrtReleaseTensor=function(){return(b._OrtReleaseTensor=b.asm.da).apply(null,arguments)};b._OrtCreateRunOptions=function(){return(b._OrtCreateRunOptions=b.asm.ea).apply(null,arguments)};b._OrtAddRunConfigEntry=function(){return(b._OrtAddRunConfigEntry=b.asm.fa).apply(null,arguments)};b._OrtReleaseRunOptions=function(){return(b._OrtReleaseRunOptions=b.asm.ga).apply(null,arguments)};b._OrtRun=function(){return(b._OrtRun=b.asm.ha).apply(null,arguments)};
+b._OrtEndProfiling=function(){return(b._OrtEndProfiling=b.asm.ia).apply(null,arguments)};var ua=b._malloc=function(){return(ua=b._malloc=b.asm.ja).apply(null,arguments)};b._free=function(){return(b._free=b.asm.ka).apply(null,arguments)};var Ka=b.stackSave=function(){return(Ka=b.stackSave=b.asm.ma).apply(null,arguments)},La=b.stackRestore=function(){return(La=b.stackRestore=b.asm.na).apply(null,arguments)},Ma=b.stackAlloc=function(){return(Ma=b.stackAlloc=b.asm.oa).apply(null,arguments)};
+b.___cxa_is_pointer_type=function(){return(b.___cxa_is_pointer_type=b.asm.pa).apply(null,arguments)};b.UTF8ToString=L;b.stringToUTF8=function(a,c,e){return N(a,M,c,e)};b.lengthBytesUTF8=O;b.stackSave=Ka;b.stackRestore=La;b.stackAlloc=Ma;var Z;U=function Na(){Z||Oa();Z||(U=Na)};
+function Oa(){function a(){if(!Z&&(Z=!0,b.calledRun=!0,!K)){W(ka);aa(b);if(b.onRuntimeInitialized)b.onRuntimeInitialized();if(b.postRun)for("function"==typeof b.postRun&&(b.postRun=[b.postRun]);b.postRun.length;){var c=b.postRun.shift();la.unshift(c)}W(la)}}if(!(0 {
+
+"use strict";
+
+module.exports = asPromise;
+
+/**
+ * Callback as used by {@link util.asPromise}.
+ * @typedef asPromiseCallback
+ * @type {function}
+ * @param {Error|null} error Error, if any
+ * @param {...*} params Additional arguments
+ * @returns {undefined}
+ */
+
+/**
+ * Returns a promise from a node-style callback function.
+ * @memberof util
+ * @param {asPromiseCallback} fn Function to call
+ * @param {*} ctx Function context
+ * @param {...*} params Function arguments
+ * @returns {Promise<*>} Promisified function
+ */
+function asPromise(fn, ctx/*, varargs */) {
+ var params = new Array(arguments.length - 1),
+ offset = 0,
+ index = 2,
+ pending = true;
+ while (index < arguments.length)
+ params[offset++] = arguments[index++];
+ return new Promise(function executor(resolve, reject) {
+ params[offset] = function callback(err/*, varargs */) {
+ if (pending) {
+ pending = false;
+ if (err)
+ reject(err);
+ else {
+ var params = new Array(arguments.length - 1),
+ offset = 0;
+ while (offset < params.length)
+ params[offset++] = arguments[offset];
+ resolve.apply(null, params);
+ }
+ }
+ };
+ try {
+ fn.apply(ctx || null, params);
+ } catch (err) {
+ if (pending) {
+ pending = false;
+ reject(err);
+ }
+ }
+ });
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/@protobufjs/base64/index.js":
+/*!**************************************************!*\
+ !*** ./node_modules/@protobufjs/base64/index.js ***!
+ \**************************************************/
+/***/ ((__unused_webpack_module, exports) => {
+
+"use strict";
+
+
+/**
+ * A minimal base64 implementation for number arrays.
+ * @memberof util
+ * @namespace
+ */
+var base64 = exports;
+
+/**
+ * Calculates the byte length of a base64 encoded string.
+ * @param {string} string Base64 encoded string
+ * @returns {number} Byte length
+ */
+base64.length = function length(string) {
+ var p = string.length;
+ if (!p)
+ return 0;
+ var n = 0;
+ while (--p % 4 > 1 && string.charAt(p) === "=")
+ ++n;
+ return Math.ceil(string.length * 3) / 4 - n;
+};
+
+// Base64 encoding table
+var b64 = new Array(64);
+
+// Base64 decoding table
+var s64 = new Array(123);
+
+// 65..90, 97..122, 48..57, 43, 47
+for (var i = 0; i < 64;)
+ s64[b64[i] = i < 26 ? i + 65 : i < 52 ? i + 71 : i < 62 ? i - 4 : i - 59 | 43] = i++;
+
+/**
+ * Encodes a buffer to a base64 encoded string.
+ * @param {Uint8Array} buffer Source buffer
+ * @param {number} start Source start
+ * @param {number} end Source end
+ * @returns {string} Base64 encoded string
+ */
+base64.encode = function encode(buffer, start, end) {
+ var parts = null,
+ chunk = [];
+ var i = 0, // output index
+ j = 0, // goto index
+ t; // temporary
+ while (start < end) {
+ var b = buffer[start++];
+ switch (j) {
+ case 0:
+ chunk[i++] = b64[b >> 2];
+ t = (b & 3) << 4;
+ j = 1;
+ break;
+ case 1:
+ chunk[i++] = b64[t | b >> 4];
+ t = (b & 15) << 2;
+ j = 2;
+ break;
+ case 2:
+ chunk[i++] = b64[t | b >> 6];
+ chunk[i++] = b64[b & 63];
+ j = 0;
+ break;
+ }
+ if (i > 8191) {
+ (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));
+ i = 0;
+ }
+ }
+ if (j) {
+ chunk[i++] = b64[t];
+ chunk[i++] = 61;
+ if (j === 1)
+ chunk[i++] = 61;
+ }
+ if (parts) {
+ if (i)
+ parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));
+ return parts.join("");
+ }
+ return String.fromCharCode.apply(String, chunk.slice(0, i));
+};
+
+var invalidEncoding = "invalid encoding";
+
+/**
+ * Decodes a base64 encoded string to a buffer.
+ * @param {string} string Source string
+ * @param {Uint8Array} buffer Destination buffer
+ * @param {number} offset Destination offset
+ * @returns {number} Number of bytes written
+ * @throws {Error} If encoding is invalid
+ */
+base64.decode = function decode(string, buffer, offset) {
+ var start = offset;
+ var j = 0, // goto index
+ t; // temporary
+ for (var i = 0; i < string.length;) {
+ var c = string.charCodeAt(i++);
+ if (c === 61 && j > 1)
+ break;
+ if ((c = s64[c]) === undefined)
+ throw Error(invalidEncoding);
+ switch (j) {
+ case 0:
+ t = c;
+ j = 1;
+ break;
+ case 1:
+ buffer[offset++] = t << 2 | (c & 48) >> 4;
+ t = c;
+ j = 2;
+ break;
+ case 2:
+ buffer[offset++] = (t & 15) << 4 | (c & 60) >> 2;
+ t = c;
+ j = 3;
+ break;
+ case 3:
+ buffer[offset++] = (t & 3) << 6 | c;
+ j = 0;
+ break;
+ }
+ }
+ if (j === 1)
+ throw Error(invalidEncoding);
+ return offset - start;
+};
+
+/**
+ * Tests if the specified string appears to be base64 encoded.
+ * @param {string} string String to test
+ * @returns {boolean} `true` if probably base64 encoded, otherwise false
+ */
+base64.test = function test(string) {
+ return /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(string);
+};
+
+
+/***/ }),
+
+/***/ "./node_modules/@protobufjs/eventemitter/index.js":
+/*!********************************************************!*\
+ !*** ./node_modules/@protobufjs/eventemitter/index.js ***!
+ \********************************************************/
+/***/ ((module) => {
+
+"use strict";
+
+module.exports = EventEmitter;
+
+/**
+ * Constructs a new event emitter instance.
+ * @classdesc A minimal event emitter.
+ * @memberof util
+ * @constructor
+ */
+function EventEmitter() {
+
+ /**
+ * Registered listeners.
+ * @type {Object.}
+ * @private
+ */
+ this._listeners = {};
+}
+
+/**
+ * Registers an event listener.
+ * @param {string} evt Event name
+ * @param {function} fn Listener
+ * @param {*} [ctx] Listener context
+ * @returns {util.EventEmitter} `this`
+ */
+EventEmitter.prototype.on = function on(evt, fn, ctx) {
+ (this._listeners[evt] || (this._listeners[evt] = [])).push({
+ fn : fn,
+ ctx : ctx || this
+ });
+ return this;
+};
+
+/**
+ * Removes an event listener or any matching listeners if arguments are omitted.
+ * @param {string} [evt] Event name. Removes all listeners if omitted.
+ * @param {function} [fn] Listener to remove. Removes all listeners of `evt` if omitted.
+ * @returns {util.EventEmitter} `this`
+ */
+EventEmitter.prototype.off = function off(evt, fn) {
+ if (evt === undefined)
+ this._listeners = {};
+ else {
+ if (fn === undefined)
+ this._listeners[evt] = [];
+ else {
+ var listeners = this._listeners[evt];
+ for (var i = 0; i < listeners.length;)
+ if (listeners[i].fn === fn)
+ listeners.splice(i, 1);
+ else
+ ++i;
+ }
+ }
+ return this;
+};
+
+/**
+ * Emits an event by calling its listeners with the specified arguments.
+ * @param {string} evt Event name
+ * @param {...*} args Arguments
+ * @returns {util.EventEmitter} `this`
+ */
+EventEmitter.prototype.emit = function emit(evt) {
+ var listeners = this._listeners[evt];
+ if (listeners) {
+ var args = [],
+ i = 1;
+ for (; i < arguments.length;)
+ args.push(arguments[i++]);
+ for (i = 0; i < listeners.length;)
+ listeners[i].fn.apply(listeners[i++].ctx, args);
+ }
+ return this;
+};
+
+
+/***/ }),
+
+/***/ "./node_modules/@protobufjs/float/index.js":
+/*!*************************************************!*\
+ !*** ./node_modules/@protobufjs/float/index.js ***!
+ \*************************************************/
+/***/ ((module) => {
+
+"use strict";
+
+
+module.exports = factory(factory);
+
+/**
+ * Reads / writes floats / doubles from / to buffers.
+ * @name util.float
+ * @namespace
+ */
+
+/**
+ * Writes a 32 bit float to a buffer using little endian byte order.
+ * @name util.float.writeFloatLE
+ * @function
+ * @param {number} val Value to write
+ * @param {Uint8Array} buf Target buffer
+ * @param {number} pos Target buffer offset
+ * @returns {undefined}
+ */
+
+/**
+ * Writes a 32 bit float to a buffer using big endian byte order.
+ * @name util.float.writeFloatBE
+ * @function
+ * @param {number} val Value to write
+ * @param {Uint8Array} buf Target buffer
+ * @param {number} pos Target buffer offset
+ * @returns {undefined}
+ */
+
+/**
+ * Reads a 32 bit float from a buffer using little endian byte order.
+ * @name util.float.readFloatLE
+ * @function
+ * @param {Uint8Array} buf Source buffer
+ * @param {number} pos Source buffer offset
+ * @returns {number} Value read
+ */
+
+/**
+ * Reads a 32 bit float from a buffer using big endian byte order.
+ * @name util.float.readFloatBE
+ * @function
+ * @param {Uint8Array} buf Source buffer
+ * @param {number} pos Source buffer offset
+ * @returns {number} Value read
+ */
+
+/**
+ * Writes a 64 bit double to a buffer using little endian byte order.
+ * @name util.float.writeDoubleLE
+ * @function
+ * @param {number} val Value to write
+ * @param {Uint8Array} buf Target buffer
+ * @param {number} pos Target buffer offset
+ * @returns {undefined}
+ */
+
+/**
+ * Writes a 64 bit double to a buffer using big endian byte order.
+ * @name util.float.writeDoubleBE
+ * @function
+ * @param {number} val Value to write
+ * @param {Uint8Array} buf Target buffer
+ * @param {number} pos Target buffer offset
+ * @returns {undefined}
+ */
+
+/**
+ * Reads a 64 bit double from a buffer using little endian byte order.
+ * @name util.float.readDoubleLE
+ * @function
+ * @param {Uint8Array} buf Source buffer
+ * @param {number} pos Source buffer offset
+ * @returns {number} Value read
+ */
+
+/**
+ * Reads a 64 bit double from a buffer using big endian byte order.
+ * @name util.float.readDoubleBE
+ * @function
+ * @param {Uint8Array} buf Source buffer
+ * @param {number} pos Source buffer offset
+ * @returns {number} Value read
+ */
+
+// Factory function for the purpose of node-based testing in modified global environments
+function factory(exports) {
+
+ // float: typed array
+ if (typeof Float32Array !== "undefined") (function() {
+
+ var f32 = new Float32Array([ -0 ]),
+ f8b = new Uint8Array(f32.buffer),
+ le = f8b[3] === 128;
+
+ function writeFloat_f32_cpy(val, buf, pos) {
+ f32[0] = val;
+ buf[pos ] = f8b[0];
+ buf[pos + 1] = f8b[1];
+ buf[pos + 2] = f8b[2];
+ buf[pos + 3] = f8b[3];
+ }
+
+ function writeFloat_f32_rev(val, buf, pos) {
+ f32[0] = val;
+ buf[pos ] = f8b[3];
+ buf[pos + 1] = f8b[2];
+ buf[pos + 2] = f8b[1];
+ buf[pos + 3] = f8b[0];
+ }
+
+ /* istanbul ignore next */
+ exports.writeFloatLE = le ? writeFloat_f32_cpy : writeFloat_f32_rev;
+ /* istanbul ignore next */
+ exports.writeFloatBE = le ? writeFloat_f32_rev : writeFloat_f32_cpy;
+
+ function readFloat_f32_cpy(buf, pos) {
+ f8b[0] = buf[pos ];
+ f8b[1] = buf[pos + 1];
+ f8b[2] = buf[pos + 2];
+ f8b[3] = buf[pos + 3];
+ return f32[0];
+ }
+
+ function readFloat_f32_rev(buf, pos) {
+ f8b[3] = buf[pos ];
+ f8b[2] = buf[pos + 1];
+ f8b[1] = buf[pos + 2];
+ f8b[0] = buf[pos + 3];
+ return f32[0];
+ }
+
+ /* istanbul ignore next */
+ exports.readFloatLE = le ? readFloat_f32_cpy : readFloat_f32_rev;
+ /* istanbul ignore next */
+ exports.readFloatBE = le ? readFloat_f32_rev : readFloat_f32_cpy;
+
+ // float: ieee754
+ })(); else (function() {
+
+ function writeFloat_ieee754(writeUint, val, buf, pos) {
+ var sign = val < 0 ? 1 : 0;
+ if (sign)
+ val = -val;
+ if (val === 0)
+ writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos);
+ else if (isNaN(val))
+ writeUint(2143289344, buf, pos);
+ else if (val > 3.4028234663852886e+38) // +-Infinity
+ writeUint((sign << 31 | 2139095040) >>> 0, buf, pos);
+ else if (val < 1.1754943508222875e-38) // denormal
+ writeUint((sign << 31 | Math.round(val / 1.401298464324817e-45)) >>> 0, buf, pos);
+ else {
+ var exponent = Math.floor(Math.log(val) / Math.LN2),
+ mantissa = Math.round(val * Math.pow(2, -exponent) * 8388608) & 8388607;
+ writeUint((sign << 31 | exponent + 127 << 23 | mantissa) >>> 0, buf, pos);
+ }
+ }
+
+ exports.writeFloatLE = writeFloat_ieee754.bind(null, writeUintLE);
+ exports.writeFloatBE = writeFloat_ieee754.bind(null, writeUintBE);
+
+ function readFloat_ieee754(readUint, buf, pos) {
+ var uint = readUint(buf, pos),
+ sign = (uint >> 31) * 2 + 1,
+ exponent = uint >>> 23 & 255,
+ mantissa = uint & 8388607;
+ return exponent === 255
+ ? mantissa
+ ? NaN
+ : sign * Infinity
+ : exponent === 0 // denormal
+ ? sign * 1.401298464324817e-45 * mantissa
+ : sign * Math.pow(2, exponent - 150) * (mantissa + 8388608);
+ }
+
+ exports.readFloatLE = readFloat_ieee754.bind(null, readUintLE);
+ exports.readFloatBE = readFloat_ieee754.bind(null, readUintBE);
+
+ })();
+
+ // double: typed array
+ if (typeof Float64Array !== "undefined") (function() {
+
+ var f64 = new Float64Array([-0]),
+ f8b = new Uint8Array(f64.buffer),
+ le = f8b[7] === 128;
+
+ function writeDouble_f64_cpy(val, buf, pos) {
+ f64[0] = val;
+ buf[pos ] = f8b[0];
+ buf[pos + 1] = f8b[1];
+ buf[pos + 2] = f8b[2];
+ buf[pos + 3] = f8b[3];
+ buf[pos + 4] = f8b[4];
+ buf[pos + 5] = f8b[5];
+ buf[pos + 6] = f8b[6];
+ buf[pos + 7] = f8b[7];
+ }
+
+ function writeDouble_f64_rev(val, buf, pos) {
+ f64[0] = val;
+ buf[pos ] = f8b[7];
+ buf[pos + 1] = f8b[6];
+ buf[pos + 2] = f8b[5];
+ buf[pos + 3] = f8b[4];
+ buf[pos + 4] = f8b[3];
+ buf[pos + 5] = f8b[2];
+ buf[pos + 6] = f8b[1];
+ buf[pos + 7] = f8b[0];
+ }
+
+ /* istanbul ignore next */
+ exports.writeDoubleLE = le ? writeDouble_f64_cpy : writeDouble_f64_rev;
+ /* istanbul ignore next */
+ exports.writeDoubleBE = le ? writeDouble_f64_rev : writeDouble_f64_cpy;
+
+ function readDouble_f64_cpy(buf, pos) {
+ f8b[0] = buf[pos ];
+ f8b[1] = buf[pos + 1];
+ f8b[2] = buf[pos + 2];
+ f8b[3] = buf[pos + 3];
+ f8b[4] = buf[pos + 4];
+ f8b[5] = buf[pos + 5];
+ f8b[6] = buf[pos + 6];
+ f8b[7] = buf[pos + 7];
+ return f64[0];
+ }
+
+ function readDouble_f64_rev(buf, pos) {
+ f8b[7] = buf[pos ];
+ f8b[6] = buf[pos + 1];
+ f8b[5] = buf[pos + 2];
+ f8b[4] = buf[pos + 3];
+ f8b[3] = buf[pos + 4];
+ f8b[2] = buf[pos + 5];
+ f8b[1] = buf[pos + 6];
+ f8b[0] = buf[pos + 7];
+ return f64[0];
+ }
+
+ /* istanbul ignore next */
+ exports.readDoubleLE = le ? readDouble_f64_cpy : readDouble_f64_rev;
+ /* istanbul ignore next */
+ exports.readDoubleBE = le ? readDouble_f64_rev : readDouble_f64_cpy;
+
+ // double: ieee754
+ })(); else (function() {
+
+ function writeDouble_ieee754(writeUint, off0, off1, val, buf, pos) {
+ var sign = val < 0 ? 1 : 0;
+ if (sign)
+ val = -val;
+ if (val === 0) {
+ writeUint(0, buf, pos + off0);
+ writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos + off1);
+ } else if (isNaN(val)) {
+ writeUint(0, buf, pos + off0);
+ writeUint(2146959360, buf, pos + off1);
+ } else if (val > 1.7976931348623157e+308) { // +-Infinity
+ writeUint(0, buf, pos + off0);
+ writeUint((sign << 31 | 2146435072) >>> 0, buf, pos + off1);
+ } else {
+ var mantissa;
+ if (val < 2.2250738585072014e-308) { // denormal
+ mantissa = val / 5e-324;
+ writeUint(mantissa >>> 0, buf, pos + off0);
+ writeUint((sign << 31 | mantissa / 4294967296) >>> 0, buf, pos + off1);
+ } else {
+ var exponent = Math.floor(Math.log(val) / Math.LN2);
+ if (exponent === 1024)
+ exponent = 1023;
+ mantissa = val * Math.pow(2, -exponent);
+ writeUint(mantissa * 4503599627370496 >>> 0, buf, pos + off0);
+ writeUint((sign << 31 | exponent + 1023 << 20 | mantissa * 1048576 & 1048575) >>> 0, buf, pos + off1);
+ }
+ }
+ }
+
+ exports.writeDoubleLE = writeDouble_ieee754.bind(null, writeUintLE, 0, 4);
+ exports.writeDoubleBE = writeDouble_ieee754.bind(null, writeUintBE, 4, 0);
+
+ function readDouble_ieee754(readUint, off0, off1, buf, pos) {
+ var lo = readUint(buf, pos + off0),
+ hi = readUint(buf, pos + off1);
+ var sign = (hi >> 31) * 2 + 1,
+ exponent = hi >>> 20 & 2047,
+ mantissa = 4294967296 * (hi & 1048575) + lo;
+ return exponent === 2047
+ ? mantissa
+ ? NaN
+ : sign * Infinity
+ : exponent === 0 // denormal
+ ? sign * 5e-324 * mantissa
+ : sign * Math.pow(2, exponent - 1075) * (mantissa + 4503599627370496);
+ }
+
+ exports.readDoubleLE = readDouble_ieee754.bind(null, readUintLE, 0, 4);
+ exports.readDoubleBE = readDouble_ieee754.bind(null, readUintBE, 4, 0);
+
+ })();
+
+ return exports;
+}
+
+// uint helpers
+
+function writeUintLE(val, buf, pos) {
+ buf[pos ] = val & 255;
+ buf[pos + 1] = val >>> 8 & 255;
+ buf[pos + 2] = val >>> 16 & 255;
+ buf[pos + 3] = val >>> 24;
+}
+
+function writeUintBE(val, buf, pos) {
+ buf[pos ] = val >>> 24;
+ buf[pos + 1] = val >>> 16 & 255;
+ buf[pos + 2] = val >>> 8 & 255;
+ buf[pos + 3] = val & 255;
+}
+
+function readUintLE(buf, pos) {
+ return (buf[pos ]
+ | buf[pos + 1] << 8
+ | buf[pos + 2] << 16
+ | buf[pos + 3] << 24) >>> 0;
+}
+
+function readUintBE(buf, pos) {
+ return (buf[pos ] << 24
+ | buf[pos + 1] << 16
+ | buf[pos + 2] << 8
+ | buf[pos + 3]) >>> 0;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/@protobufjs/inquire/index.js":
+/*!***************************************************!*\
+ !*** ./node_modules/@protobufjs/inquire/index.js ***!
+ \***************************************************/
+/***/ ((module) => {
+
+"use strict";
+
+module.exports = inquire;
+
+/**
+ * Requires a module only if available.
+ * @memberof util
+ * @param {string} moduleName Module to require
+ * @returns {?Object} Required module if available and not empty, otherwise `null`
+ */
+function inquire(moduleName) {
+ try {
+ var mod = eval("quire".replace(/^/,"re"))(moduleName); // eslint-disable-line no-eval
+ if (mod && (mod.length || Object.keys(mod).length))
+ return mod;
+ } catch (e) {} // eslint-disable-line no-empty
+ return null;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/@protobufjs/pool/index.js":
+/*!************************************************!*\
+ !*** ./node_modules/@protobufjs/pool/index.js ***!
+ \************************************************/
+/***/ ((module) => {
+
+"use strict";
+
+module.exports = pool;
+
+/**
+ * An allocator as used by {@link util.pool}.
+ * @typedef PoolAllocator
+ * @type {function}
+ * @param {number} size Buffer size
+ * @returns {Uint8Array} Buffer
+ */
+
+/**
+ * A slicer as used by {@link util.pool}.
+ * @typedef PoolSlicer
+ * @type {function}
+ * @param {number} start Start offset
+ * @param {number} end End offset
+ * @returns {Uint8Array} Buffer slice
+ * @this {Uint8Array}
+ */
+
+/**
+ * A general purpose buffer pool.
+ * @memberof util
+ * @function
+ * @param {PoolAllocator} alloc Allocator
+ * @param {PoolSlicer} slice Slicer
+ * @param {number} [size=8192] Slab size
+ * @returns {PoolAllocator} Pooled allocator
+ */
+function pool(alloc, slice, size) {
+ var SIZE = size || 8192;
+ var MAX = SIZE >>> 1;
+ var slab = null;
+ var offset = SIZE;
+ return function pool_alloc(size) {
+ if (size < 1 || size > MAX)
+ return alloc(size);
+ if (offset + size > SIZE) {
+ slab = alloc(SIZE);
+ offset = 0;
+ }
+ var buf = slice.call(slab, offset, offset += size);
+ if (offset & 7) // align to 32 bit
+ offset = (offset | 7) + 1;
+ return buf;
+ };
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/@protobufjs/utf8/index.js":
+/*!************************************************!*\
+ !*** ./node_modules/@protobufjs/utf8/index.js ***!
+ \************************************************/
+/***/ ((__unused_webpack_module, exports) => {
+
+"use strict";
+
+
+/**
+ * A minimal UTF8 implementation for number arrays.
+ * @memberof util
+ * @namespace
+ */
+var utf8 = exports;
+
+/**
+ * Calculates the UTF8 byte length of a string.
+ * @param {string} string String
+ * @returns {number} Byte length
+ */
+utf8.length = function utf8_length(string) {
+ var len = 0,
+ c = 0;
+ for (var i = 0; i < string.length; ++i) {
+ c = string.charCodeAt(i);
+ if (c < 128)
+ len += 1;
+ else if (c < 2048)
+ len += 2;
+ else if ((c & 0xFC00) === 0xD800 && (string.charCodeAt(i + 1) & 0xFC00) === 0xDC00) {
+ ++i;
+ len += 4;
+ } else
+ len += 3;
+ }
+ return len;
+};
+
+/**
+ * Reads UTF8 bytes as a string.
+ * @param {Uint8Array} buffer Source buffer
+ * @param {number} start Source start
+ * @param {number} end Source end
+ * @returns {string} String read
+ */
+utf8.read = function utf8_read(buffer, start, end) {
+ var len = end - start;
+ if (len < 1)
+ return "";
+ var parts = null,
+ chunk = [],
+ i = 0, // char offset
+ t; // temporary
+ while (start < end) {
+ t = buffer[start++];
+ if (t < 128)
+ chunk[i++] = t;
+ else if (t > 191 && t < 224)
+ chunk[i++] = (t & 31) << 6 | buffer[start++] & 63;
+ else if (t > 239 && t < 365) {
+ t = ((t & 7) << 18 | (buffer[start++] & 63) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63) - 0x10000;
+ chunk[i++] = 0xD800 + (t >> 10);
+ chunk[i++] = 0xDC00 + (t & 1023);
+ } else
+ chunk[i++] = (t & 15) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63;
+ if (i > 8191) {
+ (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));
+ i = 0;
+ }
+ }
+ if (parts) {
+ if (i)
+ parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));
+ return parts.join("");
+ }
+ return String.fromCharCode.apply(String, chunk.slice(0, i));
+};
+
+/**
+ * Writes a string as UTF8 bytes.
+ * @param {string} string Source string
+ * @param {Uint8Array} buffer Destination buffer
+ * @param {number} offset Destination offset
+ * @returns {number} Bytes written
+ */
+utf8.write = function utf8_write(string, buffer, offset) {
+ var start = offset,
+ c1, // character 1
+ c2; // character 2
+ for (var i = 0; i < string.length; ++i) {
+ c1 = string.charCodeAt(i);
+ if (c1 < 128) {
+ buffer[offset++] = c1;
+ } else if (c1 < 2048) {
+ buffer[offset++] = c1 >> 6 | 192;
+ buffer[offset++] = c1 & 63 | 128;
+ } else if ((c1 & 0xFC00) === 0xD800 && ((c2 = string.charCodeAt(i + 1)) & 0xFC00) === 0xDC00) {
+ c1 = 0x10000 + ((c1 & 0x03FF) << 10) + (c2 & 0x03FF);
+ ++i;
+ buffer[offset++] = c1 >> 18 | 240;
+ buffer[offset++] = c1 >> 12 & 63 | 128;
+ buffer[offset++] = c1 >> 6 & 63 | 128;
+ buffer[offset++] = c1 & 63 | 128;
+ } else {
+ buffer[offset++] = c1 >> 12 | 224;
+ buffer[offset++] = c1 >> 6 & 63 | 128;
+ buffer[offset++] = c1 & 63 | 128;
+ }
+ }
+ return offset - start;
+};
+
+
+/***/ }),
+
+/***/ "./node_modules/guid-typescript/dist/guid.js":
+/*!***************************************************!*\
+ !*** ./node_modules/guid-typescript/dist/guid.js ***!
+ \***************************************************/
+/***/ ((__unused_webpack_module, exports) => {
+
+"use strict";
+
+exports.__esModule = true;
+var Guid = /** @class */ (function () {
+ function Guid(guid) {
+ if (!guid) {
+ throw new TypeError("Invalid argument; `value` has no value.");
+ }
+ this.value = Guid.EMPTY;
+ if (guid && Guid.isGuid(guid)) {
+ this.value = guid;
+ }
+ }
+ Guid.isGuid = function (guid) {
+ var value = guid.toString();
+ return guid && (guid instanceof Guid || Guid.validator.test(value));
+ };
+ Guid.create = function () {
+ return new Guid([Guid.gen(2), Guid.gen(1), Guid.gen(1), Guid.gen(1), Guid.gen(3)].join("-"));
+ };
+ Guid.createEmpty = function () {
+ return new Guid("emptyguid");
+ };
+ Guid.parse = function (guid) {
+ return new Guid(guid);
+ };
+ Guid.raw = function () {
+ return [Guid.gen(2), Guid.gen(1), Guid.gen(1), Guid.gen(1), Guid.gen(3)].join("-");
+ };
+ Guid.gen = function (count) {
+ var out = "";
+ for (var i = 0; i < count; i++) {
+ // tslint:disable-next-line:no-bitwise
+ out += (((1 + Math.random()) * 0x10000) | 0).toString(16).substring(1);
+ }
+ return out;
+ };
+ Guid.prototype.equals = function (other) {
+ // Comparing string `value` against provided `guid` will auto-call
+ // toString on `guid` for comparison
+ return Guid.isGuid(other) && this.value === other.toString();
+ };
+ Guid.prototype.isEmpty = function () {
+ return this.value === Guid.EMPTY;
+ };
+ Guid.prototype.toString = function () {
+ return this.value;
+ };
+ Guid.prototype.toJSON = function () {
+ return {
+ value: this.value
+ };
+ };
+ Guid.validator = new RegExp("^[a-z0-9]{8}-[a-z0-9]{4}-[a-z0-9]{4}-[a-z0-9]{4}-[a-z0-9]{12}$", "i");
+ Guid.EMPTY = "00000000-0000-0000-0000-000000000000";
+ return Guid;
+}());
+exports.Guid = Guid;
+
+
+/***/ }),
+
+/***/ "./node_modules/long/src/long.js":
+/*!***************************************!*\
+ !*** ./node_modules/long/src/long.js ***!
+ \***************************************/
+/***/ ((module) => {
+
+module.exports = Long;
+
+/**
+ * wasm optimizations, to do native i64 multiplication and divide
+ */
+var wasm = null;
+
+try {
+ wasm = new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([
+ 0, 97, 115, 109, 1, 0, 0, 0, 1, 13, 2, 96, 0, 1, 127, 96, 4, 127, 127, 127, 127, 1, 127, 3, 7, 6, 0, 1, 1, 1, 1, 1, 6, 6, 1, 127, 1, 65, 0, 11, 7, 50, 6, 3, 109, 117, 108, 0, 1, 5, 100, 105, 118, 95, 115, 0, 2, 5, 100, 105, 118, 95, 117, 0, 3, 5, 114, 101, 109, 95, 115, 0, 4, 5, 114, 101, 109, 95, 117, 0, 5, 8, 103, 101, 116, 95, 104, 105, 103, 104, 0, 0, 10, 191, 1, 6, 4, 0, 35, 0, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 126, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 127, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 128, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 129, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 130, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11
+ ])), {}).exports;
+} catch (e) {
+ // no wasm support :(
+}
+
+/**
+ * Constructs a 64 bit two's-complement integer, given its low and high 32 bit values as *signed* integers.
+ * See the from* functions below for more convenient ways of constructing Longs.
+ * @exports Long
+ * @class A Long class for representing a 64 bit two's-complement integer value.
+ * @param {number} low The low (signed) 32 bits of the long
+ * @param {number} high The high (signed) 32 bits of the long
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @constructor
+ */
+function Long(low, high, unsigned) {
+
+ /**
+ * The low 32 bits as a signed value.
+ * @type {number}
+ */
+ this.low = low | 0;
+
+ /**
+ * The high 32 bits as a signed value.
+ * @type {number}
+ */
+ this.high = high | 0;
+
+ /**
+ * Whether unsigned or not.
+ * @type {boolean}
+ */
+ this.unsigned = !!unsigned;
+}
+
+// The internal representation of a long is the two given signed, 32-bit values.
+// We use 32-bit pieces because these are the size of integers on which
+// Javascript performs bit-operations. For operations like addition and
+// multiplication, we split each number into 16 bit pieces, which can easily be
+// multiplied within Javascript's floating-point representation without overflow
+// or change in sign.
+//
+// In the algorithms below, we frequently reduce the negative case to the
+// positive case by negating the input(s) and then post-processing the result.
+// Note that we must ALWAYS check specially whether those values are MIN_VALUE
+// (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as
+// a positive number, it overflows back into a negative). Not handling this
+// case would often result in infinite recursion.
+//
+// Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the from*
+// methods on which they depend.
+
+/**
+ * An indicator used to reliably determine if an object is a Long or not.
+ * @type {boolean}
+ * @const
+ * @private
+ */
+Long.prototype.__isLong__;
+
+Object.defineProperty(Long.prototype, "__isLong__", { value: true });
+
+/**
+ * @function
+ * @param {*} obj Object
+ * @returns {boolean}
+ * @inner
+ */
+function isLong(obj) {
+ return (obj && obj["__isLong__"]) === true;
+}
+
+/**
+ * Tests if the specified object is a Long.
+ * @function
+ * @param {*} obj Object
+ * @returns {boolean}
+ */
+Long.isLong = isLong;
+
+/**
+ * A cache of the Long representations of small integer values.
+ * @type {!Object}
+ * @inner
+ */
+var INT_CACHE = {};
+
+/**
+ * A cache of the Long representations of small unsigned integer values.
+ * @type {!Object}
+ * @inner
+ */
+var UINT_CACHE = {};
+
+/**
+ * @param {number} value
+ * @param {boolean=} unsigned
+ * @returns {!Long}
+ * @inner
+ */
+function fromInt(value, unsigned) {
+ var obj, cachedObj, cache;
+ if (unsigned) {
+ value >>>= 0;
+ if (cache = (0 <= value && value < 256)) {
+ cachedObj = UINT_CACHE[value];
+ if (cachedObj)
+ return cachedObj;
+ }
+ obj = fromBits(value, (value | 0) < 0 ? -1 : 0, true);
+ if (cache)
+ UINT_CACHE[value] = obj;
+ return obj;
+ } else {
+ value |= 0;
+ if (cache = (-128 <= value && value < 128)) {
+ cachedObj = INT_CACHE[value];
+ if (cachedObj)
+ return cachedObj;
+ }
+ obj = fromBits(value, value < 0 ? -1 : 0, false);
+ if (cache)
+ INT_CACHE[value] = obj;
+ return obj;
+ }
+}
+
+/**
+ * Returns a Long representing the given 32 bit integer value.
+ * @function
+ * @param {number} value The 32 bit integer in question
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @returns {!Long} The corresponding Long value
+ */
+Long.fromInt = fromInt;
+
+/**
+ * @param {number} value
+ * @param {boolean=} unsigned
+ * @returns {!Long}
+ * @inner
+ */
+function fromNumber(value, unsigned) {
+ if (isNaN(value))
+ return unsigned ? UZERO : ZERO;
+ if (unsigned) {
+ if (value < 0)
+ return UZERO;
+ if (value >= TWO_PWR_64_DBL)
+ return MAX_UNSIGNED_VALUE;
+ } else {
+ if (value <= -TWO_PWR_63_DBL)
+ return MIN_VALUE;
+ if (value + 1 >= TWO_PWR_63_DBL)
+ return MAX_VALUE;
+ }
+ if (value < 0)
+ return fromNumber(-value, unsigned).neg();
+ return fromBits((value % TWO_PWR_32_DBL) | 0, (value / TWO_PWR_32_DBL) | 0, unsigned);
+}
+
+/**
+ * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.
+ * @function
+ * @param {number} value The number in question
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @returns {!Long} The corresponding Long value
+ */
+Long.fromNumber = fromNumber;
+
+/**
+ * @param {number} lowBits
+ * @param {number} highBits
+ * @param {boolean=} unsigned
+ * @returns {!Long}
+ * @inner
+ */
+function fromBits(lowBits, highBits, unsigned) {
+ return new Long(lowBits, highBits, unsigned);
+}
+
+/**
+ * Returns a Long representing the 64 bit integer that comes by concatenating the given low and high bits. Each is
+ * assumed to use 32 bits.
+ * @function
+ * @param {number} lowBits The low 32 bits
+ * @param {number} highBits The high 32 bits
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @returns {!Long} The corresponding Long value
+ */
+Long.fromBits = fromBits;
+
+/**
+ * @function
+ * @param {number} base
+ * @param {number} exponent
+ * @returns {number}
+ * @inner
+ */
+var pow_dbl = Math.pow; // Used 4 times (4*8 to 15+4)
+
+/**
+ * @param {string} str
+ * @param {(boolean|number)=} unsigned
+ * @param {number=} radix
+ * @returns {!Long}
+ * @inner
+ */
+function fromString(str, unsigned, radix) {
+ if (str.length === 0)
+ throw Error('empty string');
+ if (str === "NaN" || str === "Infinity" || str === "+Infinity" || str === "-Infinity")
+ return ZERO;
+ if (typeof unsigned === 'number') {
+ // For goog.math.long compatibility
+ radix = unsigned,
+ unsigned = false;
+ } else {
+ unsigned = !! unsigned;
+ }
+ radix = radix || 10;
+ if (radix < 2 || 36 < radix)
+ throw RangeError('radix');
+
+ var p;
+ if ((p = str.indexOf('-')) > 0)
+ throw Error('interior hyphen');
+ else if (p === 0) {
+ return fromString(str.substring(1), unsigned, radix).neg();
+ }
+
+ // Do several (8) digits each time through the loop, so as to
+ // minimize the calls to the very expensive emulated div.
+ var radixToPower = fromNumber(pow_dbl(radix, 8));
+
+ var result = ZERO;
+ for (var i = 0; i < str.length; i += 8) {
+ var size = Math.min(8, str.length - i),
+ value = parseInt(str.substring(i, i + size), radix);
+ if (size < 8) {
+ var power = fromNumber(pow_dbl(radix, size));
+ result = result.mul(power).add(fromNumber(value));
+ } else {
+ result = result.mul(radixToPower);
+ result = result.add(fromNumber(value));
+ }
+ }
+ result.unsigned = unsigned;
+ return result;
+}
+
+/**
+ * Returns a Long representation of the given string, written using the specified radix.
+ * @function
+ * @param {string} str The textual representation of the Long
+ * @param {(boolean|number)=} unsigned Whether unsigned or not, defaults to signed
+ * @param {number=} radix The radix in which the text is written (2-36), defaults to 10
+ * @returns {!Long} The corresponding Long value
+ */
+Long.fromString = fromString;
+
+/**
+ * @function
+ * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val
+ * @param {boolean=} unsigned
+ * @returns {!Long}
+ * @inner
+ */
+function fromValue(val, unsigned) {
+ if (typeof val === 'number')
+ return fromNumber(val, unsigned);
+ if (typeof val === 'string')
+ return fromString(val, unsigned);
+ // Throws for non-objects, converts non-instanceof Long:
+ return fromBits(val.low, val.high, typeof unsigned === 'boolean' ? unsigned : val.unsigned);
+}
+
+/**
+ * Converts the specified value to a Long using the appropriate from* function for its type.
+ * @function
+ * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val Value
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @returns {!Long}
+ */
+Long.fromValue = fromValue;
+
+// NOTE: the compiler should inline these constant values below and then remove these variables, so there should be
+// no runtime penalty for these.
+
+/**
+ * @type {number}
+ * @const
+ * @inner
+ */
+var TWO_PWR_16_DBL = 1 << 16;
+
+/**
+ * @type {number}
+ * @const
+ * @inner
+ */
+var TWO_PWR_24_DBL = 1 << 24;
+
+/**
+ * @type {number}
+ * @const
+ * @inner
+ */
+var TWO_PWR_32_DBL = TWO_PWR_16_DBL * TWO_PWR_16_DBL;
+
+/**
+ * @type {number}
+ * @const
+ * @inner
+ */
+var TWO_PWR_64_DBL = TWO_PWR_32_DBL * TWO_PWR_32_DBL;
+
+/**
+ * @type {number}
+ * @const
+ * @inner
+ */
+var TWO_PWR_63_DBL = TWO_PWR_64_DBL / 2;
+
+/**
+ * @type {!Long}
+ * @const
+ * @inner
+ */
+var TWO_PWR_24 = fromInt(TWO_PWR_24_DBL);
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var ZERO = fromInt(0);
+
+/**
+ * Signed zero.
+ * @type {!Long}
+ */
+Long.ZERO = ZERO;
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var UZERO = fromInt(0, true);
+
+/**
+ * Unsigned zero.
+ * @type {!Long}
+ */
+Long.UZERO = UZERO;
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var ONE = fromInt(1);
+
+/**
+ * Signed one.
+ * @type {!Long}
+ */
+Long.ONE = ONE;
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var UONE = fromInt(1, true);
+
+/**
+ * Unsigned one.
+ * @type {!Long}
+ */
+Long.UONE = UONE;
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var NEG_ONE = fromInt(-1);
+
+/**
+ * Signed negative one.
+ * @type {!Long}
+ */
+Long.NEG_ONE = NEG_ONE;
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var MAX_VALUE = fromBits(0xFFFFFFFF|0, 0x7FFFFFFF|0, false);
+
+/**
+ * Maximum signed value.
+ * @type {!Long}
+ */
+Long.MAX_VALUE = MAX_VALUE;
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var MAX_UNSIGNED_VALUE = fromBits(0xFFFFFFFF|0, 0xFFFFFFFF|0, true);
+
+/**
+ * Maximum unsigned value.
+ * @type {!Long}
+ */
+Long.MAX_UNSIGNED_VALUE = MAX_UNSIGNED_VALUE;
+
+/**
+ * @type {!Long}
+ * @inner
+ */
+var MIN_VALUE = fromBits(0, 0x80000000|0, false);
+
+/**
+ * Minimum signed value.
+ * @type {!Long}
+ */
+Long.MIN_VALUE = MIN_VALUE;
+
+/**
+ * @alias Long.prototype
+ * @inner
+ */
+var LongPrototype = Long.prototype;
+
+/**
+ * Converts the Long to a 32 bit integer, assuming it is a 32 bit integer.
+ * @returns {number}
+ */
+LongPrototype.toInt = function toInt() {
+ return this.unsigned ? this.low >>> 0 : this.low;
+};
+
+/**
+ * Converts the Long to a the nearest floating-point representation of this value (double, 53 bit mantissa).
+ * @returns {number}
+ */
+LongPrototype.toNumber = function toNumber() {
+ if (this.unsigned)
+ return ((this.high >>> 0) * TWO_PWR_32_DBL) + (this.low >>> 0);
+ return this.high * TWO_PWR_32_DBL + (this.low >>> 0);
+};
+
+/**
+ * Converts the Long to a string written in the specified radix.
+ * @param {number=} radix Radix (2-36), defaults to 10
+ * @returns {string}
+ * @override
+ * @throws {RangeError} If `radix` is out of range
+ */
+LongPrototype.toString = function toString(radix) {
+ radix = radix || 10;
+ if (radix < 2 || 36 < radix)
+ throw RangeError('radix');
+ if (this.isZero())
+ return '0';
+ if (this.isNegative()) { // Unsigned Longs are never negative
+ if (this.eq(MIN_VALUE)) {
+ // We need to change the Long value before it can be negated, so we remove
+ // the bottom-most digit in this base and then recurse to do the rest.
+ var radixLong = fromNumber(radix),
+ div = this.div(radixLong),
+ rem1 = div.mul(radixLong).sub(this);
+ return div.toString(radix) + rem1.toInt().toString(radix);
+ } else
+ return '-' + this.neg().toString(radix);
+ }
+
+ // Do several (6) digits each time through the loop, so as to
+ // minimize the calls to the very expensive emulated div.
+ var radixToPower = fromNumber(pow_dbl(radix, 6), this.unsigned),
+ rem = this;
+ var result = '';
+ while (true) {
+ var remDiv = rem.div(radixToPower),
+ intval = rem.sub(remDiv.mul(radixToPower)).toInt() >>> 0,
+ digits = intval.toString(radix);
+ rem = remDiv;
+ if (rem.isZero())
+ return digits + result;
+ else {
+ while (digits.length < 6)
+ digits = '0' + digits;
+ result = '' + digits + result;
+ }
+ }
+};
+
+/**
+ * Gets the high 32 bits as a signed integer.
+ * @returns {number} Signed high bits
+ */
+LongPrototype.getHighBits = function getHighBits() {
+ return this.high;
+};
+
+/**
+ * Gets the high 32 bits as an unsigned integer.
+ * @returns {number} Unsigned high bits
+ */
+LongPrototype.getHighBitsUnsigned = function getHighBitsUnsigned() {
+ return this.high >>> 0;
+};
+
+/**
+ * Gets the low 32 bits as a signed integer.
+ * @returns {number} Signed low bits
+ */
+LongPrototype.getLowBits = function getLowBits() {
+ return this.low;
+};
+
+/**
+ * Gets the low 32 bits as an unsigned integer.
+ * @returns {number} Unsigned low bits
+ */
+LongPrototype.getLowBitsUnsigned = function getLowBitsUnsigned() {
+ return this.low >>> 0;
+};
+
+/**
+ * Gets the number of bits needed to represent the absolute value of this Long.
+ * @returns {number}
+ */
+LongPrototype.getNumBitsAbs = function getNumBitsAbs() {
+ if (this.isNegative()) // Unsigned Longs are never negative
+ return this.eq(MIN_VALUE) ? 64 : this.neg().getNumBitsAbs();
+ var val = this.high != 0 ? this.high : this.low;
+ for (var bit = 31; bit > 0; bit--)
+ if ((val & (1 << bit)) != 0)
+ break;
+ return this.high != 0 ? bit + 33 : bit + 1;
+};
+
+/**
+ * Tests if this Long's value equals zero.
+ * @returns {boolean}
+ */
+LongPrototype.isZero = function isZero() {
+ return this.high === 0 && this.low === 0;
+};
+
+/**
+ * Tests if this Long's value equals zero. This is an alias of {@link Long#isZero}.
+ * @returns {boolean}
+ */
+LongPrototype.eqz = LongPrototype.isZero;
+
+/**
+ * Tests if this Long's value is negative.
+ * @returns {boolean}
+ */
+LongPrototype.isNegative = function isNegative() {
+ return !this.unsigned && this.high < 0;
+};
+
+/**
+ * Tests if this Long's value is positive.
+ * @returns {boolean}
+ */
+LongPrototype.isPositive = function isPositive() {
+ return this.unsigned || this.high >= 0;
+};
+
+/**
+ * Tests if this Long's value is odd.
+ * @returns {boolean}
+ */
+LongPrototype.isOdd = function isOdd() {
+ return (this.low & 1) === 1;
+};
+
+/**
+ * Tests if this Long's value is even.
+ * @returns {boolean}
+ */
+LongPrototype.isEven = function isEven() {
+ return (this.low & 1) === 0;
+};
+
+/**
+ * Tests if this Long's value equals the specified's.
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.equals = function equals(other) {
+ if (!isLong(other))
+ other = fromValue(other);
+ if (this.unsigned !== other.unsigned && (this.high >>> 31) === 1 && (other.high >>> 31) === 1)
+ return false;
+ return this.high === other.high && this.low === other.low;
+};
+
+/**
+ * Tests if this Long's value equals the specified's. This is an alias of {@link Long#equals}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.eq = LongPrototype.equals;
+
+/**
+ * Tests if this Long's value differs from the specified's.
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.notEquals = function notEquals(other) {
+ return !this.eq(/* validates */ other);
+};
+
+/**
+ * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.neq = LongPrototype.notEquals;
+
+/**
+ * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.ne = LongPrototype.notEquals;
+
+/**
+ * Tests if this Long's value is less than the specified's.
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.lessThan = function lessThan(other) {
+ return this.comp(/* validates */ other) < 0;
+};
+
+/**
+ * Tests if this Long's value is less than the specified's. This is an alias of {@link Long#lessThan}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.lt = LongPrototype.lessThan;
+
+/**
+ * Tests if this Long's value is less than or equal the specified's.
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.lessThanOrEqual = function lessThanOrEqual(other) {
+ return this.comp(/* validates */ other) <= 0;
+};
+
+/**
+ * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.lte = LongPrototype.lessThanOrEqual;
+
+/**
+ * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.le = LongPrototype.lessThanOrEqual;
+
+/**
+ * Tests if this Long's value is greater than the specified's.
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.greaterThan = function greaterThan(other) {
+ return this.comp(/* validates */ other) > 0;
+};
+
+/**
+ * Tests if this Long's value is greater than the specified's. This is an alias of {@link Long#greaterThan}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.gt = LongPrototype.greaterThan;
+
+/**
+ * Tests if this Long's value is greater than or equal the specified's.
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.greaterThanOrEqual = function greaterThanOrEqual(other) {
+ return this.comp(/* validates */ other) >= 0;
+};
+
+/**
+ * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.gte = LongPrototype.greaterThanOrEqual;
+
+/**
+ * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {boolean}
+ */
+LongPrototype.ge = LongPrototype.greaterThanOrEqual;
+
+/**
+ * Compares this Long's value with the specified's.
+ * @param {!Long|number|string} other Other value
+ * @returns {number} 0 if they are the same, 1 if the this is greater and -1
+ * if the given one is greater
+ */
+LongPrototype.compare = function compare(other) {
+ if (!isLong(other))
+ other = fromValue(other);
+ if (this.eq(other))
+ return 0;
+ var thisNeg = this.isNegative(),
+ otherNeg = other.isNegative();
+ if (thisNeg && !otherNeg)
+ return -1;
+ if (!thisNeg && otherNeg)
+ return 1;
+ // At this point the sign bits are the same
+ if (!this.unsigned)
+ return this.sub(other).isNegative() ? -1 : 1;
+ // Both are positive if at least one is unsigned
+ return (other.high >>> 0) > (this.high >>> 0) || (other.high === this.high && (other.low >>> 0) > (this.low >>> 0)) ? -1 : 1;
+};
+
+/**
+ * Compares this Long's value with the specified's. This is an alias of {@link Long#compare}.
+ * @function
+ * @param {!Long|number|string} other Other value
+ * @returns {number} 0 if they are the same, 1 if the this is greater and -1
+ * if the given one is greater
+ */
+LongPrototype.comp = LongPrototype.compare;
+
+/**
+ * Negates this Long's value.
+ * @returns {!Long} Negated Long
+ */
+LongPrototype.negate = function negate() {
+ if (!this.unsigned && this.eq(MIN_VALUE))
+ return MIN_VALUE;
+ return this.not().add(ONE);
+};
+
+/**
+ * Negates this Long's value. This is an alias of {@link Long#negate}.
+ * @function
+ * @returns {!Long} Negated Long
+ */
+LongPrototype.neg = LongPrototype.negate;
+
+/**
+ * Returns the sum of this and the specified Long.
+ * @param {!Long|number|string} addend Addend
+ * @returns {!Long} Sum
+ */
+LongPrototype.add = function add(addend) {
+ if (!isLong(addend))
+ addend = fromValue(addend);
+
+ // Divide each number into 4 chunks of 16 bits, and then sum the chunks.
+
+ var a48 = this.high >>> 16;
+ var a32 = this.high & 0xFFFF;
+ var a16 = this.low >>> 16;
+ var a00 = this.low & 0xFFFF;
+
+ var b48 = addend.high >>> 16;
+ var b32 = addend.high & 0xFFFF;
+ var b16 = addend.low >>> 16;
+ var b00 = addend.low & 0xFFFF;
+
+ var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+ c00 += a00 + b00;
+ c16 += c00 >>> 16;
+ c00 &= 0xFFFF;
+ c16 += a16 + b16;
+ c32 += c16 >>> 16;
+ c16 &= 0xFFFF;
+ c32 += a32 + b32;
+ c48 += c32 >>> 16;
+ c32 &= 0xFFFF;
+ c48 += a48 + b48;
+ c48 &= 0xFFFF;
+ return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);
+};
+
+/**
+ * Returns the difference of this and the specified Long.
+ * @param {!Long|number|string} subtrahend Subtrahend
+ * @returns {!Long} Difference
+ */
+LongPrototype.subtract = function subtract(subtrahend) {
+ if (!isLong(subtrahend))
+ subtrahend = fromValue(subtrahend);
+ return this.add(subtrahend.neg());
+};
+
+/**
+ * Returns the difference of this and the specified Long. This is an alias of {@link Long#subtract}.
+ * @function
+ * @param {!Long|number|string} subtrahend Subtrahend
+ * @returns {!Long} Difference
+ */
+LongPrototype.sub = LongPrototype.subtract;
+
+/**
+ * Returns the product of this and the specified Long.
+ * @param {!Long|number|string} multiplier Multiplier
+ * @returns {!Long} Product
+ */
+LongPrototype.multiply = function multiply(multiplier) {
+ if (this.isZero())
+ return ZERO;
+ if (!isLong(multiplier))
+ multiplier = fromValue(multiplier);
+
+ // use wasm support if present
+ if (wasm) {
+ var low = wasm.mul(this.low,
+ this.high,
+ multiplier.low,
+ multiplier.high);
+ return fromBits(low, wasm.get_high(), this.unsigned);
+ }
+
+ if (multiplier.isZero())
+ return ZERO;
+ if (this.eq(MIN_VALUE))
+ return multiplier.isOdd() ? MIN_VALUE : ZERO;
+ if (multiplier.eq(MIN_VALUE))
+ return this.isOdd() ? MIN_VALUE : ZERO;
+
+ if (this.isNegative()) {
+ if (multiplier.isNegative())
+ return this.neg().mul(multiplier.neg());
+ else
+ return this.neg().mul(multiplier).neg();
+ } else if (multiplier.isNegative())
+ return this.mul(multiplier.neg()).neg();
+
+ // If both longs are small, use float multiplication
+ if (this.lt(TWO_PWR_24) && multiplier.lt(TWO_PWR_24))
+ return fromNumber(this.toNumber() * multiplier.toNumber(), this.unsigned);
+
+ // Divide each long into 4 chunks of 16 bits, and then add up 4x4 products.
+ // We can skip products that would overflow.
+
+ var a48 = this.high >>> 16;
+ var a32 = this.high & 0xFFFF;
+ var a16 = this.low >>> 16;
+ var a00 = this.low & 0xFFFF;
+
+ var b48 = multiplier.high >>> 16;
+ var b32 = multiplier.high & 0xFFFF;
+ var b16 = multiplier.low >>> 16;
+ var b00 = multiplier.low & 0xFFFF;
+
+ var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+ c00 += a00 * b00;
+ c16 += c00 >>> 16;
+ c00 &= 0xFFFF;
+ c16 += a16 * b00;
+ c32 += c16 >>> 16;
+ c16 &= 0xFFFF;
+ c16 += a00 * b16;
+ c32 += c16 >>> 16;
+ c16 &= 0xFFFF;
+ c32 += a32 * b00;
+ c48 += c32 >>> 16;
+ c32 &= 0xFFFF;
+ c32 += a16 * b16;
+ c48 += c32 >>> 16;
+ c32 &= 0xFFFF;
+ c32 += a00 * b32;
+ c48 += c32 >>> 16;
+ c32 &= 0xFFFF;
+ c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;
+ c48 &= 0xFFFF;
+ return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);
+};
+
+/**
+ * Returns the product of this and the specified Long. This is an alias of {@link Long#multiply}.
+ * @function
+ * @param {!Long|number|string} multiplier Multiplier
+ * @returns {!Long} Product
+ */
+LongPrototype.mul = LongPrototype.multiply;
+
+/**
+ * Returns this Long divided by the specified. The result is signed if this Long is signed or
+ * unsigned if this Long is unsigned.
+ * @param {!Long|number|string} divisor Divisor
+ * @returns {!Long} Quotient
+ */
+LongPrototype.divide = function divide(divisor) {
+ if (!isLong(divisor))
+ divisor = fromValue(divisor);
+ if (divisor.isZero())
+ throw Error('division by zero');
+
+ // use wasm support if present
+ if (wasm) {
+ // guard against signed division overflow: the largest
+ // negative number / -1 would be 1 larger than the largest
+ // positive number, due to two's complement.
+ if (!this.unsigned &&
+ this.high === -0x80000000 &&
+ divisor.low === -1 && divisor.high === -1) {
+ // be consistent with non-wasm code path
+ return this;
+ }
+ var low = (this.unsigned ? wasm.div_u : wasm.div_s)(
+ this.low,
+ this.high,
+ divisor.low,
+ divisor.high
+ );
+ return fromBits(low, wasm.get_high(), this.unsigned);
+ }
+
+ if (this.isZero())
+ return this.unsigned ? UZERO : ZERO;
+ var approx, rem, res;
+ if (!this.unsigned) {
+ // This section is only relevant for signed longs and is derived from the
+ // closure library as a whole.
+ if (this.eq(MIN_VALUE)) {
+ if (divisor.eq(ONE) || divisor.eq(NEG_ONE))
+ return MIN_VALUE; // recall that -MIN_VALUE == MIN_VALUE
+ else if (divisor.eq(MIN_VALUE))
+ return ONE;
+ else {
+ // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.
+ var halfThis = this.shr(1);
+ approx = halfThis.div(divisor).shl(1);
+ if (approx.eq(ZERO)) {
+ return divisor.isNegative() ? ONE : NEG_ONE;
+ } else {
+ rem = this.sub(divisor.mul(approx));
+ res = approx.add(rem.div(divisor));
+ return res;
+ }
+ }
+ } else if (divisor.eq(MIN_VALUE))
+ return this.unsigned ? UZERO : ZERO;
+ if (this.isNegative()) {
+ if (divisor.isNegative())
+ return this.neg().div(divisor.neg());
+ return this.neg().div(divisor).neg();
+ } else if (divisor.isNegative())
+ return this.div(divisor.neg()).neg();
+ res = ZERO;
+ } else {
+ // The algorithm below has not been made for unsigned longs. It's therefore
+ // required to take special care of the MSB prior to running it.
+ if (!divisor.unsigned)
+ divisor = divisor.toUnsigned();
+ if (divisor.gt(this))
+ return UZERO;
+ if (divisor.gt(this.shru(1))) // 15 >>> 1 = 7 ; with divisor = 8 ; true
+ return UONE;
+ res = UZERO;
+ }
+
+ // Repeat the following until the remainder is less than other: find a
+ // floating-point that approximates remainder / other *from below*, add this
+ // into the result, and subtract it from the remainder. It is critical that
+ // the approximate value is less than or equal to the real value so that the
+ // remainder never becomes negative.
+ rem = this;
+ while (rem.gte(divisor)) {
+ // Approximate the result of division. This may be a little greater or
+ // smaller than the actual value.
+ approx = Math.max(1, Math.floor(rem.toNumber() / divisor.toNumber()));
+
+ // We will tweak the approximate result by changing it in the 48-th digit or
+ // the smallest non-fractional digit, whichever is larger.
+ var log2 = Math.ceil(Math.log(approx) / Math.LN2),
+ delta = (log2 <= 48) ? 1 : pow_dbl(2, log2 - 48),
+
+ // Decrease the approximation until it is smaller than the remainder. Note
+ // that if it is too large, the product overflows and is negative.
+ approxRes = fromNumber(approx),
+ approxRem = approxRes.mul(divisor);
+ while (approxRem.isNegative() || approxRem.gt(rem)) {
+ approx -= delta;
+ approxRes = fromNumber(approx, this.unsigned);
+ approxRem = approxRes.mul(divisor);
+ }
+
+ // We know the answer can't be zero... and actually, zero would cause
+ // infinite recursion since we would make no progress.
+ if (approxRes.isZero())
+ approxRes = ONE;
+
+ res = res.add(approxRes);
+ rem = rem.sub(approxRem);
+ }
+ return res;
+};
+
+/**
+ * Returns this Long divided by the specified. This is an alias of {@link Long#divide}.
+ * @function
+ * @param {!Long|number|string} divisor Divisor
+ * @returns {!Long} Quotient
+ */
+LongPrototype.div = LongPrototype.divide;
+
+/**
+ * Returns this Long modulo the specified.
+ * @param {!Long|number|string} divisor Divisor
+ * @returns {!Long} Remainder
+ */
+LongPrototype.modulo = function modulo(divisor) {
+ if (!isLong(divisor))
+ divisor = fromValue(divisor);
+
+ // use wasm support if present
+ if (wasm) {
+ var low = (this.unsigned ? wasm.rem_u : wasm.rem_s)(
+ this.low,
+ this.high,
+ divisor.low,
+ divisor.high
+ );
+ return fromBits(low, wasm.get_high(), this.unsigned);
+ }
+
+ return this.sub(this.div(divisor).mul(divisor));
+};
+
+/**
+ * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.
+ * @function
+ * @param {!Long|number|string} divisor Divisor
+ * @returns {!Long} Remainder
+ */
+LongPrototype.mod = LongPrototype.modulo;
+
+/**
+ * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.
+ * @function
+ * @param {!Long|number|string} divisor Divisor
+ * @returns {!Long} Remainder
+ */
+LongPrototype.rem = LongPrototype.modulo;
+
+/**
+ * Returns the bitwise NOT of this Long.
+ * @returns {!Long}
+ */
+LongPrototype.not = function not() {
+ return fromBits(~this.low, ~this.high, this.unsigned);
+};
+
+/**
+ * Returns the bitwise AND of this Long and the specified.
+ * @param {!Long|number|string} other Other Long
+ * @returns {!Long}
+ */
+LongPrototype.and = function and(other) {
+ if (!isLong(other))
+ other = fromValue(other);
+ return fromBits(this.low & other.low, this.high & other.high, this.unsigned);
+};
+
+/**
+ * Returns the bitwise OR of this Long and the specified.
+ * @param {!Long|number|string} other Other Long
+ * @returns {!Long}
+ */
+LongPrototype.or = function or(other) {
+ if (!isLong(other))
+ other = fromValue(other);
+ return fromBits(this.low | other.low, this.high | other.high, this.unsigned);
+};
+
+/**
+ * Returns the bitwise XOR of this Long and the given one.
+ * @param {!Long|number|string} other Other Long
+ * @returns {!Long}
+ */
+LongPrototype.xor = function xor(other) {
+ if (!isLong(other))
+ other = fromValue(other);
+ return fromBits(this.low ^ other.low, this.high ^ other.high, this.unsigned);
+};
+
+/**
+ * Returns this Long with bits shifted to the left by the given amount.
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Shifted Long
+ */
+LongPrototype.shiftLeft = function shiftLeft(numBits) {
+ if (isLong(numBits))
+ numBits = numBits.toInt();
+ if ((numBits &= 63) === 0)
+ return this;
+ else if (numBits < 32)
+ return fromBits(this.low << numBits, (this.high << numBits) | (this.low >>> (32 - numBits)), this.unsigned);
+ else
+ return fromBits(0, this.low << (numBits - 32), this.unsigned);
+};
+
+/**
+ * Returns this Long with bits shifted to the left by the given amount. This is an alias of {@link Long#shiftLeft}.
+ * @function
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Shifted Long
+ */
+LongPrototype.shl = LongPrototype.shiftLeft;
+
+/**
+ * Returns this Long with bits arithmetically shifted to the right by the given amount.
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Shifted Long
+ */
+LongPrototype.shiftRight = function shiftRight(numBits) {
+ if (isLong(numBits))
+ numBits = numBits.toInt();
+ if ((numBits &= 63) === 0)
+ return this;
+ else if (numBits < 32)
+ return fromBits((this.low >>> numBits) | (this.high << (32 - numBits)), this.high >> numBits, this.unsigned);
+ else
+ return fromBits(this.high >> (numBits - 32), this.high >= 0 ? 0 : -1, this.unsigned);
+};
+
+/**
+ * Returns this Long with bits arithmetically shifted to the right by the given amount. This is an alias of {@link Long#shiftRight}.
+ * @function
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Shifted Long
+ */
+LongPrototype.shr = LongPrototype.shiftRight;
+
+/**
+ * Returns this Long with bits logically shifted to the right by the given amount.
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Shifted Long
+ */
+LongPrototype.shiftRightUnsigned = function shiftRightUnsigned(numBits) {
+ if (isLong(numBits))
+ numBits = numBits.toInt();
+ numBits &= 63;
+ if (numBits === 0)
+ return this;
+ else {
+ var high = this.high;
+ if (numBits < 32) {
+ var low = this.low;
+ return fromBits((low >>> numBits) | (high << (32 - numBits)), high >>> numBits, this.unsigned);
+ } else if (numBits === 32)
+ return fromBits(high, 0, this.unsigned);
+ else
+ return fromBits(high >>> (numBits - 32), 0, this.unsigned);
+ }
+};
+
+/**
+ * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.
+ * @function
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Shifted Long
+ */
+LongPrototype.shru = LongPrototype.shiftRightUnsigned;
+
+/**
+ * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.
+ * @function
+ * @param {number|!Long} numBits Number of bits
+ * @returns {!Long} Shifted Long
+ */
+LongPrototype.shr_u = LongPrototype.shiftRightUnsigned;
+
+/**
+ * Converts this Long to signed.
+ * @returns {!Long} Signed long
+ */
+LongPrototype.toSigned = function toSigned() {
+ if (!this.unsigned)
+ return this;
+ return fromBits(this.low, this.high, false);
+};
+
+/**
+ * Converts this Long to unsigned.
+ * @returns {!Long} Unsigned long
+ */
+LongPrototype.toUnsigned = function toUnsigned() {
+ if (this.unsigned)
+ return this;
+ return fromBits(this.low, this.high, true);
+};
+
+/**
+ * Converts this Long to its byte representation.
+ * @param {boolean=} le Whether little or big endian, defaults to big endian
+ * @returns {!Array.} Byte representation
+ */
+LongPrototype.toBytes = function toBytes(le) {
+ return le ? this.toBytesLE() : this.toBytesBE();
+};
+
+/**
+ * Converts this Long to its little endian byte representation.
+ * @returns {!Array.} Little endian byte representation
+ */
+LongPrototype.toBytesLE = function toBytesLE() {
+ var hi = this.high,
+ lo = this.low;
+ return [
+ lo & 0xff,
+ lo >>> 8 & 0xff,
+ lo >>> 16 & 0xff,
+ lo >>> 24 ,
+ hi & 0xff,
+ hi >>> 8 & 0xff,
+ hi >>> 16 & 0xff,
+ hi >>> 24
+ ];
+};
+
+/**
+ * Converts this Long to its big endian byte representation.
+ * @returns {!Array.} Big endian byte representation
+ */
+LongPrototype.toBytesBE = function toBytesBE() {
+ var hi = this.high,
+ lo = this.low;
+ return [
+ hi >>> 24 ,
+ hi >>> 16 & 0xff,
+ hi >>> 8 & 0xff,
+ hi & 0xff,
+ lo >>> 24 ,
+ lo >>> 16 & 0xff,
+ lo >>> 8 & 0xff,
+ lo & 0xff
+ ];
+};
+
+/**
+ * Creates a Long from its byte representation.
+ * @param {!Array.} bytes Byte representation
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @param {boolean=} le Whether little or big endian, defaults to big endian
+ * @returns {Long} The corresponding Long value
+ */
+Long.fromBytes = function fromBytes(bytes, unsigned, le) {
+ return le ? Long.fromBytesLE(bytes, unsigned) : Long.fromBytesBE(bytes, unsigned);
+};
+
+/**
+ * Creates a Long from its little endian byte representation.
+ * @param {!Array.} bytes Little endian byte representation
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @returns {Long} The corresponding Long value
+ */
+Long.fromBytesLE = function fromBytesLE(bytes, unsigned) {
+ return new Long(
+ bytes[0] |
+ bytes[1] << 8 |
+ bytes[2] << 16 |
+ bytes[3] << 24,
+ bytes[4] |
+ bytes[5] << 8 |
+ bytes[6] << 16 |
+ bytes[7] << 24,
+ unsigned
+ );
+};
+
+/**
+ * Creates a Long from its big endian byte representation.
+ * @param {!Array.} bytes Big endian byte representation
+ * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
+ * @returns {Long} The corresponding Long value
+ */
+Long.fromBytesBE = function fromBytesBE(bytes, unsigned) {
+ return new Long(
+ bytes[4] << 24 |
+ bytes[5] << 16 |
+ bytes[6] << 8 |
+ bytes[7],
+ bytes[0] << 24 |
+ bytes[1] << 16 |
+ bytes[2] << 8 |
+ bytes[3],
+ unsigned
+ );
+};
+
+
+/***/ }),
+
+/***/ "./node_modules/onnx-proto/dist/onnx.js":
+/*!**********************************************!*\
+ !*** ./node_modules/onnx-proto/dist/onnx.js ***!
+ \**********************************************/
+/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+
+"use strict";
+/*eslint-disable block-scoped-var, id-length, no-control-regex, no-magic-numbers, no-prototype-builtins, no-redeclare, no-shadow, no-var, sort-vars*/
+
+
+var $protobuf = __webpack_require__(/*! protobufjs/minimal */ "./node_modules/protobufjs/minimal.js");
+
+// Common aliases
+var $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;
+
+// Exported root namespace
+var $root = $protobuf.roots["default"] || ($protobuf.roots["default"] = {});
+
+$root.onnx = (function() {
+
+ /**
+ * Namespace onnx.
+ * @exports onnx
+ * @namespace
+ */
+ var onnx = {};
+
+ /**
+ * Version enum.
+ * @name onnx.Version
+ * @enum {string}
+ * @property {number} _START_VERSION=0 _START_VERSION value
+ * @property {number} IR_VERSION_2017_10_10=1 IR_VERSION_2017_10_10 value
+ * @property {number} IR_VERSION_2017_10_30=2 IR_VERSION_2017_10_30 value
+ * @property {number} IR_VERSION_2017_11_3=3 IR_VERSION_2017_11_3 value
+ * @property {number} IR_VERSION_2019_1_22=4 IR_VERSION_2019_1_22 value
+ * @property {number} IR_VERSION=5 IR_VERSION value
+ */
+ onnx.Version = (function() {
+ var valuesById = {}, values = Object.create(valuesById);
+ values[valuesById[0] = "_START_VERSION"] = 0;
+ values[valuesById[1] = "IR_VERSION_2017_10_10"] = 1;
+ values[valuesById[2] = "IR_VERSION_2017_10_30"] = 2;
+ values[valuesById[3] = "IR_VERSION_2017_11_3"] = 3;
+ values[valuesById[4] = "IR_VERSION_2019_1_22"] = 4;
+ values[valuesById[5] = "IR_VERSION"] = 5;
+ return values;
+ })();
+
+ onnx.AttributeProto = (function() {
+
+ /**
+ * Properties of an AttributeProto.
+ * @memberof onnx
+ * @interface IAttributeProto
+ * @property {string|null} [name] AttributeProto name
+ * @property {string|null} [refAttrName] AttributeProto refAttrName
+ * @property {string|null} [docString] AttributeProto docString
+ * @property {onnx.AttributeProto.AttributeType|null} [type] AttributeProto type
+ * @property {number|null} [f] AttributeProto f
+ * @property {number|Long|null} [i] AttributeProto i
+ * @property {Uint8Array|null} [s] AttributeProto s
+ * @property {onnx.ITensorProto|null} [t] AttributeProto t
+ * @property {onnx.IGraphProto|null} [g] AttributeProto g
+ * @property {Array.|null} [floats] AttributeProto floats
+ * @property {Array.|null} [ints] AttributeProto ints
+ * @property {Array.|null} [strings] AttributeProto strings
+ * @property {Array.|null} [tensors] AttributeProto tensors
+ * @property {Array.|null} [graphs] AttributeProto graphs
+ */
+
+ /**
+ * Constructs a new AttributeProto.
+ * @memberof onnx
+ * @classdesc Represents an AttributeProto.
+ * @implements IAttributeProto
+ * @constructor
+ * @param {onnx.IAttributeProto=} [properties] Properties to set
+ */
+ function AttributeProto(properties) {
+ this.floats = [];
+ this.ints = [];
+ this.strings = [];
+ this.tensors = [];
+ this.graphs = [];
+ if (properties)
+ for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)
+ if (properties[keys[i]] != null)
+ this[keys[i]] = properties[keys[i]];
+ }
+
+ /**
+ * AttributeProto name.
+ * @member {string} name
+ * @memberof onnx.AttributeProto
+ * @instance
+ */
+ AttributeProto.prototype.name = "";
+
+ /**
+ * AttributeProto refAttrName.
+ * @member {string} refAttrName
+ * @memberof onnx.AttributeProto
+ * @instance
+ */
+ AttributeProto.prototype.refAttrName = "";
+
+ /**
+ * AttributeProto docString.
+ * @member {string} docString
+ * @memberof onnx.AttributeProto
+ * @instance
+ */
+ AttributeProto.prototype.docString = "";
+
+ /**
+ * AttributeProto type.
+ * @member {onnx.AttributeProto.AttributeType} type
+ * @memberof onnx.AttributeProto
+ * @instance
+ */
+ AttributeProto.prototype.type = 0;
+
+ /**
+ * AttributeProto f.
+ * @member {number} f
+ * @memberof onnx.AttributeProto
+ * @instance
+ */
+ AttributeProto.prototype.f = 0;
+
+ /**
+ * AttributeProto i.
+ * @member {number|Long} i
+ * @memberof onnx.AttributeProto
+ * @instance
+ */
+ AttributeProto.prototype.i = $util.Long ? $util.Long.fromBits(0,0,false) : 0;
+
+ /**
+ * AttributeProto s.
+ * @member {Uint8Array} s
+ * @memberof onnx.AttributeProto
+ * @instance
+ */
+ AttributeProto.prototype.s = $util.newBuffer([]);
+
+ /**
+ * AttributeProto t.
+ * @member {onnx.ITensorProto|null|undefined} t
+ * @memberof onnx.AttributeProto
+ * @instance
+ */
+ AttributeProto.prototype.t = null;
+
+ /**
+ * AttributeProto g.
+ * @member {onnx.IGraphProto|null|undefined} g
+ * @memberof onnx.AttributeProto
+ * @instance
+ */
+ AttributeProto.prototype.g = null;
+
+ /**
+ * AttributeProto floats.
+ * @member {Array.} floats
+ * @memberof onnx.AttributeProto
+ * @instance
+ */
+ AttributeProto.prototype.floats = $util.emptyArray;
+
+ /**
+ * AttributeProto ints.
+ * @member {Array.} ints
+ * @memberof onnx.AttributeProto
+ * @instance
+ */
+ AttributeProto.prototype.ints = $util.emptyArray;
+
+ /**
+ * AttributeProto strings.
+ * @member {Array.} strings
+ * @memberof onnx.AttributeProto
+ * @instance
+ */
+ AttributeProto.prototype.strings = $util.emptyArray;
+
+ /**
+ * AttributeProto tensors.
+ * @member {Array.} tensors
+ * @memberof onnx.AttributeProto
+ * @instance
+ */
+ AttributeProto.prototype.tensors = $util.emptyArray;
+
+ /**
+ * AttributeProto graphs.
+ * @member {Array.} graphs
+ * @memberof onnx.AttributeProto
+ * @instance
+ */
+ AttributeProto.prototype.graphs = $util.emptyArray;
+
+ /**
+ * Creates a new AttributeProto instance using the specified properties.
+ * @function create
+ * @memberof onnx.AttributeProto
+ * @static
+ * @param {onnx.IAttributeProto=} [properties] Properties to set
+ * @returns {onnx.AttributeProto} AttributeProto instance
+ */
+ AttributeProto.create = function create(properties) {
+ return new AttributeProto(properties);
+ };
+
+ /**
+ * Encodes the specified AttributeProto message. Does not implicitly {@link onnx.AttributeProto.verify|verify} messages.
+ * @function encode
+ * @memberof onnx.AttributeProto
+ * @static
+ * @param {onnx.IAttributeProto} message AttributeProto message or plain object to encode
+ * @param {$protobuf.Writer} [writer] Writer to encode to
+ * @returns {$protobuf.Writer} Writer
+ */
+ AttributeProto.encode = function encode(message, writer) {
+ if (!writer)
+ writer = $Writer.create();
+ if (message.name != null && message.hasOwnProperty("name"))
+ writer.uint32(/* id 1, wireType 2 =*/10).string(message.name);
+ if (message.f != null && message.hasOwnProperty("f"))
+ writer.uint32(/* id 2, wireType 5 =*/21).float(message.f);
+ if (message.i != null && message.hasOwnProperty("i"))
+ writer.uint32(/* id 3, wireType 0 =*/24).int64(message.i);
+ if (message.s != null && message.hasOwnProperty("s"))
+ writer.uint32(/* id 4, wireType 2 =*/34).bytes(message.s);
+ if (message.t != null && message.hasOwnProperty("t"))
+ $root.onnx.TensorProto.encode(message.t, writer.uint32(/* id 5, wireType 2 =*/42).fork()).ldelim();
+ if (message.g != null && message.hasOwnProperty("g"))
+ $root.onnx.GraphProto.encode(message.g, writer.uint32(/* id 6, wireType 2 =*/50).fork()).ldelim();
+ if (message.floats != null && message.floats.length) {
+ writer.uint32(/* id 7, wireType 2 =*/58).fork();
+ for (var i = 0; i < message.floats.length; ++i)
+ writer.float(message.floats[i]);
+ writer.ldelim();
+ }
+ if (message.ints != null && message.ints.length) {
+ writer.uint32(/* id 8, wireType 2 =*/66).fork();
+ for (var i = 0; i < message.ints.length; ++i)
+ writer.int64(message.ints[i]);
+ writer.ldelim();
+ }
+ if (message.strings != null && message.strings.length)
+ for (var i = 0; i < message.strings.length; ++i)
+ writer.uint32(/* id 9, wireType 2 =*/74).bytes(message.strings[i]);
+ if (message.tensors != null && message.tensors.length)
+ for (var i = 0; i < message.tensors.length; ++i)
+ $root.onnx.TensorProto.encode(message.tensors[i], writer.uint32(/* id 10, wireType 2 =*/82).fork()).ldelim();
+ if (message.graphs != null && message.graphs.length)
+ for (var i = 0; i < message.graphs.length; ++i)
+ $root.onnx.GraphProto.encode(message.graphs[i], writer.uint32(/* id 11, wireType 2 =*/90).fork()).ldelim();
+ if (message.docString != null && message.hasOwnProperty("docString"))
+ writer.uint32(/* id 13, wireType 2 =*/106).string(message.docString);
+ if (message.type != null && message.hasOwnProperty("type"))
+ writer.uint32(/* id 20, wireType 0 =*/160).int32(message.type);
+ if (message.refAttrName != null && message.hasOwnProperty("refAttrName"))
+ writer.uint32(/* id 21, wireType 2 =*/170).string(message.refAttrName);
+ return writer;
+ };
+
+ /**
+ * Encodes the specified AttributeProto message, length delimited. Does not implicitly {@link onnx.AttributeProto.verify|verify} messages.
+ * @function encodeDelimited
+ * @memberof onnx.AttributeProto
+ * @static
+ * @param {onnx.IAttributeProto} message AttributeProto message or plain object to encode
+ * @param {$protobuf.Writer} [writer] Writer to encode to
+ * @returns {$protobuf.Writer} Writer
+ */
+ AttributeProto.encodeDelimited = function encodeDelimited(message, writer) {
+ return this.encode(message, writer).ldelim();
+ };
+
+ /**
+ * Decodes an AttributeProto message from the specified reader or buffer.
+ * @function decode
+ * @memberof onnx.AttributeProto
+ * @static
+ * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from
+ * @param {number} [length] Message length if known beforehand
+ * @returns {onnx.AttributeProto} AttributeProto
+ * @throws {Error} If the payload is not a reader or valid buffer
+ * @throws {$protobuf.util.ProtocolError} If required fields are missing
+ */
+ AttributeProto.decode = function decode(reader, length) {
+ if (!(reader instanceof $Reader))
+ reader = $Reader.create(reader);
+ var end = length === undefined ? reader.len : reader.pos + length, message = new $root.onnx.AttributeProto();
+ while (reader.pos < end) {
+ var tag = reader.uint32();
+ switch (tag >>> 3) {
+ case 1:
+ message.name = reader.string();
+ break;
+ case 21:
+ message.refAttrName = reader.string();
+ break;
+ case 13:
+ message.docString = reader.string();
+ break;
+ case 20:
+ message.type = reader.int32();
+ break;
+ case 2:
+ message.f = reader.float();
+ break;
+ case 3:
+ message.i = reader.int64();
+ break;
+ case 4:
+ message.s = reader.bytes();
+ break;
+ case 5:
+ message.t = $root.onnx.TensorProto.decode(reader, reader.uint32());
+ break;
+ case 6:
+ message.g = $root.onnx.GraphProto.decode(reader, reader.uint32());
+ break;
+ case 7:
+ if (!(message.floats && message.floats.length))
+ message.floats = [];
+ if ((tag & 7) === 2) {
+ var end2 = reader.uint32() + reader.pos;
+ while (reader.pos < end2)
+ message.floats.push(reader.float());
+ } else
+ message.floats.push(reader.float());
+ break;
+ case 8:
+ if (!(message.ints && message.ints.length))
+ message.ints = [];
+ if ((tag & 7) === 2) {
+ var end2 = reader.uint32() + reader.pos;
+ while (reader.pos < end2)
+ message.ints.push(reader.int64());
+ } else
+ message.ints.push(reader.int64());
+ break;
+ case 9:
+ if (!(message.strings && message.strings.length))
+ message.strings = [];
+ message.strings.push(reader.bytes());
+ break;
+ case 10:
+ if (!(message.tensors && message.tensors.length))
+ message.tensors = [];
+ message.tensors.push($root.onnx.TensorProto.decode(reader, reader.uint32()));
+ break;
+ case 11:
+ if (!(message.graphs && message.graphs.length))
+ message.graphs = [];
+ message.graphs.push($root.onnx.GraphProto.decode(reader, reader.uint32()));
+ break;
+ default:
+ reader.skipType(tag & 7);
+ break;
+ }
+ }
+ return message;
+ };
+
+ /**
+ * Decodes an AttributeProto message from the specified reader or buffer, length delimited.
+ * @function decodeDelimited
+ * @memberof onnx.AttributeProto
+ * @static
+ * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from
+ * @returns {onnx.AttributeProto} AttributeProto
+ * @throws {Error} If the payload is not a reader or valid buffer
+ * @throws {$protobuf.util.ProtocolError} If required fields are missing
+ */
+ AttributeProto.decodeDelimited = function decodeDelimited(reader) {
+ if (!(reader instanceof $Reader))
+ reader = new $Reader(reader);
+ return this.decode(reader, reader.uint32());
+ };
+
+ /**
+ * Verifies an AttributeProto message.
+ * @function verify
+ * @memberof onnx.AttributeProto
+ * @static
+ * @param {Object.} message Plain object to verify
+ * @returns {string|null} `null` if valid, otherwise the reason why it is not
+ */
+ AttributeProto.verify = function verify(message) {
+ if (typeof message !== "object" || message === null)
+ return "object expected";
+ if (message.name != null && message.hasOwnProperty("name"))
+ if (!$util.isString(message.name))
+ return "name: string expected";
+ if (message.refAttrName != null && message.hasOwnProperty("refAttrName"))
+ if (!$util.isString(message.refAttrName))
+ return "refAttrName: string expected";
+ if (message.docString != null && message.hasOwnProperty("docString"))
+ if (!$util.isString(message.docString))
+ return "docString: string expected";
+ if (message.type != null && message.hasOwnProperty("type"))
+ switch (message.type) {
+ default:
+ return "type: enum value expected";
+ case 0:
+ case 1:
+ case 2:
+ case 3:
+ case 4:
+ case 5:
+ case 6:
+ case 7:
+ case 8:
+ case 9:
+ case 10:
+ break;
+ }
+ if (message.f != null && message.hasOwnProperty("f"))
+ if (typeof message.f !== "number")
+ return "f: number expected";
+ if (message.i != null && message.hasOwnProperty("i"))
+ if (!$util.isInteger(message.i) && !(message.i && $util.isInteger(message.i.low) && $util.isInteger(message.i.high)))
+ return "i: integer|Long expected";
+ if (message.s != null && message.hasOwnProperty("s"))
+ if (!(message.s && typeof message.s.length === "number" || $util.isString(message.s)))
+ return "s: buffer expected";
+ if (message.t != null && message.hasOwnProperty("t")) {
+ var error = $root.onnx.TensorProto.verify(message.t);
+ if (error)
+ return "t." + error;
+ }
+ if (message.g != null && message.hasOwnProperty("g")) {
+ var error = $root.onnx.GraphProto.verify(message.g);
+ if (error)
+ return "g." + error;
+ }
+ if (message.floats != null && message.hasOwnProperty("floats")) {
+ if (!Array.isArray(message.floats))
+ return "floats: array expected";
+ for (var i = 0; i < message.floats.length; ++i)
+ if (typeof message.floats[i] !== "number")
+ return "floats: number[] expected";
+ }
+ if (message.ints != null && message.hasOwnProperty("ints")) {
+ if (!Array.isArray(message.ints))
+ return "ints: array expected";
+ for (var i = 0; i < message.ints.length; ++i)
+ if (!$util.isInteger(message.ints[i]) && !(message.ints[i] && $util.isInteger(message.ints[i].low) && $util.isInteger(message.ints[i].high)))
+ return "ints: integer|Long[] expected";
+ }
+ if (message.strings != null && message.hasOwnProperty("strings")) {
+ if (!Array.isArray(message.strings))
+ return "strings: array expected";
+ for (var i = 0; i < message.strings.length; ++i)
+ if (!(message.strings[i] && typeof message.strings[i].length === "number" || $util.isString(message.strings[i])))
+ return "strings: buffer[] expected";
+ }
+ if (message.tensors != null && message.hasOwnProperty("tensors")) {
+ if (!Array.isArray(message.tensors))
+ return "tensors: array expected";
+ for (var i = 0; i < message.tensors.length; ++i) {
+ var error = $root.onnx.TensorProto.verify(message.tensors[i]);
+ if (error)
+ return "tensors." + error;
+ }
+ }
+ if (message.graphs != null && message.hasOwnProperty("graphs")) {
+ if (!Array.isArray(message.graphs))
+ return "graphs: array expected";
+ for (var i = 0; i < message.graphs.length; ++i) {
+ var error = $root.onnx.GraphProto.verify(message.graphs[i]);
+ if (error)
+ return "graphs." + error;
+ }
+ }
+ return null;
+ };
+
+ /**
+ * Creates an AttributeProto message from a plain object. Also converts values to their respective internal types.
+ * @function fromObject
+ * @memberof onnx.AttributeProto
+ * @static
+ * @param {Object.} object Plain object
+ * @returns {onnx.AttributeProto} AttributeProto
+ */
+ AttributeProto.fromObject = function fromObject(object) {
+ if (object instanceof $root.onnx.AttributeProto)
+ return object;
+ var message = new $root.onnx.AttributeProto();
+ if (object.name != null)
+ message.name = String(object.name);
+ if (object.refAttrName != null)
+ message.refAttrName = String(object.refAttrName);
+ if (object.docString != null)
+ message.docString = String(object.docString);
+ switch (object.type) {
+ case "UNDEFINED":
+ case 0:
+ message.type = 0;
+ break;
+ case "FLOAT":
+ case 1:
+ message.type = 1;
+ break;
+ case "INT":
+ case 2:
+ message.type = 2;
+ break;
+ case "STRING":
+ case 3:
+ message.type = 3;
+ break;
+ case "TENSOR":
+ case 4:
+ message.type = 4;
+ break;
+ case "GRAPH":
+ case 5:
+ message.type = 5;
+ break;
+ case "FLOATS":
+ case 6:
+ message.type = 6;
+ break;
+ case "INTS":
+ case 7:
+ message.type = 7;
+ break;
+ case "STRINGS":
+ case 8:
+ message.type = 8;
+ break;
+ case "TENSORS":
+ case 9:
+ message.type = 9;
+ break;
+ case "GRAPHS":
+ case 10:
+ message.type = 10;
+ break;
+ }
+ if (object.f != null)
+ message.f = Number(object.f);
+ if (object.i != null)
+ if ($util.Long)
+ (message.i = $util.Long.fromValue(object.i)).unsigned = false;
+ else if (typeof object.i === "string")
+ message.i = parseInt(object.i, 10);
+ else if (typeof object.i === "number")
+ message.i = object.i;
+ else if (typeof object.i === "object")
+ message.i = new $util.LongBits(object.i.low >>> 0, object.i.high >>> 0).toNumber();
+ if (object.s != null)
+ if (typeof object.s === "string")
+ $util.base64.decode(object.s, message.s = $util.newBuffer($util.base64.length(object.s)), 0);
+ else if (object.s.length)
+ message.s = object.s;
+ if (object.t != null) {
+ if (typeof object.t !== "object")
+ throw TypeError(".onnx.AttributeProto.t: object expected");
+ message.t = $root.onnx.TensorProto.fromObject(object.t);
+ }
+ if (object.g != null) {
+ if (typeof object.g !== "object")
+ throw TypeError(".onnx.AttributeProto.g: object expected");
+ message.g = $root.onnx.GraphProto.fromObject(object.g);
+ }
+ if (object.floats) {
+ if (!Array.isArray(object.floats))
+ throw TypeError(".onnx.AttributeProto.floats: array expected");
+ message.floats = [];
+ for (var i = 0; i < object.floats.length; ++i)
+ message.floats[i] = Number(object.floats[i]);
+ }
+ if (object.ints) {
+ if (!Array.isArray(object.ints))
+ throw TypeError(".onnx.AttributeProto.ints: array expected");
+ message.ints = [];
+ for (var i = 0; i < object.ints.length; ++i)
+ if ($util.Long)
+ (message.ints[i] = $util.Long.fromValue(object.ints[i])).unsigned = false;
+ else if (typeof object.ints[i] === "string")
+ message.ints[i] = parseInt(object.ints[i], 10);
+ else if (typeof object.ints[i] === "number")
+ message.ints[i] = object.ints[i];
+ else if (typeof object.ints[i] === "object")
+ message.ints[i] = new $util.LongBits(object.ints[i].low >>> 0, object.ints[i].high >>> 0).toNumber();
+ }
+ if (object.strings) {
+ if (!Array.isArray(object.strings))
+ throw TypeError(".onnx.AttributeProto.strings: array expected");
+ message.strings = [];
+ for (var i = 0; i < object.strings.length; ++i)
+ if (typeof object.strings[i] === "string")
+ $util.base64.decode(object.strings[i], message.strings[i] = $util.newBuffer($util.base64.length(object.strings[i])), 0);
+ else if (object.strings[i].length)
+ message.strings[i] = object.strings[i];
+ }
+ if (object.tensors) {
+ if (!Array.isArray(object.tensors))
+ throw TypeError(".onnx.AttributeProto.tensors: array expected");
+ message.tensors = [];
+ for (var i = 0; i < object.tensors.length; ++i) {
+ if (typeof object.tensors[i] !== "object")
+ throw TypeError(".onnx.AttributeProto.tensors: object expected");
+ message.tensors[i] = $root.onnx.TensorProto.fromObject(object.tensors[i]);
+ }
+ }
+ if (object.graphs) {
+ if (!Array.isArray(object.graphs))
+ throw TypeError(".onnx.AttributeProto.graphs: array expected");
+ message.graphs = [];
+ for (var i = 0; i < object.graphs.length; ++i) {
+ if (typeof object.graphs[i] !== "object")
+ throw TypeError(".onnx.AttributeProto.graphs: object expected");
+ message.graphs[i] = $root.onnx.GraphProto.fromObject(object.graphs[i]);
+ }
+ }
+ return message;
+ };
+
+ /**
+ * Creates a plain object from an AttributeProto message. Also converts values to other types if specified.
+ * @function toObject
+ * @memberof onnx.AttributeProto
+ * @static
+ * @param {onnx.AttributeProto} message AttributeProto
+ * @param {$protobuf.IConversionOptions} [options] Conversion options
+ * @returns {Object.} Plain object
+ */
+ AttributeProto.toObject = function toObject(message, options) {
+ if (!options)
+ options = {};
+ var object = {};
+ if (options.arrays || options.defaults) {
+ object.floats = [];
+ object.ints = [];
+ object.strings = [];
+ object.tensors = [];
+ object.graphs = [];
+ }
+ if (options.defaults) {
+ object.name = "";
+ object.f = 0;
+ if ($util.Long) {
+ var long = new $util.Long(0, 0, false);
+ object.i = options.longs === String ? long.toString() : options.longs === Number ? long.toNumber() : long;
+ } else
+ object.i = options.longs === String ? "0" : 0;
+ if (options.bytes === String)
+ object.s = "";
+ else {
+ object.s = [];
+ if (options.bytes !== Array)
+ object.s = $util.newBuffer(object.s);
+ }
+ object.t = null;
+ object.g = null;
+ object.docString = "";
+ object.type = options.enums === String ? "UNDEFINED" : 0;
+ object.refAttrName = "";
+ }
+ if (message.name != null && message.hasOwnProperty("name"))
+ object.name = message.name;
+ if (message.f != null && message.hasOwnProperty("f"))
+ object.f = options.json && !isFinite(message.f) ? String(message.f) : message.f;
+ if (message.i != null && message.hasOwnProperty("i"))
+ if (typeof message.i === "number")
+ object.i = options.longs === String ? String(message.i) : message.i;
+ else
+ object.i = options.longs === String ? $util.Long.prototype.toString.call(message.i) : options.longs === Number ? new $util.LongBits(message.i.low >>> 0, message.i.high >>> 0).toNumber() : message.i;
+ if (message.s != null && message.hasOwnProperty("s"))
+ object.s = options.bytes === String ? $util.base64.encode(message.s, 0, message.s.length) : options.bytes === Array ? Array.prototype.slice.call(message.s) : message.s;
+ if (message.t != null && message.hasOwnProperty("t"))
+ object.t = $root.onnx.TensorProto.toObject(message.t, options);
+ if (message.g != null && message.hasOwnProperty("g"))
+ object.g = $root.onnx.GraphProto.toObject(message.g, options);
+ if (message.floats && message.floats.length) {
+ object.floats = [];
+ for (var j = 0; j < message.floats.length; ++j)
+ object.floats[j] = options.json && !isFinite(message.floats[j]) ? String(message.floats[j]) : message.floats[j];
+ }
+ if (message.ints && message.ints.length) {
+ object.ints = [];
+ for (var j = 0; j < message.ints.length; ++j)
+ if (typeof message.ints[j] === "number")
+ object.ints[j] = options.longs === String ? String(message.ints[j]) : message.ints[j];
+ else
+ object.ints[j] = options.longs === String ? $util.Long.prototype.toString.call(message.ints[j]) : options.longs === Number ? new $util.LongBits(message.ints[j].low >>> 0, message.ints[j].high >>> 0).toNumber() : message.ints[j];
+ }
+ if (message.strings && message.strings.length) {
+ object.strings = [];
+ for (var j = 0; j < message.strings.length; ++j)
+ object.strings[j] = options.bytes === String ? $util.base64.encode(message.strings[j], 0, message.strings[j].length) : options.bytes === Array ? Array.prototype.slice.call(message.strings[j]) : message.strings[j];
+ }
+ if (message.tensors && message.tensors.length) {
+ object.tensors = [];
+ for (var j = 0; j < message.tensors.length; ++j)
+ object.tensors[j] = $root.onnx.TensorProto.toObject(message.tensors[j], options);
+ }
+ if (message.graphs && message.graphs.length) {
+ object.graphs = [];
+ for (var j = 0; j < message.graphs.length; ++j)
+ object.graphs[j] = $root.onnx.GraphProto.toObject(message.graphs[j], options);
+ }
+ if (message.docString != null && message.hasOwnProperty("docString"))
+ object.docString = message.docString;
+ if (message.type != null && message.hasOwnProperty("type"))
+ object.type = options.enums === String ? $root.onnx.AttributeProto.AttributeType[message.type] : message.type;
+ if (message.refAttrName != null && message.hasOwnProperty("refAttrName"))
+ object.refAttrName = message.refAttrName;
+ return object;
+ };
+
+ /**
+ * Converts this AttributeProto to JSON.
+ * @function toJSON
+ * @memberof onnx.AttributeProto
+ * @instance
+ * @returns {Object.} JSON object
+ */
+ AttributeProto.prototype.toJSON = function toJSON() {
+ return this.constructor.toObject(this, $protobuf.util.toJSONOptions);
+ };
+
+ /**
+ * AttributeType enum.
+ * @name onnx.AttributeProto.AttributeType
+ * @enum {string}
+ * @property {number} UNDEFINED=0 UNDEFINED value
+ * @property {number} FLOAT=1 FLOAT value
+ * @property {number} INT=2 INT value
+ * @property {number} STRING=3 STRING value
+ * @property {number} TENSOR=4 TENSOR value
+ * @property {number} GRAPH=5 GRAPH value
+ * @property {number} FLOATS=6 FLOATS value
+ * @property {number} INTS=7 INTS value
+ * @property {number} STRINGS=8 STRINGS value
+ * @property {number} TENSORS=9 TENSORS value
+ * @property {number} GRAPHS=10 GRAPHS value
+ */
+ AttributeProto.AttributeType = (function() {
+ var valuesById = {}, values = Object.create(valuesById);
+ values[valuesById[0] = "UNDEFINED"] = 0;
+ values[valuesById[1] = "FLOAT"] = 1;
+ values[valuesById[2] = "INT"] = 2;
+ values[valuesById[3] = "STRING"] = 3;
+ values[valuesById[4] = "TENSOR"] = 4;
+ values[valuesById[5] = "GRAPH"] = 5;
+ values[valuesById[6] = "FLOATS"] = 6;
+ values[valuesById[7] = "INTS"] = 7;
+ values[valuesById[8] = "STRINGS"] = 8;
+ values[valuesById[9] = "TENSORS"] = 9;
+ values[valuesById[10] = "GRAPHS"] = 10;
+ return values;
+ })();
+
+ return AttributeProto;
+ })();
+
+ onnx.ValueInfoProto = (function() {
+
+ /**
+ * Properties of a ValueInfoProto.
+ * @memberof onnx
+ * @interface IValueInfoProto
+ * @property {string|null} [name] ValueInfoProto name
+ * @property {onnx.ITypeProto|null} [type] ValueInfoProto type
+ * @property {string|null} [docString] ValueInfoProto docString
+ */
+
+ /**
+ * Constructs a new ValueInfoProto.
+ * @memberof onnx
+ * @classdesc Represents a ValueInfoProto.
+ * @implements IValueInfoProto
+ * @constructor
+ * @param {onnx.IValueInfoProto=} [properties] Properties to set
+ */
+ function ValueInfoProto(properties) {
+ if (properties)
+ for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)
+ if (properties[keys[i]] != null)
+ this[keys[i]] = properties[keys[i]];
+ }
+
+ /**
+ * ValueInfoProto name.
+ * @member {string} name
+ * @memberof onnx.ValueInfoProto
+ * @instance
+ */
+ ValueInfoProto.prototype.name = "";
+
+ /**
+ * ValueInfoProto type.
+ * @member {onnx.ITypeProto|null|undefined} type
+ * @memberof onnx.ValueInfoProto
+ * @instance
+ */
+ ValueInfoProto.prototype.type = null;
+
+ /**
+ * ValueInfoProto docString.
+ * @member {string} docString
+ * @memberof onnx.ValueInfoProto
+ * @instance
+ */
+ ValueInfoProto.prototype.docString = "";
+
+ /**
+ * Creates a new ValueInfoProto instance using the specified properties.
+ * @function create
+ * @memberof onnx.ValueInfoProto
+ * @static
+ * @param {onnx.IValueInfoProto=} [properties] Properties to set
+ * @returns {onnx.ValueInfoProto} ValueInfoProto instance
+ */
+ ValueInfoProto.create = function create(properties) {
+ return new ValueInfoProto(properties);
+ };
+
+ /**
+ * Encodes the specified ValueInfoProto message. Does not implicitly {@link onnx.ValueInfoProto.verify|verify} messages.
+ * @function encode
+ * @memberof onnx.ValueInfoProto
+ * @static
+ * @param {onnx.IValueInfoProto} message ValueInfoProto message or plain object to encode
+ * @param {$protobuf.Writer} [writer] Writer to encode to
+ * @returns {$protobuf.Writer} Writer
+ */
+ ValueInfoProto.encode = function encode(message, writer) {
+ if (!writer)
+ writer = $Writer.create();
+ if (message.name != null && message.hasOwnProperty("name"))
+ writer.uint32(/* id 1, wireType 2 =*/10).string(message.name);
+ if (message.type != null && message.hasOwnProperty("type"))
+ $root.onnx.TypeProto.encode(message.type, writer.uint32(/* id 2, wireType 2 =*/18).fork()).ldelim();
+ if (message.docString != null && message.hasOwnProperty("docString"))
+ writer.uint32(/* id 3, wireType 2 =*/26).string(message.docString);
+ return writer;
+ };
+
+ /**
+ * Encodes the specified ValueInfoProto message, length delimited. Does not implicitly {@link onnx.ValueInfoProto.verify|verify} messages.
+ * @function encodeDelimited
+ * @memberof onnx.ValueInfoProto
+ * @static
+ * @param {onnx.IValueInfoProto} message ValueInfoProto message or plain object to encode
+ * @param {$protobuf.Writer} [writer] Writer to encode to
+ * @returns {$protobuf.Writer} Writer
+ */
+ ValueInfoProto.encodeDelimited = function encodeDelimited(message, writer) {
+ return this.encode(message, writer).ldelim();
+ };
+
+ /**
+ * Decodes a ValueInfoProto message from the specified reader or buffer.
+ * @function decode
+ * @memberof onnx.ValueInfoProto
+ * @static
+ * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from
+ * @param {number} [length] Message length if known beforehand
+ * @returns {onnx.ValueInfoProto} ValueInfoProto
+ * @throws {Error} If the payload is not a reader or valid buffer
+ * @throws {$protobuf.util.ProtocolError} If required fields are missing
+ */
+ ValueInfoProto.decode = function decode(reader, length) {
+ if (!(reader instanceof $Reader))
+ reader = $Reader.create(reader);
+ var end = length === undefined ? reader.len : reader.pos + length, message = new $root.onnx.ValueInfoProto();
+ while (reader.pos < end) {
+ var tag = reader.uint32();
+ switch (tag >>> 3) {
+ case 1:
+ message.name = reader.string();
+ break;
+ case 2:
+ message.type = $root.onnx.TypeProto.decode(reader, reader.uint32());
+ break;
+ case 3:
+ message.docString = reader.string();
+ break;
+ default:
+ reader.skipType(tag & 7);
+ break;
+ }
+ }
+ return message;
+ };
+
+ /**
+ * Decodes a ValueInfoProto message from the specified reader or buffer, length delimited.
+ * @function decodeDelimited
+ * @memberof onnx.ValueInfoProto
+ * @static
+ * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from
+ * @returns {onnx.ValueInfoProto} ValueInfoProto
+ * @throws {Error} If the payload is not a reader or valid buffer
+ * @throws {$protobuf.util.ProtocolError} If required fields are missing
+ */
+ ValueInfoProto.decodeDelimited = function decodeDelimited(reader) {
+ if (!(reader instanceof $Reader))
+ reader = new $Reader(reader);
+ return this.decode(reader, reader.uint32());
+ };
+
+ /**
+ * Verifies a ValueInfoProto message.
+ * @function verify
+ * @memberof onnx.ValueInfoProto
+ * @static
+ * @param {Object.} message Plain object to verify
+ * @returns {string|null} `null` if valid, otherwise the reason why it is not
+ */
+ ValueInfoProto.verify = function verify(message) {
+ if (typeof message !== "object" || message === null)
+ return "object expected";
+ if (message.name != null && message.hasOwnProperty("name"))
+ if (!$util.isString(message.name))
+ return "name: string expected";
+ if (message.type != null && message.hasOwnProperty("type")) {
+ var error = $root.onnx.TypeProto.verify(message.type);
+ if (error)
+ return "type." + error;
+ }
+ if (message.docString != null && message.hasOwnProperty("docString"))
+ if (!$util.isString(message.docString))
+ return "docString: string expected";
+ return null;
+ };
+
+ /**
+ * Creates a ValueInfoProto message from a plain object. Also converts values to their respective internal types.
+ * @function fromObject
+ * @memberof onnx.ValueInfoProto
+ * @static
+ * @param {Object.} object Plain object
+ * @returns {onnx.ValueInfoProto} ValueInfoProto
+ */
+ ValueInfoProto.fromObject = function fromObject(object) {
+ if (object instanceof $root.onnx.ValueInfoProto)
+ return object;
+ var message = new $root.onnx.ValueInfoProto();
+ if (object.name != null)
+ message.name = String(object.name);
+ if (object.type != null) {
+ if (typeof object.type !== "object")
+ throw TypeError(".onnx.ValueInfoProto.type: object expected");
+ message.type = $root.onnx.TypeProto.fromObject(object.type);
+ }
+ if (object.docString != null)
+ message.docString = String(object.docString);
+ return message;
+ };
+
+ /**
+ * Creates a plain object from a ValueInfoProto message. Also converts values to other types if specified.
+ * @function toObject
+ * @memberof onnx.ValueInfoProto
+ * @static
+ * @param {onnx.ValueInfoProto} message ValueInfoProto
+ * @param {$protobuf.IConversionOptions} [options] Conversion options
+ * @returns {Object.} Plain object
+ */
+ ValueInfoProto.toObject = function toObject(message, options) {
+ if (!options)
+ options = {};
+ var object = {};
+ if (options.defaults) {
+ object.name = "";
+ object.type = null;
+ object.docString = "";
+ }
+ if (message.name != null && message.hasOwnProperty("name"))
+ object.name = message.name;
+ if (message.type != null && message.hasOwnProperty("type"))
+ object.type = $root.onnx.TypeProto.toObject(message.type, options);
+ if (message.docString != null && message.hasOwnProperty("docString"))
+ object.docString = message.docString;
+ return object;
+ };
+
+ /**
+ * Converts this ValueInfoProto to JSON.
+ * @function toJSON
+ * @memberof onnx.ValueInfoProto
+ * @instance
+ * @returns {Object.} JSON object
+ */
+ ValueInfoProto.prototype.toJSON = function toJSON() {
+ return this.constructor.toObject(this, $protobuf.util.toJSONOptions);
+ };
+
+ return ValueInfoProto;
+ })();
+
+ onnx.NodeProto = (function() {
+
+ /**
+ * Properties of a NodeProto.
+ * @memberof onnx
+ * @interface INodeProto
+ * @property {Array.|null} [input] NodeProto input
+ * @property {Array.|null} [output] NodeProto output
+ * @property {string|null} [name] NodeProto name
+ * @property {string|null} [opType] NodeProto opType
+ * @property {string|null} [domain] NodeProto domain
+ * @property {Array.|null} [attribute] NodeProto attribute
+ * @property {string|null} [docString] NodeProto docString
+ */
+
+ /**
+ * Constructs a new NodeProto.
+ * @memberof onnx
+ * @classdesc Represents a NodeProto.
+ * @implements INodeProto
+ * @constructor
+ * @param {onnx.INodeProto=} [properties] Properties to set
+ */
+ function NodeProto(properties) {
+ this.input = [];
+ this.output = [];
+ this.attribute = [];
+ if (properties)
+ for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)
+ if (properties[keys[i]] != null)
+ this[keys[i]] = properties[keys[i]];
+ }
+
+ /**
+ * NodeProto input.
+ * @member {Array.